• Journal of the Korean Institute of Intelligent Systems
• /
• v.2 no.3
• /
• pp.29-39
• /
• 1992

We investigate a systematic design procedure of automatic rule generation of fuzzy logic based controllers for highly nonlinear dynamic systems such as an engine dynamic modle. By "automatic rule generation" we mean autonomous clustering or collection of such meaningful transitional relations from one conditional subspace to another. During the design procedure, we also consider optimaly control strategies such as minimum squared error, near minimum time, minimum energy or combined performance critiera. Fuzzy feedback control systems designed by our method have the properties of closed-loop stability, robustness under parameter variabitions, and a certain degree of optimality. Most of all, the main advantage of the proposed approach is that reliability can be potentially increased even if a large grain of uncertainty is involved within the control system under consideration. A numerical example is shown in which we apply our strategic fuzzy controller dwsign to a highly nonlinear model of engine idling speed control.d control.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.203-210
• /
• 2004

Due to the explosion of e-commerce, recommender systems are rapidly becoming a core tool to accelerate cross-selling and strengthen customer loyalty. There are two prevalent approaches for building recommender systems - content-based recommending and collaborative filtering. Collaborative filtering recommender systems have been very successful in both information filtering domains and e-commerce domains, and many researchers have presented variations of collaborative filtering to increase its performance. However, the current research on recommendation has paid little attention to the use of time related data in the recommendation process. Up to now there has not been any study on collaborative filtering to reflect changes in user interest. This paper proposes dynamic fuzzy clustering algorithm and apply it to collaborative filtering algorithm for dynamic recommendations. The proposed methodology detects changes in customer behavior using the customer data at different periods of time and improves the performance of recommendations using information on changes. The results of the evaluation experiment show the proposed model's improvement in making recommendations.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.113-120
• /
• 2015

Technology analysis is to analyze technological data such as patent and paper for a given technology field. From the results of technology analysis, we can get novel knowledge for R&D planing and management. For the technology analysis, we can use diverse methods of statistics. Time series analysis is one of efficient approaches for technology analysis, because most technologies have researched and developed depended on time. So many technological data are time series. Time series data are occurred through time. In this paper, we propose a methodology of technology forecasting using the dynamic time warping (DTW) of time series analysis. To illustrate how to apply our methodology to real problem, we perform a case study of patent documents in target technology field. This research will contribute to R&D planning and technology management.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.55-58
• /
• 2018

본 논문에서는 넓은 동적 영역 (High Dynamic Range: HDR) 영상의 실시간 처리 방법을 제안한다. HDR 영상은 사람의 눈으로 볼 수 있는 자연 영상과 가깝지만 대부분의 디스플레이 기기들은 좁은 동적 영역 (Standard Dynamic Range: SDR)의 영상 출력만을 지원한다. 이러한 동적 영역의 차이를 사람의 시각 특성을 고려하여 축소하기 위해서는 톤 매핑 기법 (Tone Mapping Operator: TMO)을 수행하여야 한다. 하지만 기존의 이미지 톤 매핑 기법을 실시간 영상에 적용할 경우 영상의 실시간 처리, 플리커링 현상을 해결하는데 어려움이 있다. 본 논문에서는 k-means 클러스터링 기법을 사용하여 플리커 현상에 강인하고 실시간 비디오 톤 매핑이 가능한 알고리듬을 제안한다. 제안하는 알고리듬은 동적 계획법 (Dynamic Programming)을 통해 빠른 전역 해를 찾는 것이 가능하고 세부영상 향상 (Detail Enhancement)의 실시간 처리가 가능함을 보였다.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1645-1654
• /
• 2007

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.83-94
• /
• 2010

Mobile network infrastructure is being completed with the development of hardware and software for mobile devices. Network in mobile devices has evolved for telematics that is expanded much more than its existing concept. Telematics is compound word that is formed from the words "telecommunication" and "informatics". It means that telematics performs control and monitoring service with using mobile device resources. These services provide their services for users' requests through wired or wireless network from mobile devices and server that offers contents and network service collects management information of mobile devices. Map service is one of the preferred services for many telematics users. However, mobile map service has a limit between traffic and information sharing. Therefore it is very important to supply their information for both service provider and terminal user. In this paper, we design a new interactive sketch map using routes and information on the space to be applied effectively, and provide an extended document format that is defined to an extensible and dynamic clustering scheme to have portability map service for mobile device.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.31-37
• /
• 2003

This paper is a review of the large-scale information retrieval system, CONDOR. This system was developed by the consortium that consists of Chonbuk National University, Searchline Co. and Carnegie Mellon University. This system is based on the probabilistic model of information retrieval systems. The multi-language query processing, online document summarization based on query and dynamic hierarchy clustering of this system make difference of other systems. We test this system with 30 million web documents successfully.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.17-20
• /
• 2008

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.326-336
• /
• 2019

A wireless power transfer technique can solve the power capacity problem in wireless rechargeable sensor networks (WRSNs). The charging strategy is a wide-spread research problem. In this paper, we propose a demand-based charging strategy (DBCS) for WRSNs. We improved the charging programming in four ways: clustering method, selecting to-be-charged nodes, charging path, and charging schedule. First, we proposed a multipoint improved K-means (MIKmeans) clustering algorithm to balance the energy consumption, which can group nodes based on location, residual energy, and historical contribution. Second, the dynamic selection algorithm for charging nodes (DSACN) was proposed to select on-demand charging nodes. Third, we designed simulated annealing based on performance and efficiency (SABPE) to optimize the charging path for a mobile charging vehicle (MCV) and reduce the charging time. Last, we proposed the DBCS to enhance the efficiency of the MCV. Simulations reveal that the strategy can achieve better performance in terms of reducing the charging path, thus increasing communication effectiveness and residual energy utility.