• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.84-95
• /
• 2008

Wireless sensor networks have recently emerged as a platform for several applications. By deploying wireless sensor nodes and constructing a sensor network, we can remotely obtain information about the behavior, conditions, and positions of objects in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable to prolong the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering algorithm that distributes the energy consumption of a cluster head. First, we analyze the energy consumption if cluster heads and divide each cluster into a collection layer and a transmission layer according to their roles. Then, we elect a cluster head for each layer to distribute the energy consumption of single cluster head. In order to show the superiority of our clustering algorithm, we compare it with the existing clustering algorithm in terms of the lifetime of the sensor network. As a result, our experimental results show that the proposed clustering algorithm achieves about $10%{\sim}40%$ performance improvements over the existing clustering algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.1-14
• /
• 2006

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.27-33
• /
• 2008

The clustering of gene expression data is used to analyze the results of microarray studies. This clustering is one of the frequently used methods in understanding degrees of biological change and gene expression. In biological research, MCL algorithm is an algorithm that clusters nodes within a graph, and is quick and efficient. We have modified the existing MCL algorithm and applied it to microarray data. In applying the MCL algorithm we put forth a simulation that adjusts two factors, namely inflation and diagonal tent and converted them by making use of Markov matrix. Furthermore, in order to distinguish class more clearly in the modified MCL algorithm we took the average of each row and used it as a threshold. Therefore, the improved algorithm can increase accuracy better than the existing ones. In other words, in the actual experiment, it showed an average of 70% accuracy when compared with an existing class. We also compared the MCL algorithm with the self-organizing map(SOM) clustering, K-means clustering and hierarchical clustering (HC) algorithms. And the result showed that it showed better results than ones derived from hierarchical clustering and K-means method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7A
• /
• pp.709-716
• /
• 2006

본 논문에서는 무선 센서 네트워크의 다양한 응용 환경 및 상/하향 트래픽 스트림의 특성에 따라 유연하게 적용할 수 있는 새로운 매체접근제어 프로토콜을 제안한다. HiPERMAC(Hierarchically-Paired Evolutionary Radio MAC)이라고 불리는 제안 매체접근제어방식은 다양한 클러스터링 방식에 의하여 구축된 다 계층 (Hierarchical) 네트워크에서 별도의 대역 확산 전송방식이나 다수의 주파수 채널을 사용하지 않고, 단 2개의 시간 구간을 공간적으로 재활용하여 N 계층의 개별적인 통신이 가능한 구조를 제공한다. 즉, 제안방식은 단일 주파수 개념을 이용하여 계층화된 우선 센서 네트워크를 계층적 이중화(Hierarchically-Paired)하고 이때 발생하는 클러스터 간 상호 간섭의 요인들을 시간 및 공간적으로 분리하여 망 확장성과 자원 효율성을 극대화 하는 새로운 매체접근 제어 방식 이다.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.1
• /
• pp.45-50
• /
• 2019

With the gradual advancement of IT, passive work processes are automated and the overall quality of life has greatly improved. This is made possible by the formation of an organic topology between a wide variety of real-life smart devices. To serve these diverse smart devices, businesses or users are using the cloud. The services in the cloud are divided into Infrastructure as a Service (IaaS), Platform as a Service (PaaS) and Software as a Service (SaaS). SaaS runs on PaaS, and PaaS runs on IaaS. Since IaaS is the basis of all services, an algorithm is required to operate virtualization resources efficiently. Among them, desktop resource virtualization is used for resource high availability of unused state time of existing desktop PC. Clustering of hierarchical structures is important for high availability of these resources. In addition, it is very important to select a suitable algorithm because many clustering algorithms are mainly used depending on the distribution ratio and environment of the desktop PC. If various attempts are made to find an algorithm suitable for desktop resource virtualization in an operating environment, a great deal of power, time, and manpower will be incurred. Therefore, this paper proposes a resource clustering simulator for cluster selection of desktop virtualization. This provides a clustering simulation to properly select clustering algorithms and apply elements in different environments of desktop PCs.

• Journal of Internet Computing and Services
• /
• v.20 no.6
• /
• pp.11-20
• /
• 2019

Numerous enterprises, organizations and individual users are exposed to large DDoS (Distributed Denial of Service) attacks. DDoS attacks are performed through a BotNet, which is composed of a number of computers infected with a malware, e.g., zombie PCs and a special computer that controls the zombie PCs within a hierarchical chain of a command system. In order to detect a malware, a malware detection software or a vaccine program must identify the malware signature through an in-depth analysis, and these signatures need to be updated in priori. This is time consuming and costly. In this paper, we propose a botnet detection scheme that does not require a periodic signature update using an artificial neural network model. The proposed scheme exploits Word2Vec and accelerated hierarchical density-based clustering. Botnet detection performance of the proposed method was evaluated using the CTU-13 dataset. The experimental result shows that the detection rate is 99.9%, which outperforms the conventional method.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.639-646
• /
• 2003

Conventional two-tier databases have shown performance limitation in the presence of many concurrent clients. To this end, the three-tier architecture that exploits similarities in client's object access behavior has been proposed. In this system, clients are partitioned into clusters, and object requests can be then served in inter-cluster manner. Introducing an intermediate layer between server(s) and clients enables this. In this paper, we introduce the problem of client realignment in which access behavior changes, and propose on-line client clustering. This system facilitates adaptive reconfiguration and redistribution of sites. The core issue in this paper is to demonstrate the effectiveness of on-line client clustering. We experimentally investigate the performance of the scheme and necessary costs.

• Journal of KIISE:Software and Applications
• /
• v.28 no.2
• /
• pp.157-167
• /
• 2001

본 논문은 고품질의 정보를 신속하게 제공할 수 있으면서 가격대 성능비가 우수한 병렬 정보 검색 시스템을 제시하고 있다. 본 검색 시스템은 문서 라이브러리를 여러 개의 클러스터로 세분화하고 검색 시 클러스터 단위로 프로세서에 할당함으로써 작업 단위를 적절한 규모로 하였을 뿐만 아니라, 문서의 점수 계산 시 프로세서 간 통신이 전혀 필요치 않게 하였다. 검색은 1차로 클러스터 레벨에서 관련 클러스터들을 찾는 것으로 시작하여 2차로 관련 클러스터 내에서 실제 문서를 찾는 방식으로 이루어진다. 이러한 계층적인 검색 구조로 인하여 1차 검색 후 여과가 가능하므로 전체적인 검색의 부하를 줄일 수 있다. 또한 문서의 클러스터가 가능한 한 유사한 문서군이 되도록 함으로써 불필요한 클러스터가 검색될 가능성을 최소화하여 성능을 높였다. 본 검색 시스템은 분산메모리 MIMD 구조의 다중 트랜스퓨터 시스템에서 구현되었으며, 실험 결과 무작위적으로 클러스터링한 경우에 비해 유사 문서군으로 클러스터링한 접근 방법이 우수함을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.305-309
• /
• 2008

기존의 온톨로지 구축에 관한 연구들을 살펴보면 개념의 상 하위 관계와 관련한 연구 또는 기구축된 도메인에 특화된 지식베이스에 기반한 도메인 온톨로지 구축 연구가 주를 이룬다. 그러나 개념과 개념간의 관계는 상 하위 구조와 같은 단순한 계층적 구조로는 그 다양한 특성을 표현할 수 없으며, 도메인 온톨로지를 구축하는 경우에 기구축된 데이터베이스와 같은 개념간 관계가 잘 정의된 데이터는 반드시 필요하였다. 예를 들면, 다양한 지식이 구축되어 있는 데이터베이스나 특정 도메인에 관한 전문 사이트(예 : 의학정보, 약학정보 사이트) 등이 있어야 개념간의 다양한 관계가 표현되어 있는 온톨로지를 구축할 수 있었다. 본 연구에서는 도메인 온톨로지를 구축함에 있어서 이러한 제약을 극복하기 위하여 도메인에 특화된 문서들을 웹 검색을 통하여 수집하였고, 수집된 문서 데이터를 이용하여 자동으로 도메인에 특화된 개념들을 추출하고 이들 개념들을 클러스터링함으로써 개념들간의 다양한 관계를 표현할 수 있는 도메인 온톨로지의 자동 구축 가능성을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.05a
• /
• pp.323-325
• /
• 2018

본 논문은 몰입도와 생체신호 간의 상관관계를 분석하기 위한 데이터 수집 및 데이터 군집에 대한 연구이다. 스마트기기를 이용해 걸음 수, 심박 수, 수면깊이와 같은 생체 데이터수집과, 수집한 데이터를 토대로 사용자의 행동패턴을 분석한다. 사용자 생체 데이터를 k-means 클러스터링과 계층적 클러스터링을 혼합해 이용해 앞서 나열한 데이터와 사용자의 집중도와 연관관계분석이 최종 목표이다.