• Korean journal of applied entomology
• /
• v.57 no.4
• /
• pp.361-372
• /
• 2018

Migratory insect pest populations migrate from the southern China to Korea through jet streams. In Korea, 5 major migratory insect species are important, i.e. Nilaparvata lugens, Sogatella furcifera, Laodelphax striatellus, Cnaphalocrocis medinalis and Mythimma separate, which are damages to the major crops, rice. This study was conducted from late July 2016 to early September 2016 and from July 2017 to August 2017 in rice paddy of Jeolla-province. C. medinalis and M. separata collected using pheromone traps, while N. lugens, S. furcifera and L. striatellus collected using 3 methods (visual surveys, sweeping surveys, sticky traps). SADIE (Spatial Analysis by Distance IndicEs) among geostatistics was used to analyze migratory insect pests. SADIE was used to analyze spatial distribution and index of aggregation $I_a$, index of clustering $V_i$, $V_j$ were used to investigate the spatial distribution. Also, the clustering indices were mapped as red-blue plot. C. medinalis and M. separata showed different distribution based on SADIE spatial aggregation analysis and red-blue plot analysis. Initial spatial distributions of L. striatellus and other planthoppers were differed for sampling location and time.

• Journal of Korea Port Economic Association
• /
• v.28 no.2
• /
• pp.1-27
• /
• 2012

As more manufacturing and global businesses are being pulled into the port area, the idea of a Port Business Valley (PBV) is being pondered as it would create jobs and added value. The PBV would be centered around the harbor and be connected to the port, a logistics district, an industrial district, and the city. The resulting domestic and foreign investment in logistics, industry, business, tourism, living, etc. would vitalize the geographical characteristics of Incheon Port. It would also generate the largest amount of ripple effects between industries in the PBV. However, up until recently, the most frequently offered examples of planning that have helped logistics of a port to grow that have used a PBV have been those of Busan New Port and Gwangyang Port. However, this study is the result of the recent inception of the idea of creating a PBV centered around Incheon Port and the need for experts to develop a plan for such a PBV in Incheon by conducting a site specific study. The aim of this study is to set up the concept of PBV and establish PBV model of Incheon Port. In addition, this study identifies construct factors and their strategies for establish PBV of Incheon Port and then, shows the key factors and related-strategies on Fuzzy-AHP analysis from a survey of logistics experts with Incheon Port.

• Journal of Biomedical Engineering Research
• /
• v.21 no.4
• /
• pp.333-338
• /
• 2000

In this paper, an automated segmentation algorithm is proposed for MR brain images using T1-weighted, T2-weighted, and PD images complementarily. The proposed segmentation algorithm is composed of 3 step. In the first step, cerebrum images are extracted by putting a cerebrum mask upon the three input images. In the second step, outstanding clusters that represent inner tissues of the cerebrum are chosen among 3-dimensional(3D) clusters. 3D clusters are determined by intersecting densely distributed parts of 2D histogram in the 3D space formed with three optimal scale images. Optimal scale image is made up of applying scale space filtering to each 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram. In the final step, cerebrum images are segmented using FCM algorithm with its initial centroid value as the outstanding clusters centroid value. The proposed cluster's centroid accurately. And also can get better segmentation results from the proposed segmentation algorithm with multi spectral analysis than the method of single spectral analysis.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.43-56
• /
• 2012

Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.733-742
• /
• 2007

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Due to this reason, memory usage for data stream analysis should be confined finitely although new data elements are continuously generated in a data stream. To satisfy this requirement, data stream processing sacrifices the correctness of its analysis result by allowing some errors. The old distribution statistics are diminished by a predefined decay rate as time goes by, so that the effect of the obsolete information on the current result of clustering can be eliminated without maintaining any data element physically. This paper proposes a grid based clustering algorithm for a data stream. Given a set of initial grid cells, the dense range of a grid cell is recursively partitioned into a smaller cell based on the distribution statistics of data elements by a top down manner until the smallest cell, called a unit cell, is identified. Since only the distribution statistics of data elements are maintained by dynamically partitioned grid cells, the clusters of a data stream can be effectively found without maintaining the data elements physically. Furthermore, the memory usage of the proposed algorithm is adjusted adaptively to the size of confined memory space by flexibly resizing the size of a unit cell. As a result, the confined memory space can be fully utilized to generate the result of clustering as accurately as possible. The proposed algorithm is analyzed by a series of experiments to identify its various characteristics

• KIISE Transactions on Computing Practices
• /
• v.22 no.8
• /
• pp.369-374
• /
• 2016

The growing demand of virtual computing and storage resources in the cloud computing environment has led to deduplication of storage system for effective reduction and utilization of storage space. In particular, large reduction in the storage space is made possible by preventing data with identical content as the virtual desktop images from being stored on the virtual desktop infrastructure. However, in order to provide reliable support of virtual desktop services, the storage system must address a variety of workloads by virtual desktop, such as performance overhead due to deduplication, periodic data I/O storms and frequent random I/O operations. In this paper, we designed and implemented a clustered file system to support virtual desktop and storage services in cloud computing environment. The proposed clustered file system provides low storage consumption by means of inline deduplication on virtual desktop images. In addition, it reduces performance overhead by deduplication process in the data server and not the virtual host on which virtual desktops are running.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.42-49
• /
• 2009

This paper addresses clustering of blogs and posts in blogosphere. First, we model blogosphere as a social network where blogs and posts correspond to nodes and interactions on posts by blogs corresponds to links. Next, for clustering in blogosphere, we employ LinkClus, a link based algorithm that finds clusters of nodes in a network effectively and efficiently. For more accurate clustering, we propose two refinements: (1) change of granularity from blogs to folders, and (2) removal of blogs and posts being highly likely to incur noises. Finally, we verify the effectiveness of the proposed approach by showing how the posts and blogs in the same cluster are similar to one another in terms of their contents.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.09a
• /
• pp.111-118
• /
• 2010

최근 IT 분야에서 인터넷을 기반으로 IT 자원들을 서비스 형태로 제공하는 클라우드 컴퓨팅에 대한 연구가 활발히 진행되고 있다. 한편, 효율적인 클라우드 컴퓨팅을 제공하기 위해서는, 막대한 양의 데이터를 수많은 서버들에 분산 처장하고 관리하기 위한 분산 데이터 처장 기법 빛 분산 병렬 처리 기법에 대한 연구가 필수적이다. 이를 위해 본 논문에서는 대표적인 분산 병렬 처리 기법에 대해 살펴보고, 이를 비교 분석한다. 마지막으로 Hadoop 기반 클러스터를 구축하고 이를 통해서 대규모 데이터를 위한 분산 병렬 처리 기법에 대한 성능평가를 수행한다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.11-14
• /
• 2001

본 논문은 컬러를 이용한 영상 검색 방법에 관한 것으로 영상 데이터의 효율적인 관리를 위해 먼저 전처리 단계로 웨이블릿 변환을 수행한 후 가장 낮은 저주파 부밴드 영상을 획득한다. 그리고, 변환 후 획득된 영상을 클러스터로 구분한 후, 고유치 및 고유 벡터를 이용하여 특징을 추출하여 색인 정보로 이용하였다. 클러스터링은 영상 화소의 컬러공간 상의 3차원 거리를 클러스터링의 기준으로 삼아 순차 영역 분할(Sequential Clustering) 방법을 적용하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2001

본 논문에서는 정규화된 데이터 공간과 가우스함수에 의한 산 함수 형성 그리고 형성된 산의 기울기를 이용한 산봉우리 붕괴를 특징으로 하는 개선된 산 클러스터링 방법을 제안한다. 이 개선된 방법은 기존의 Yager 등에 의하여 제안된 방법이 조정해야 하는 매개변수가 3개이고 발견된 클러스터 중심 주위에 원치 않는 다른 중심이 발생할 수 있는데 반하여 단지 하나의 매개변수 $\omega$의 조정으로 더욱 타당한 중심을 찾아내는 점에서 유용하다 할 수 있다. 또한 매개변수 $\omega$에 대한 적절한 선정 방법을 제시하고, 수치 자료에 대한 컴퓨터 모의실험을 통하여 개선된 산 클러스터링 방법의 유용성을 입증한다.