• 한국경영과학회지
• /
• 제39권3호
• /
• pp.133-144
• /
• 2014

Naver, a leading search engine in South Korea, may show modified and reorganized search results for some trendy and popular keywords; when popular words such as the titles of soap operas and films are searched for,all the detailed and well-organized information regarding them can be presented. By recognizing that search engines may modify and reorganize search results for some popular keywords, we mathematically model the impact of the degree of modification of search results on the search engine's profit to derive its optimal modification degree. We show how the optimal degree of search result modification may change according to the different shapes of the search engine's advertising revenue function.

• 생명과학회지
• /
• 제14권6호
• /
• pp.991-996
• /
• 2004

본 논문은 인터넷 상에 산재해 있는 활용 가능한 다양한 모티프 및 도메인 관련 리소스들을 통합화 함으로써 체계적이고 효율적인 모티프 및 도메인 검색을 할 수 있는 통합 시스템 개발에 대해 다루고 있다. 이러한 시스템을 개발하기 위해 산재해 있는 모티프 및 도메인 관련 개별 데이터베이스의 핵심 부분만을 취합하여 로컬 데이터베이스화하고, 해당 데이터베이스에서 사용되는 개별 분석 도구들을 로컬 서버에 설치하였다. 그리고 다양한 유틸리티 및 CGI 프로그램 등을 통해서 이들 데이터베이스와 분석 도구들을 상호연동시켰고, 단일 웹 인터페이스를 통해 전체적으로 통합하였다. 본 연구에서 개발한 모티프 및 도메인 통합 검색 시스템을 활용한다면, 최종 사용자들은 인터넷 상을 서핑하는데 많은 시간을 낭비하지 않고, 원스톱(one-stop) 서비스를 통해 본인이 하고자 하는 정확한 모티프 및 도메인 검색을 할 수 있어 보다 효율적이고 정확한 단백질 기능분석을 행 할 수 있을 것이다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.652-658
• /
• 1998

We introduce the concept of a bi-population scheme for real-coded GAs consisting of an explorer sub-Ga and an exploiter sub-GA. The explorer sub-GA mainly performs global exploration of the search space, and incorporates a restart mechanism to help avoid being trapped at local optima. The exploiter sub-GA performs exploitation of fit local areas of the search space around the neighborhood of the best-so-far solution. Thus the search function of the algorithm is divided. the proposed technique exhibits performance significantly superior to standard GAs on two complex highly multimodal problems.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.570-573
• /
• 2007

본 논문에서는 한글의 글자 단위 검색 기능 구현에 있어서 한글의 빈도수 정보를 이용하여 보다 효율적으로 검색할 수 있는 방안을 제시한다. 또한 본 논문에서 제시하는 알고리즘을 적용하여 데이터베이스에서 한글 글자 단위 검색이 가능하도록 검색 기능을 구현하였다.

• 제어로봇시스템학회논문지
• /
• 제17권8호
• /
• pp.731-738
• /
• 2011

In this paper, we introduce an advanced architecture of K-Means clustering-based polynomial Radial Basis Function Neural Networks (p-RBFNNs) designed with the aid of SSOA (Space Search Optimization Algorithm) and develop a comprehensive design methodology supporting their construction. In order to design the optimized p-RBFNNs, a center value of each receptive field is determined by running the K-Means clustering algorithm and then the center value and the width of the corresponding receptive field are optimized through SSOA. The connections (weights) of the proposed p-RBFNNs are of functional character and are realized by considering three types of polynomials. In addition, a WLSE (Weighted Least Square Estimation) is used to estimate the coefficients of polynomials (serving as functional connections of the network) of each node from output node. Therefore, a local learning capability and an interpretability of the proposed model are improved. The proposed model is illustrated with the use of nonlinear function, NOx called Machine Learning dataset. A comparative analysis reveals that the proposed model exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

• 경영과학
• /
• 제22권1호
• /
• pp.167-178
• /
• 2005

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권2호
• /
• pp.215-221
• /
• 2003

Generally, we want to be searched the newest as well as some appropriate personalized information from the internet resources. However, it is a complex and repeated procedure to search some appropriate information. Moreover, because the user's interests are changed as time goes, the real time modeling of a user's interests should be necessary. In this paper, I propose PREA system that can search and filter documents that users are interested from the World Wide Web. And then it constructs the user's interest model by a modified spreading neural network. Based on this network, PREA can easily produce some queries to search web documents, and it ranks them. The conventional spreading neural network does not have a visualization function, so that the users could not know how to be configured his or her interest model by the network. To solve this problem, PREA gives a visualization function being shown how to be made his interest user model to many users.

• 산업기술연구
• /
• 제20권B호
• /
• pp.219-226
• /
• 2000

In this paper, we propose a new novel method for similarity search that supports time warping. Our primary goal is to innovate on search performance in large databases without false dismissal. To attain this goal, we devise a new distance function $D_{tw-lb}$ that consistently underestimates the time warping distance and also satisfies the triangular inequality. $D_{tw-lb}$ uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping. For efficient processing, we employ a multidimensional index that uses the 4-tuple feature vector as indexing attributes and $D_{tw-lb}$ as a distance function. We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments. The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.146-149
• /
• 2000

In this paper, Computer Colour Matching and Kitchen System (CCMKS) is developed on the basis of delphi package and one-chip processor with fuzzy-PID control. CCMKS will be widely used in the colour dyeing industry as an integrated colour matching and dispensing system which have more advantages than the conventional matching or dispensing system, when controlling the real dyeing processes. Delphi is utilized in making database and search/matching routes. The developed matching function reduces the search and matching time to about one third. One-chip processor is designed and manufactured for the distributed control of three-phase induction motors. Fuzzy-PID control is applied to the speed control of three-phase induction motors for a very precise weight of colour at CCMKS. The developed kitchen function decreases the dispensing time to about one twentieth. The experimental results show CCMKS has more excellent search time, more precise weight and much high fidelity than conventional colour matching or dispensing system, in the performance.

• 전기학회논문지
• /
• 제60권7호
• /
• pp.1314-1323
• /
• 2011

The maintenance of generating units is implicitly related with power system reliability and has a tremendous bearing on the operation of the power system. A technique using a fuzzy search method which is based on fuzzy multi-criteria function has been proposed for GMS (generator maintenance scheduling) in order to consider multi-objective function. In this study, a new technique using combined fuzzy set theory and genetic algorithm(GA) is proposed for generator maintenance scheduling. The genetic algorithm(GA) is expected to make up for that fuzzy search method might search the local solution. The effectiveness of the proposed approach is demonstrated by the simulation results on a practical size test systems.