• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.333-351
• /
• 2002

This paper introduces a search method based on conceptual graph. A hyperlink information is essential to construct conceptual graph in web. The information is very useful as it provides summary and further linkage to construct conceptual graph that has been provided by human. It also has a property which shows review, relation, hierarchy, generality, and visibility. Using this property, we extracted the keywords of web documents and made up of the conceptual graph among the keywords sampled from web pages. This paper extracts the keywords of web pages using anchor text one out of hyperlink information and makes hyperlink of web pages abstract as the link relation between keywords of each web page. 1 suggest this useful search method providing querying word extension or domain knowledge by conceptual graph of keywords. Domain knowledge was conceptualized knowledged as the conceptual graph. Then it is not listing web documents which is the defect of previous search system. And it gives the index of concept associating with querying word.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권11호
• /
• pp.528-536
• /
• 2001

This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

• 전자공학회논문지A
• /
• 제33A권5호
• /
• pp.24-30
• /
• 1996

In this paper, we propose a fast code acquisition method that can reduce drastically the mean acquisition time of the direct sequence spread spectrum (DS-SS) system by using and integrated search and verification (ISV) scheme. The proposed method performs simultaneously the search and verification processes at every search cell, through storing sufficiently long signal samples enough to perform the verification process form the previously received samples. We analyze and acquisition performance in the case of Gaussian channel to evaluate theacquisition perfomrance of the proposed method. From the simple numericl analysis result, we have shown that the acquisition performance of the proposed method is better than that of the conventional serial search method, and the performance improvement becomes more prominent as the channel environment becomes degraded.

• 한국경영과학회지
• /
• 제30권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.

• KIEE International Transactions on Power Engineering
• /
• 제5A권2호
• /
• pp.177-185
• /
• 2005

This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

• 정보관리학회지
• /
• 제13권1호
• /
• pp.103-117
• /
• 1996

본 연구는 온라인 목록의 접근점과 서지사항이 이용자의 재탐색 과정에 있어서 어떠한 영향을 미치는가를 조사하였다. 두 온라인 목록(노티스 시스템과 다이닉스 시스템)을 선정하고, 대학교 학부학생들을 대상으로 하여 재탐색 빈도와 형태를 파악하였다. 재탐색의 형태는 탐색어 변경, 접근점 변경, 그리고 탐색어와 접근점 변경으로 한정하였다. 연구 결과는 접근점과 서지사항이 이용자의 재탐색 빈도와 형태에 영향을 미치는 것으로 나타났다.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.73-79
• /
• 2003

In managing organizational tacit knowledge, recent researches 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. 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 information 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 improve FAH, a text categorization approach called Vector Space Model is utilized. To test applicability and practicality of the proposed framework, the prototype system, "Knowledge Portal for Researchers in Science and Technology" sponsored by the Ministry of Science and Technology (MOST) of Korea, was developed.

• International Journal of Internet, Broadcasting and Communication
• /
• 제15권2호
• /
• pp.22-30
• /
• 2023

The portable mobile devices with high performance and high speed 5G network activate and explode the demands for ubiquitous information services that remove the limitations of time for the communication and places to request for the information. NN (Nearest Neighbor) search is one of the most important types of queries to be processed efficiently in the information services. Various indexes have been proposed to support efficient NN search in the wireless broadcast system. The indexes adopting Hilbert curve, grid partition or Voronoi diagram enable the clients to search for NN quickly in the wireless broadcast channel. It is necessary that an efficient means to evaluate the performances of various indexes. In this paper, we propose an open framework that can adopt a variety of indexing schemes and evaluate and compare the performances of them. The proposed framework is organized with open and flexible structure that can adopt hybrid indexing schemes extensible to Voronoi diagram as well as simple indexing schemes. With the implemented framework, we demonstrate the efficiency and scalability and flexibility of the proposed framework by evaluating various indexing schemes for NN query.

• 대한산업공학회지
• /
• 제39권2호
• /
• pp.119-128
• /
• 2013

Most internet users utilize internet portal search engines, such as Naver, Daum and Google nowadays. But since the results of internet portal search engines are based on universal criteria (e.g. search frequency by region or country), they do not consider personal interests. Namely, current search engines do not provide exact search results for homonym or polysemy because they try to serve universal users. In order to solve this problem, this research determines keyword importance and weight value for each individual search characteristics by collecting and analyzing customized keyword at external database. The customized keyword weight values are integrated with search engine results (e.g. PageRank), and the search ranks are rearranged. Using 50 web pages of Goolge search results for experiment and 6 web pages for customized keyword collection, the new customized search results are proved to be 90% match. Our personalization approach is not the way that users enter preference directly, but the way that system automatically collects and analyzes personal information and then reflects them for customized search results.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.407-411
• /
• 2005

KUGI (Korean UniGene Information) database contains the annotation information of the cDNA sequences obtained from the disease samples prevalent in Korean. A total of about 157,000 5'-EST high throughput sequences collected from cDNA libraries of stomach, liver, and some cancer tissues or established cell lines from Korean patients were clustered to about 35,000 contigs. From each cluster a representative clone having the longest high quality sequence or the start codon was selected. We stored the sequences of the representative clones and the clustered contigs in the KUGI database together with their information analyzed by running Blast against RefSeq, human mRNA, and UniGene databases from NCBI. We provide a web-based search engine fur the KUGI database using two types of user interfaces: attribute-based search and similarity search of the sequences. For attribute-based search, we use DBMS technology while we use BLAST that supports various similarity search options. The search system allows not only multiple queries, but also various query types. The results are as follows: 1) information of clones and libraries, 2) accession keys, location on genome, gene ontology, and pathways to public databases, 3) links to external programs, and 4) sequence information of contig and 5'-end of clones. We believe that the KUGI database and search system may provide very useful information that can be used in the study for elucidating the causes of the disease that are prevalent in Korean.