• Journal of the Korean Society for information Management
• /
• v.17 no.1
• /
• pp.7-20
• /
• 2000

The study attempts to propose a distributed bibliographic information retrieval system using distributed retrieval servers and distributed databases. CORBA and JAVA applications have been employed to solve both the bottleneck and the problems that simultaneous searches in distributed databases cannot deal with under the CGI or JAVA applications. The proposed distributed bibliographic retrieval system using two distributed servers with their distributed databases was successfully experimented. However, it is recommended that both heterogeneous information retrieval systems and databases are included in further studies.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.299-303
• /
• 2000

The goal of the information retrieval system is to search the docments which the user wants to obtain in fast and effiecient way. Many information retrieval models, including boolean models, vector models and fuzzy models based on the trasitional fuzzy set theory, have been proposed to achieve these kinds of objectives. However, the previous models have a limitation on the fact that they do not consider the users' preference in the search of documents. In this paper, we proposed a new extenced fuzzy information retrieval System which can handle the shortcomings of the previous ones. In the proposed model, a new similarity measure was applied in order to calculate the degree among documents, which can expliot the users' preference.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.1
• /
• pp.17-26
• /
• 2004

In this study, the usability evaluation of a menu-structure was performed using spreading activation model with respect to human's memory retrieval. Spreading Activation Model is effectively used to understand the process of information retrieval, so it can be used as a theoretical background for modeling of the process of human's information retrieval. For spreading activation test (SAT), subjects were presented with 67 pairs of menu titles, which consist of a menu title in the high level menu item and a menu title for the next lower level menu item, from Korea University's web site. For performance tests, three scenarios were developed with longer reaction times and ambiguous associations found in the SAT to reflect the existing problems of the website. As a result, the SAT was found to bean effective tool to enhance the website usability because the SAT could bea substitute for the performance test with a high correlation $({\rho}=0.735,\;{\alpha}=0.05)$. After remaining menu titles with slow reaction times and ambiguous associations found in SAT, the website usability was significantly improved with faster reaction times and less ambiguous associations proven with smaller number of web-page visits. Therefore, the SAT could be used as a methodology to design and evaluate the user-centered menu structure related to human's association structure.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.15-19
• /
• 2012

A Domain Dictionary generation algorithm based on pseudo feedback model is presented in this paper. This algorithm can increase the precision of domain dictionary generation algorithm. The generation of Domain Dictionary is regarded as a domain term retrieval process: Assume that top N strings in the original retrieval result set are relevant to C, append these strings into the dictionary, retrieval again. Iterate the process until a predefined number of domain terms have been generated. Experiments upon corpus show that the precision of pseudo feedback model based algorithm is much higher than existing algorithms.

• Journal of the Korean Society for Library and Information Science
• /
• v.33 no.4
• /
• pp.133-156
• /
• 1999

The purpose of this paper is to show how conceptual data modeling can enhance current information retrieval (IR) systems. The conceptual database design provides for: 1) data mining capability to discover new knowledge based on the relationships between entities, and 2) integrating current separate databases into one IR system (e.g., integrating ISI Citation, a thesaurus, and bibliographic databases into one retrieval system) . Further, as new user requirements are unfolded, modifications of IR systems based on conceptual data modeling will be much easier to make than they were in the current IR systems because conceptual modeling facilitates flexible modifications. The enhanced Entity-Relationship (ER) model was employed in this study to develop conceptual schemas of IR data.

• The Journal of Information Systems
• /
• v.8 no.1
• /
• pp.27-44
• /
• 1999

Case-Based Reasoning(CBR) offers a new approach for developing knowledge based systems. CBR has several research issues which can be divided into two categories : (1) static issues and (2) dynamic issues. The static issues are related to case representation scheme and case data model, that is, focus on casebase which is a repository of cases. The dynamic issues, on the other hand, are related to case retrieval procedure and problem solving process, i.e. case adaptation phase. This research is forcused on retrieval procedure Traditional query processing accepts precisely specified queries and only provides exact answers, thus requiring users to fully understand the problem domain and the casebase schema, but returning limited or even null information if the exact answer is not available. To remedy such a restriction, extending the classical notion of query answering to approximate query answering(AQA) has been explored. AQA can be achieved by neighborhood query answering or associative query answering. In this paper, neighborhood query answering technique is used for AQA. To reinforce the CBR process, a new retrieval procedure(cooperative CBR) using neighborhood query answering is proposed. An neighborhood query answering relaxes a query scope to enlarge the search range, or relaxes an answer scope to include additional information. Computer Aided Process Planning(CAPP) is selected as cooperative CBR application domain for test. CAPP is an essential key for achieving CIM. It is the bridge between CAD and CAM and translates the design information into manufacturing instructions. As a result of the test, it is approved that the problem solving ability of cooperative CBR is improved by relaxation technique.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.5 no.1
• /
• pp.85-105
• /
• 1981

Information is an essential factor leading the rapid progress which is one of the distinguished characteristics in modem society. As more information is required and as more is supplied by individuals, governmental units, businesses, and educational institutions, the greater will be the requirement for efficient methods of communication. One possibility for improving the information dissemination process is to use computers. The capabilities of such machine are beginning to be used in the process of Information storage, retrieval and dissemination. An important problems, that must be carefully examined is whether one technique for information retrieval is better for worse than another. This paper examines problem of how to evaluate an information retrieval system. One specific approach is a cost accounting model for use in studying how to minimize the cost of operating a mechanized retrieval system. Through the use of cost analysis, the model provides a method for comparative evaluation between systems. The general cost accounting model of the literature retrieval system being designed by this study are given below. 1. The total cost accounting model of the literature retrieval system. The total cost of the literature retrieval system = (the cost per unit of user time X the amount of user time) + ( the cost per unit of system time X the amount of system time) 2. System cost accounting model system cost = (the pre-search system cost per unit of time X time) + (the search system cost per unit of time X time) + (the post search system cost per unit of time X time) 1) Pre-search system cost per unit of time = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 2) Search system cost per unit of time = comparison cost + document representation cost. 3) Post-search system cost per unit of time. = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 3. User cost accounting model Total user cost = [pre-search user cost per unit of time X (time + additional time) ] + [search user cost per unit of time X (time + additional time) ] + [post-search user cost per unit of time X (time + additional time) ].

• Journal of the Korean Society for Library and Information Science
• /
• v.53 no.4
• /
• pp.231-254
• /
• 2019

Library website is medium for connecting library information resources and users. However, searching and accessing methods to information resources in library websites and retrieval systems are mostly designed for users. So, the disabled users have difficulty accessing and using library information resources through library websites. Therefore, the author carried on current status study and analysis on the retrieval system of the national and public library websites in Korea. And then, the author proposes improvement plan in order to enhance satisfaction with information needs of disabled users and to use a basic study for construction of retrieval system of library websites for disabled users.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.192-195
• /
• 2008

People have tendency of forgetting music title, though they easily remember particular part of music. If a music search system can find the title through a part of melody, this will provide very convenient interface to users. In this paper, we propose an algorithm that enables this type of search using feature transformation function. The original music is transformed to new feature information with sequential melodies. When a melody that is a part of search music is given to the system, the music retrieval system searches the music similar to the feature information of the melody. Moreover, this transformation function can be easily extended to various music recognition systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2612-2633
• /
• 2020

Due to the explosive growth of multimedia speech data, how to protect the privacy of speech data and how to efficiently retrieve speech data have become a hot spot for researchers in recent years. In this paper, we proposed an encrypted speech retrieval scheme based on long short-term memory (LSTM) neural network and deep hashing. This scheme not only achieves efficient retrieval of massive speech in cloud environment, but also effectively avoids the risk of sensitive information leakage. Firstly, a novel speech encryption algorithm based on 4D quadratic autonomous hyperchaotic system is proposed to realize the privacy and security of speech data in the cloud. Secondly, the integrated LSTM network model and deep hashing algorithm are used to extract high-level features of speech data. It is used to solve the high dimensional and temporality problems of speech data, and increase the retrieval efficiency and retrieval accuracy of the proposed scheme. Finally, the normalized Hamming distance algorithm is used to achieve matching. Compared with the existing algorithms, the proposed scheme has good discrimination and robustness and it has high recall, precision and retrieval efficiency under various content preserving operations. Meanwhile, the proposed speech encryption algorithm has high key space and can effectively resist exhaustive attacks.