• 대한전기학회논문지:전력기술부문A
• /
• 제52권9호
• /
• pp.513-520
• /
• 2003

Service restoration is an emergency control in distribution constrol centers to restore out-of-service area as soon as possible when a fault occurs in distribution networks. therefore, it requires fast computation time and high quality solutions for load balancing. In this paper. a load balance index and heuristic guided best-first search are proposed for these problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to identify the most effective the set of switches using proposed search technique and a load balance index. Test results on the KEPCO's 108 bus distribution system show that the performance is efficient and robust.

• 대한본초학회지
• /
• 제31권4호
• /
• pp.93-100
• /
• 2016

Objectives : The internet is the most common method to investigate information. It is showed that 75.2% of Internet users of 20s had health information search experience. So this study is aim to understanding of interest of public about the herbal medicine using internet search query volume data.Methods : The Naver that is the top internet portal web service of the Republic of Korea has provided an Internet search query volume data from January 2007 to the current through the Naver data lab (http://datalab.naver.com) service. We have collected search query volume data which was provided by the Naver in 606 herbal medicine names and sorted the data by peak and total search volume.Results : The most frequently searched herbal medicines which has less bias and sorted by peak search volume is 'wasong (와송)'. And the most frequently searched herbal medicines which has less bias and sorted by total search volume is 'hasuo (하수오)'.Conclustions : This study is showed that the rank of interest of public about herbal medicines. Among the above herbal medicines, some herbal medicines had supply issue. And there are some other herbal medicines that had very little demand in Korean medicine market, but highly interested public. So it is necessary to monitor for these herbal medicines which is highly interested of the public. Furthermore if the reliability of the data obtained on the basis of these studies, it is possible to be utilizing herbal medicine monitoring service.

• 한국정보통신학회논문지
• /
• 제9권3호
• /
• pp.661-668
• /
• 2005

본 논문에서는 웹 서비스 기술을 이용하여 동적으로 가격비교를 위한 SOAP기반 유/무선 웹 서비스 시스템을 설계 및 구현하였다. 본 웹 서비스 시스템은 크게 상품검색, 상품정렬, 상품주문과 UDDI 검색 브라우저를 지원하는 웹 서비스 클라이언트 모듈과 상품 검색/주문 원격 프로시저와 UDDI 게시 브라우저를 포함하는 서버모듈과 무선 환경에서 상품 검색/주문을 지원하는 모바일 클라이언트 모듈로 나누어지며, SOAP 표준 환경기반으로 상호 정보를 교환하도록 구현하였다. 따라서 사실표준 환경인 SOAP, WSDL, UDDI 표준을 따르는 모든 환경에서 이식가능하며, 플랫폼에 독립적으로 지원할 수 있다.

• Journal of Electrical Engineering and Technology
• /
• 제1권4호
• /
• pp.435-447
• /
• 2006

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

• 한국IT서비스학회지
• /
• 제10권4호
• /
• pp.243-258
• /
• 2011

With increasing interest in ubiquitous computing technology, an infrastructure for the short-distance wireless communication has been extended socially, bringing spotlight to the security system using the image or location. In case of existing security system, there have been issues such as the occurrences of blind spots, difficulty in recognizing multiple objects and storing of the unspecified objects. In order to solve this issue, zone-based location-estimation search system for the image have been suggested as an alternative based on the real-time location determination technology combined with image. This paper intends to suggest the search service for the image zone-based location-estimation. For this, it proposed the location determination algorism using IEEE 802.15.4/ZigBee's RSSI and for real-time image service, the RTP/RTCP protocol was applied. In order to combine the location and image, at the event of the entry of the specified target, the record of the time for image and the time of occurrence of the event on a global time standard, it has devised a time stamp, applying XML based meta data formation method based on the media's feature data based in connection with the location based data for the events of the object. Using the proposed meta data, the service mode which can search for the image from the point in time when the entry of the specified target was proposed.

• 한국멀티미디어학회논문지
• /
• 제19권11호
• /
• pp.1878-1890
• /
• 2016

Web 2.0 has features produced the content through the user of the participation and share. The content production activities have became active since social network service appear. The social bookmark, one of social network service, is service that lets users to store useful content and share bookmarked contents between personal users. Unlike Internet search engines such as Google and Naver, the content stored on social bookmark is searched based on tag keyword information and unnecessary information can be excluded. Social bookmark can make users access to selected content. However, quick access to content that users want is difficult job because of the user of the participation and share. Our paper suggests a method recommending search word to be able to access quickly to content. A method is suggested by using Collaborative Filtering and Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare by 'Delicious' and "Feeltering' with our system.

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

This paper presents a approach for a service restoration and optimal reconfiguration of distribution network using Genetic algorithm(GA) and Tabu search(TS) method. Restoration and reconfiguration problems in distribution network are difficult to solve in short times, because distribution network supplies power for customers combined with many tie-line switches and sectionalizing switches. Furthermore, the solutions of these problems have to satisfy radial operation conditions and reliability indices. To overcome these time consuming and sub-optimal problem characteristics, this paper applied Genetic-Tabu algorithm. The Genetic-Tabu algorithm is a Tabu search combined with Genetic algorithm to complement the weak points of each algorithm. The case studies with 7 bus distribution network showed that not the loss reduction but also the reliability cost should be considered to achieve the economic service restoration and reconfiguration in the distribution network. The results of suggested Genetic-Tabu algorithm and simple Genetic algorithm are compared in the case study also.

• 디지털콘텐츠학회 논문지
• /
• 제11권1호
• /
• pp.105-115
• /
• 2010

검색엔진들은 사용자로부터 질의어를 전송받아 질의어와 관련이 가장 높은 웹 문서들을 보여주게 된다. 하지만 검색엔진이 사용자의 질의어만 가지고 사용자의 의도를 파악하여 정확한 웹 문서를 제공하기는 어렵다. 따라서 검식 엔진 시스템은 다양한 개인화 방법을 사용하여 각 사용자가 원하는 검색 결과를 보여주기 위해 노력한다. 본 논문에서는 개인화 검색을 위해 '폭소노미'를 기반으로 사용자에게 적합한 질의어를 추천해 주는 방법을 제안한다. 또한 이러한 개인화된 검색 결과를 제공하는 시스템이 가질 수 있는 프라이버시 침해 위험성을 제거하면서도 검색 서비스 제공자 입장에서는 사용자 정보를 활용한 다양한 서비스(개인화 광고등) 제공이 가능하도록 하는 개인화 검색 서비스 구조를 제안한다.

• 디지털산업정보학회논문지
• /
• 제11권2호
• /
• pp.55-66
• /
• 2015

In this paper, we design and implement a two-way search algorithm that can provide a customized service through the user with real-time two-way communication using a mobile instant messaging service. Therefore, we design and implement the automative search system which enables delivering message to each user mobile terminal from a plurality of relay mobile terminals by utilizing the mobile instant messenger, not to deliver a message from the main server to the mobile instant messenger user directly. Two-way search system using the mobile instant messenger can be immediately collect the user's response is easy to identify the orientation of each user, and thus can be provided to establish a differentiated service plan. Also, It provides a number of services(text, photos, videos, etc) in real-time information to the user by utilizing the mobile instant messenger service without the need to install a separate application. Experiment results, data processing speed of the category processing way to search for the data of the DB server from a user mobile terminal is about 7.06sec, data processing number per minute is about 13 times. The data processing speed of the instruction processing way is about 3.10sec, data processing number per minute is about 10 times. The data processing speed of the natural language processing way is about 5.13sec, per data processing number per minute is about 7 times. Therefore in category processing way, command processing way and natural language processing way, instruction processing way is the most excellent in aspect of data processing speed, otherwise in aspect of per data processing number per minute, the category processing way is the best method.

• 한국컴퓨터정보학회논문지
• /
• 제11권4호
• /
• pp.271-281
• /
• 2006

인터넷의 발달로 웹상에 수많은 문서와 웹서비스가 급격히 증가하고 있다. 인터넷 사용자들은 웹에서 원하는 정보와 서비스를 획득하기 위해서는 각종 브라우저에서 여러 단계의 프로그램 조작 절차를 반복하고 사이트마다 고유의 서비스 구조들을 이해한 상태에서 여러 번의 방문 절차들을 거쳐야 한다. 이러한 절차들은 사용자에게 꼭 필요한 선행 작업이며, 사용자가 실제로 서비스 획득에 걸리는 시간보다도 선행 작업에 소요되는 시간이 더 큰 게 현실이다. 이러한 시간소요를 극복하기 위해 단순 반복적인 작업을 보다 체계화하고 단순화하기 위한 방안으로 닷큐어리 기반의 대화형 검색 에이전트를 제안한다. 제안하는 에이전트는 사용자의 컴퓨터에서 자연어 명령을 포함하는 닷큐어리를 통해 인터넷 사이트가 제공하는 다양한 서비스를 획득하는데 소요되는 여러 절차들을 대행하게 하고, 다수의 웹사이트에 대한 병렬 서비스들 또한 대행하게 한다. 이 에이전트는 IE와 같은 범용브라우저 내에 플러그 인되어 닷큐어리를 해독하며, 자체 프로그램을 통하여서도 사용자가 지시한 닷큐어리를 분석하여, 복수의 자체브라우저들을 통해 서비스 결과를 획득하도록 구성하였다.