• Korean Journal of Cognitive Science
• /
• v.11 no.1
• /
• pp.47-65
• /
• 2000

Categorization systems of homepages in search engines are likely to be constructed considering system's efficiency only but not user-centered. This study I investigated user's mental model of superordinate and subordinate categories using category terms of major Korean search engines. From this result, we constructed two kinds of categorization system; redundant system and singular system. In the redundant system, for example, a subordinate category can belong to a number of superordinate categories, but in the singular system to only one superordinate category Three prototype categorization systems, with 'Simmani', were designed and search performances of each system were observed repetitively Overall results, with frequency of correct a answers, number of steps and time taken in solution taken into account, showed the redundant system was superior to the other two systems. This indicates that categorization search could be improved with appropriate categorizaton system. However. l in recognition test score in singular system was the best, which indicates that search performance and recognition memory of categorization reveal different aspects of categorization system learning. Issues of category organization. ways of interface, prior knowledge, exploratory learning, and application areas are discussed further.

• Journal of the Korea Convergence Society
• /
• v.11 no.2
• /
• pp.1-8
• /
• 2020

In this paper, we propose an optimal path search algorithm between each node and midpoint that applies the time weighting. Services for using a location of mid point usually provide a mid point location-based on the location of users. There is a problem that is not efficient in terms of time because a location-based search method is only considered for location. To solve the problem of the existing location-based search method, the proposed algorithm sets the weights between each node and midpoint by reflecting user's location information and required time. Then, by utilizing that, it is possible to search for an optimum path. In addition, to increase the efficiency of the search, it ensures high accuracy by setting weights adaptively to the information given. Experimental results show that the proposed algorithm is able to find the optimal path to the midpoint compared with the existing method.

• Interdisciplinary Bio Central
• /
• v.3 no.2
• /
• pp.7.1-7.6
• /
• 2011

Background: Published manuscripts are the main source of biological knowledge. Since the manual examination is almost impossible due to the huge volume of literature data (approximately 19 million abstracts in PubMed), intelligent text mining systems are of great utility for knowledge discovery. However, most of current text mining tools have limited applicability because of i) providing abstract-based search rather than sentence-based search, ii) improper use or lack of ontology terms, iii) the design to be used for specific subjects, or iv) slow response time that hampers web services and real time applications. Results: We introduce an advanced text mining system called PubMine that supports intelligent knowledge discovery based on diverse bio-ontologies. PubMine improves query accuracy and flexibility with advanced search capabilities of fuzzy search, wildcard search, proximity search, range search, and the Boolean combinations. Furthermore, PubMine allows users to extract multi-dimensional relationships between genes, diseases, and chemical compounds by using OLAP (On-Line Analytical Processing) techniques. The HUGO gene symbols and the MeSH ontology for diseases, chemical compounds, and anatomy have been included in the current version of PubMine, which is freely available at http://pubmine.kobic.re.kr. Conclusions: PubMine is a unique bio-text mining system that provides flexible searches and analysis of biological entity relationships. We believe that PubMine would serve as a key bioinformatics utility due to its rapid response to enable web services for community and to the flexibility to accommodate general ontology.

• Journal of Korean Library and Information Science Society
• /
• v.42 no.2
• /
• pp.257-276
• /
• 2011

The purpose of this study is to compare and analyze the functions and characteristics of search interfaces of Korean Old and Rare Collection Information System(KORCIS) and Korean History Online. The checklist of OPAC functionalities proposed by Breeding was used to examine eleven functions of these systems. Both system provide the following functions: Search by keywords; Boolean operators in queries; Order results chronologically; Modify search without re-keying the initial terms ; Search within result sets ; and Ability to limit results to an individual library or education. They do not provide such functions as Browse by author, title, subject and View and recall the search history for the current session. Adoption of standard OPAC and next-generation catalog functionalities, in-depth understanding of user needs and information seeking behaviors, and the improvement of subject access to these systems are suggested in this study.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.99-108
• /
• 2008

For video compression, we have to consider two performance factors that are the search speed and coded video's quality. In this paper, we propose an enhanced fast block matching algorithm using the spatial correlation of the video sequence and the center-biased characteristic of motion vectors(MV). The proposed algorithm first finds a predicted motion vector from the adjacent macro blocks of the current frame and determines an exact motion vector using the cross pattern and a flat hexagon search pattern. From the performance evaluations, we can see that our algorithm outperforms both the hexagon-based search(HEXBS) and the cross-hexagon search(CHS) algorithms in terms of the search speed and coded video's quality. Using our algorithm, we can improve the search speed by up to 31%, and also increase the PSNR(Peak Signal Noise Ratio) by at most 0.5 dB, thereby improving the video quality.

• Journal of Digital Convergence
• /
• v.17 no.12
• /
• pp.255-260
• /
• 2019

Real-time search keywords are not only limited to search keywords that are rapidly increasing interest in real-time, but also have a limitation that they are difficult to determine the sustainability as there is a difference in ranking between portal sites. Estimating sustainability for real-time search keywords is significant in terms of overcoming these limitations and providing some predictability. In particular, long-term search keywords that last for more than a month are of high value as long-lasting social issues. Therefore, in this paper, we analyze the interest based on the ranking of the real-time search keywords and the duration based on sustained weeks, days and hours of real-time search keywords by each portal site and the integrated portal site, and then estimating sustainability based on high level of interest and duration, and present a method to derive real-time search issues with high long-term sustainability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.23-33
• /
• 2007

Video compression is essential technique for fast and efficient transmission of a large amount of video data maintaining high quality. Also, motion estimation and motion compensation is most important technique for efficient video compression. A proposed method is improved diamond search method which uses split diamond pattern and rotated diamond pattern. In particular, the proposed method shows superb result when it is used for the sequence with a direction of camera moving. Moreover when it is used for the sequence with little motion, complexity is reduced considerably by using fewer search points. Also, by varying the number of initial search points, the propose method can provide several options in terms of duality or speed. Simulation results shows that the proposed method sustains better visual quality compared with diamond search method and HEXBS even by using fewer search points. Besides, compared with existing methods, it is able to conduct a motion estimation more efficiently by changing the number of search points adaptively according to motion of video data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.8
• /
• pp.1196-1204
• /
• 2022

In this paper, we propose an optimization algorithm that maximizes the network lifetime in wireless ad-hoc networks using the broadcast transmission method. The optimization algorithm proposed in this paper applies tabu search algorithm, a metaheuristic method that improves the local search method using the memory structure. The proposed tabu search algorithm proposes efficient encoding and neighborhood search method to the network lifetime maximization problem. By applying the proposed method to design efficient broadcast routing, we maximize the lifetime of the entire network. The proposed tabu search algorithm was evaluated in terms of the energy consumption of all nodes in the broadcast transmission occurring in the network, the time of the first lost node, and the algorithm execution time. From the performance evaluation results under various conditions, it was confirmed that the proposed tabu search algorithm was superior to the previously proposed metaheuristic algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.43-54
• /
• 1996

This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m＋eloge＋NlogN) and O(eloge＋NlogN) time, respectively, and O(e＋N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

• Journal of Korean Library and Information Science Society
• /
• v.53 no.4
• /
• pp.123-142
• /
• 2022

In 2000, North Korea developed and published a two-volume, <Classification-Search Term Dictionary> and is currently used throughout North Korea. The purpose of this study is to examine the development process of the classification schemes of the North Korea after liberation and to understand the contents, composition, and principles of the <Classification-Search Term Dictionary> published in 2000 and revised in 2014. Until now, all the studies of the North Korean classification schemes were studies on the <Book Classification Scheme> published in North Korea in 1964, and there has been no discussion on North Korea's classification schemes since then. The first volume of the <Classification-Search Term Dictionary> consists of 'classification symbols - search terms', and the second volume consists of 'search terms - classification symbols'. Volume 1 is based on the <Books and Bibliography Classification Scheme (1996)>, and there are a total of 41 main classes in five categories. Volume 1 allocates 1 main class (11/19) to 'revolutionary ideas and theories', 8 main classes (20~27) to 'natural sciences', 19 main classes (30~69) to 'engineering technology and applied sciences', 12 main classes (70~85) to 'social sciences', and 1 main class (90) to 'total sciences'. Volume 2 is similar to subject-headings. North Korea's <Classification-Search Term Dictionary> is the first classification scheme introduced in South Korea and is expected to be the starting point for future studies on the establishment of the standard unification classification schemes.