• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.41-60
• /
• 2018

Recently, road traffic congestion is becoming a serious urban phenomenon, leading to massive adverse impacts on the ecology and economy. Therefore, solving this problem has drawn public attention throughout the world. One new promising solution is to take full advantage of vehicular ad hoc networks (VANETs). In this study, we propose a new traffic congestion detection and quantification method based on vehicle clustering and fuzzy assessment in VANET environment. To enhance real-time performance, this method collects traffic information by vehicle clustering. The average speed, road density, and average stop delay are selected as the characteristic parameters for traffic state identification. We use a comprehensive fuzzy assessment based on the three indicators to determine the road congestion condition. Simulation results show that the proposed method can precisely reflect the road condition and is more accurate and stable compared to existing algorithms.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.221-227
• /
• 2008

The proposed zone-based self-organized clustering broadcasts neighbor information to only a zone with the same ID. Besides, the zone-based self-organized clustering with unique IDs can communicate securely even if the state transition of nodes in zone-based self-organized clustering is threatened by corrupted nodes. For this security, the Byzantine agreement protocol with proactive asynchronous verifiable secret sharing (AVSS) is considered. As a result of simulation, an efficiency and a security of the proposed clustering are better than those of a traditional clustering. Therefore, this paper describes a new and extended self-organized clustering that securely seeks to minimize the interference in mobile ad hoc networks (MANETs).

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.228-234
• /
• 2021

The article defines the problems of forming the models of government regulation of clustering, marketing management and labor market in the context of globalization, business bankruptcy risk and services market development. The clustering models based on the optimal partner network cooperation were proposed in order to ensure the strategic development of territories, to attract budget leading enterprises and to support small businesses. A descriptive model of government regulation of clustering, marketing management and labor market in the context of globalization, business bankruptcy risk and Covid-19 was determined.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.1891-1899
• /
• 2014

A reliability model of wind farm located in mountainous land with complex terrain, which considers the cable and wind turbine (WT) failures, is proposed in this paper. Simple wake effect has been developed to be applied to the wind farm in mountainous land. The component failures in the wind farm like the cable and WT failures which contribute to the wind farm power output (WFPO) and reliability is investigated. Combing the wind speed distribution and the characteristic of wind turbine power output (WTPO), Monte Carlo simulation (MCS) is used to obtain the WFPO. Based on clustering algorithm the multi-state model of a wind farm is proposed. The accuracy of the model is analyzed and then applied to IEEE-RTS 79 for adequacy assessment.

• Communications for Statistical Applications and Methods
• /
• v.22 no.4
• /
• pp.321-331
• /
• 2015

The K-means clustering algorithm is a popular and widely used method for clustering. For covariance matrices, we consider a geodesic clustering algorithm based on the K-means clustering framework in consideration of symmetric positive definite matrices as a Riemannian (non-Euclidean) manifold. This paper considers a geodesic clustering algorithm for data consisting of symmetric positive definite (SPD) matrices, utilizing the Riemannian geometric structure for SPD matrices and the idea of a K-means clustering algorithm. A K-means clustering algorithm is divided into two main steps for which we need a dissimilarity measure between two matrix data points and a way of computing centroids for observations in clusters. In order to use the Riemannian structure, we adopt the geodesic distance and the intrinsic mean for symmetric positive definite matrices. We demonstrate our proposed method through simulations as well as application to real financial data.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.182-186
• /
• 2008

RFID systems generate huge amount of data quickly. The data are associated with the locations and the timestamps and the containment relationships. It is requires to assure efficient queries and updates for product tracking and monitoring. We propose a clustering technique for fast query processing. Our study presents the state charts of temporal event flow and proposes the dependence trees with data association and uses them to cluster the linked events. Our experimental evaluation show the power of proposing clustering technique based on dependence tree.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.6
• /
• pp.357-365
• /
• 2022

Refrigerant mischarging is one of the most frequently occurring failure modes in air conditioners, and both undercharging and overcharging degrade cooling performance. Therefore, it is important to accurately determine the amount of charged refrigerant. In this study, a support vector machine (SVM) model was developed to multi-classify the refrigerant mischarge through steady-state identification via fuzzy clustering techniques. For steady-state identification, a fuzzy clustering algorithm was applied to the air conditioner operation data using the difference between moving averages. The identification results using the proposed method were compared with those using existing steady-state determination techniques studied through the inversed Fisher's discriminant ratio (IFDR). Subsequently, the main features were selected using minimum redundancy maximum relevance (mRMR) considering the correlation among candidate features, and an SVM multi-classification model was devised using the derived features. The proposed method achieves satisfactory accuracy and robustness from test data collected in the new domain.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.20 no.10
• /
• pp.901-906
• /
• 2007

In this study, we measured the partial discharge phenomenon of inside the closed switchgear, using ultra wide band antenna. The characteristics of $\Phi-q-n$ in the normal state are stable, and confirmed at less than 0.01, but in proceeding states, about 2 times larger. And in the abnormal state, it grew hundreds of times larger compared with normal state. According to K-means analysis, if slant of discharge characteristics is a straight line close to "0" and standard deviation is small, it is in a normal state. However if we can find a peak from K-means clusters and standard deviation to be large, it is in an abnormal state.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.95-106
• /
• 2010

Many researches have been performed to increase energy-efficiency in wireless sensor networks. One of primary research topics is about clustering protocols, which are adopted to configure sensor networks in the form of hierarchical structures by grouping sensor nodes into a cluster. However, legacy clustering protocols do not propose detailed methods from the perspective of implementation to determine a cluster's boundary and configure a cluster, and to communicate among clusters. Moreover, many of them involve assumptions inappropriate to apply those to a sensor field. In this paper, we have designed and implemented a new T-Clustering (Top-down Clustering) protocol, which takes into considerations a node's density, a distance between cluster heads, and remained energy of a node all together. Our proposal is a sink-node oriented top-down clustering protocol, and can form uniform clusters throughout the network. Further, it provides re-clustering functions according to the state of a network. In order to verify our protocol's feasibility, we have implemented and experimented T-Clustering protocol on Crossbow's MICAz nodes which are executed on TinyOS 2.0.2.

• Journal of KIISE:Software and Applications
• /
• v.30 no.11
• /
• pp.1054-1061
• /
• 2003

Q-Learning, a representative algorithm of reinforcement learning, experiences repeatedly until estimation values about all state-action pairs of state space converge and achieve optimal policies. When the state space is high dimensional or continuous, complex reinforcement learning tasks involve very large state space and suffer from storing all individual state values in a single table. We introduce Q-Map that is new function approximation method to get classified policies. As an agent learns on-line, Q-Map groups states of similar situations and adapts to new experiences repeatedly. State-action pairs necessary for fine control are treated in the form of rule. As a result of experiment in maze environment and mountain car problem, we can achieve classified knowledge and extract easily rules from Q-Map