• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.6
• /
• pp.195-204
• /
• 2020

Nowadays there are over 1.6 billion web pages and it is hard to get necessary results that user wants. Most search engines allow you to search with logical form to get accurate results. However, normal users are not familiar to search information as logical form. Therefore, they search in natural language rather than in complicated logical form. In this paper there are some suggestions to improve quality of searching results, converting natural language input by the user into logical form which can able to use advanced search engine. Users tend to make short searches due to the 'Simplicity' which is one of the features of the search form. Therefore we suggest history retrieval method; advanced version of previous suggestion to provide convenience to the normal users. We had improvement on accuracy of the search results converting natural languages to logical form and also can contain every keyword without missing any keywords using searching methods on this paper. It is expected that these search methods will contribute to the development of search engines.

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.23-31
• /
• 2003

Link-based search engines generate the rank using linked information of related web-documents . HITS(Hypertext Internet Topic Search), representative ranking evaluation algorithm using a special feature of web-documents based on such link, evaluates the importance degree of related pages from linked information and presents by ranking information. Problem of such HITS algorithm only is considered the link frequency within documents and depends on the set of web documents as input value. In this paper, we design the search agent based on better HITS algorithm according to advanced suitability between query and search-result in the set of given documents from link-based web search engine. It then complements locality of advanced search performance and result.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.175-177
• /
• 2005

인터넷이 널리 활용되면서 웹 사이트의 수가 기하급수적으로 증가하는 동시에, 각각의 웹 사이트에 저장된 정보의 양도 급속히 증가하고 있다. 사용자가 이러한 웹 환경에서 원하는 정보를 효과적으로 찾을 수 있도록 하기 위해서는 크게 두 가지 요소가 중요한데, 첫 번째는 웹 검색 사이트에서 다양한 제한 검색 기능들을 제공하는 것이고 두 번째는 일반적인 웹 사이트에서 홈서치 서비스를 제공하는 것이다. 제한 검색은 각 웹 사이트의 정보를 중앙 데이타베이스에 저장하고, 검색 범위를 특정 범위로 한정시켜 검색 결과를 제공하는 방법으로, 이를 활용하면 일반적인 웹 사이트들도 저렴한 비용으로 방문자들에게 홈서치 서비스를 제공할 수 있다. 본 논문에서는 이러한 제한 검색 기능들과 홈서치 기능을 오디세우스 정보검색용 객체관계형 DBMS를 사용하여 실제로 어떻게 구현할 수 있는지에 대해 SQL 및 HTML 레벨에서 설명한다. 따라서, 본 논문에서 제안하는 구현 방법은 Oracle, MySQL등의 정보검색 기능이 제공되는 관계형 DBMS들에 대해 모두 적용될 수 있다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.5 s.176
• /
• pp.1193-1202
• /
• 2000

The paper describes the use of genetic algorithms (GA's) to the minimum weight design of stiffened composite panels for buckling constraints. The proposed design problem is characterized by mixture of continuous and discrete design variables corresponding to panel elements and stacking sequence of laminates, respectively. Design space is multimodal and non-convex, thereby introducing the need for global search strategies. Advanced strategies in GA's such as directed crossover, multistage search and separated crossover are adopted to improve search ability and to save computational resource requirements. The paper explores the effectiveness of genetic algorithms and their advanced strategies in designing stiffened composite panels under various uniaxial compressive load conditions and the linrlit on stacking sequence of laminates.

• Proceedings of KOSOMES biannual meeting
• /
• 2018.06a
• /
• pp.41-41
• /
• 2018

• Journal of Intelligence and Information Systems
• /
• v.9 no.2
• /
• pp.87-100
• /
• 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.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• 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.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.4
• /
• pp.395-412
• /
• 2010

This study aims to perform an evaluation of multimedia search services provided by major Korean search portals: Naver, Nate, Daum, Yahoo-Korea, Paran, and Google-Korea. These multimedia search services are evaluated in terms of the metadata of search results, search functionalities, searching methods, other functionalities, and display options. Every search portal offers image and video searching, whereas only Naver, Nate, and Daum offer music searching. Advanced searching methods and functions are mostly developed and supported in image and video searching rath than music searching. Naver, Nate, and Daum support various searching functions which search portals abroad have not developed. Google-Korea supports advanced searching functions. Search portals provide a limited number of metadata in search results. This study could contribute to the development and improvement of portal's multimedia search services.

• Journal of Positioning, Navigation, and Timing
• /
• v.4 no.4
• /
• pp.161-171
• /
• 2015

Alternative binary offset carrier (AltBOC) signals can be approximated by four synchronized direct sequence spread spectrum (DSSS) signals, each pair of which is a quadrature phase shift keyed (QPSK) signal at a different frequency. Therefore, depending on the strength of an incoming AltBOC signal, an acquisition technique can reduce the mean acquisition time (MAT) by searching the four DSSS signals asynchronously; the search for each of the four DSSS signals can start at one of the evenly separated hypotheses on the two-dimensional hypothesis space. And detection sensitivity can be improved by multiple levels when different numbers of search results for the same hypothesis are combined. In this paper, we propose a fast AltBOC acquisition technique that has an asynchronous search strategy and efficiently utilizes the output of the four search results to increase the sensitivity level when sensitivity improvement is needed. We provide a complete theoretical analysis and demonstrate with numerous Monte Carlo simulations that the MAT of the proposed technique is much smaller than conventional AltBOC acquisition techniques.

• Nuclear Engineering and Technology
• /
• v.55 no.1
• /
• pp.310-323
• /
• 2023

The k-eigenvalue neutronics/thermal-hydraulics coupling calculation is a key issue for reactor design and analysis. Jacobian-free Newton-Krylov (JFNK) method, featured with super-linear convergence rate and high efficiency, has been attracting more and more attention to solve the multi-physics coupling problem. However, it may converge to the high-order eigenmode because of the multiple solutions nature of the k-eigenvalue form of multi-physics coupling issue. Based on our previous work, a modified JFNK with a line search method is proposed in this work, which can find the fundamental eigenmode together with thermal-hydraulics feedback in a wide range of initial values. In detail, the existing modified JFNK method is combined with the line search strategy, so that the intermediate iterative solution can avoid a sudden divergence and be adjusted into a convergence basin smoothly. Two simplified 2-D homogeneous reactor models, a PWR model, and an HTR model, are utilized to evaluate the performance of the newly proposed JFNK method. The results show that the performance of this proposed JFNK is more robust than the existing JFNK-based methods.