• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.129-147
• /
• 2005

In Knowledge Management Systems (KMS), tacit knowledge which is usually possessed as forms like know-how, experiences, and etc. is hard to be systemized while managing explicit knowledge is comparatively easy using information technology such as databases, Recent researches in knowledge management have shown that it is more applicable in many ways to provide expert search mechanisms in KMS to pinpoint experts in the organizations with searched expertise so that users can contact them for help, In this paper, we propose an intelligent expert search framework to provide search capabilities for experts in similar or related fields according to the user's needs. In enabling intelligent expert searches, Fuzzy Abstraction Hierarchy (FAH) framework has been adopted, through' which finding experts with similar or related expertise is possible according to the subject field hierarchy defined in the system. To test applicability and practicality of the proposed framework, the prototype system, Knowledge Portal for Researchers in Science and Technology, was developed.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.3
• /
• pp.363-371
• /
• 1994

This thesis investigates an expert system(ES) to propose fault restoration plan by utilizing tree search strategies. In order to cope with an extensive amount of data and frequent breaker switching operations in distribution systems, the database of system configuration is constructed by using binary trees. This remarkably enhances the efficiency of search algorithm and makes the proposed ES easily adaptable to system changes due to switching operations. The rule-base is established to fully utilize the meris of tree-structured database. The inferring strategy is developed mainly based on the best-first search algorithm to increase computation efficiency. The proposed ES has been implemented to efficiently deal with large distribution systems by reducing computational burden remarkably compared with the conventional ES's.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.288-291
• /
• 2004

This paper proposes an intelligent search modeling using avatar agent. This system consists of some modules such as agent interface, agent management, preprocessor, interface machine. Core-Symbol Database and Spell Checker are related to the preprocessor module and Interface Machine is connected with Best Aggregate Designer. Our avatar agent system does the indexing work that converts user's natural language type sentence to the proper words that is suitable for the specific branch information retrieval. Indexing is one of the preprocessing steps that make it possible to guarantee the specialty of user's input and increases the reliability of the result. It references a database that consists of synonym and specific branch dictionary. The resulting symbol after indexing is used for draft search by the internet search engine. The retrieval page position and link information are stored in the database. We experimented our system with the stock market keyword SAMSUNG_SDI, IBM, and SONY and compared the result with that of Altavista and Google search engine. It showed quite excellent results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.158-168
• /
• 2001

We present a tabu search (TS) algorithm to minimize maximum lateness on a single machine in the presence of sequence dependent setup times and dynamic job arrivals. The TS algorithm starts with a feasible schedule generated by a modified ATCS (Apparent Tardiness Cost with Setups) rule, then through a series of search steps it improves the initial schedule. Results of extensive computational experiments show that the TS algorithm significantly outperforms a well-known RHP heuristic by Ovacik and Uzsoy, both on the solutions quality and the computation time. The performance advantage is particularly pronounced when there is high competition among jobs for machine capacity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.9
• /
• pp.2436-2457
• /
• 2023

The elderly population is rapidly increasing worldwide, but many face challenges in using digital tools like the Internet due to health and incapacity issues. Existing online search user interfaces (UIs) often overlook the specific usability needs of the elderly. This study proposes an adaptable web search UI model for the elderly, based on their perspectives, to enhance search performance and usability. The proposed UI model is evaluated through comparative usability testing with 20 participants, comparing it to the Google search UI. Effectiveness, efficiency, and satisfaction are measured using task completion time, error rate, and subjective preferences. The results show significant differences (p > 0.05) between the proposed web search UI model and the Google search UI. The proposed UI model achieves higher subjective satisfaction levels, indicating better alignment with the needs and preferences of elderly users. It also reduces task completion time, indicating improved efficiency, and decreases the error rate, suggesting enhanced effectiveness. These findings emphasize the importance of considering the unique usability needs of the elderly when designing search UIs. The proposed adaptable web search UI model offers a promising approach to enhance the digital experiences of elderly users. This study lays the groundwork for further development and refinement of adaptable web search UI models that cater to the specific needs of elderly users, enabling designers to create more inclusive and user-friendly search interfaces for the growing elderly population.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.331-340
• /
• 2006

In this Paper, we propose to extend the TSS-LS(Two-Step Search scheme with Linear search based Second step) scheme which was already proposed by the authors for coherent UWB(Ultra Wide Band) systems, to rapid and reliable acquisition of noncoherent UWB systems in multipath channels. The proposed noncoherent TSS-LS employing simple energy window banks utilizes two different thresholds and search windows to achieve fast acquisition. Furthermore, the linear search is adopted for the second step in the proposed scheme to correctly find the starting point in the range of effective delay spread of the multipath channels, and to obtain reliable BER(Bit Error Rate) performance of the noncoherent UWB systems. Simulation results with multipath channel models by IEEE 802.15.3a show that the proposed two-step search scheme can achieve significant reduction of the required mean acquisition time as compared to general search schemes. ]n addition, the proposed scheme achieves quite good BER performance for large signal-to-noise ratios, which is favorably comparable to the case of ideal perfect timing.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1459-1461
• /
• 1999

Distribution systems is consist of network in physical aspect, and radial in electrical aspect. Therefore, radial operation is realized by changing the status of sectionalizing switches, and is usually done for loss reduction in the system. In this paper, we propose a optimal method for distribution systems reconfiguration. Specifically, we use K-optimal algorithm and tabu search method to solve distribution systems reconfiguration for loss minimization problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.35-45
• /
• 1998

Scheduling problem in Flexible Manufacturing Systems(FMS) is complex because of various situation of Manufacturing Systems. Especially, in case of short-term scheduling demanding high efficiency, low cost at short-period, efficient scheduling is a serious problem. To solve this problem, many dispatching rules are developed. But, it leave much to be desired, because real situation in shop floor is complex and real-time scheduling is needed in real manufacturing shop floor. In this paper, search algorithm that allocate different dispatching rules to each machine is presented to complement lack of dispatching rule and develop practical real-time scheduling system. The search algorithm is described in detail. First, algorithm detect machine breakdown, evaluate each dispatching rule. dispatching rules for each machine meeting performance criteria are ranked. The algorithm selects new dispatching nile for bottleneck machine. The effectivenes and efficiency of the mixed dispatching rule and search algorithm is demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1489-1515
• /
• 2022

The number of interconnected real-world devices such as sensors, actuators, and physical devices has increased with the advancement of technology. Due to this advancement, users face difficulties searching for the location of these devices, and the central issue is the findability of Things. In the WoT environment, keyword-based and geospatial searching approaches are used to locate these devices anywhere and on the web interface. A few static methods of indexing and ranking are discussed in the literature, but they are not suitable for finding devices dynamically. The authors have proposed a mechanism for dynamic and efficient searching of the devices in this paper. Indexing and ranking approaches can improve dynamic searching in different ways. The present paper has focused on indexing for improving dynamic searching and has indexed the Things Description in Solr. This paper presents the Things Description according to the model of W3C JSON-LD along with the open-access APIs. Search efficiency can be analyzed with query response timings, and the accuracy of response timings is critical for search results. Therefore, in this paper, the authors have evaluated their approach by analyzing the search query response timings and the accuracy of their search results. This study utilized different indexing approaches such as key-words-based, spatial, and hybrid. Results indicate that response time and accuracy are better with the hybrid approach than with keyword-based and spatial indexing approaches.