• Title/Summary/Keyword: Inter-clustering

Search Result 91, Processing Time 0.034 seconds

A Composite Cluster Analysis Approach for Component Classification (컴포넌트 분류를 위한 복합 클러스터 분석 방법)

  • Lee, Sung-Koo
    • The KIPS Transactions:PartD
    • /
    • v.14D no.1 s.111
    • /
    • pp.89-96
    • /
    • 2007
  • Various classification methods have been developed to reuse components. These classification methods enable the user to access the needed components quickly and easily. Conventional classification approaches include the following problems: a labor-intensive domain analysis effort to build a classification structure, the representation of the inter-component relationships, difficult to maintain as the domain evolves, and applied to a limited domain. In order to solve these problems, this paper describes a composite cluster analysis approach for component classification. The cluster analysis approach is a combination of a hierarchical cluster analysis method, which generates a stable clustering structure automatically, and a non-hierarchical cluster analysis concept, which classifies new components automatically. The clustering information generated from the proposed approach can support the domain analysis process.

Strong Connection Clustering Scheme for Shortest Distance Multi-hop Transmission in Mobile Sensor Networks (모바일 센서 네트워크에서 최단거리 멀티홉 전송을 위한 강한연결 클러스터 기법)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.6
    • /
    • pp.667-677
    • /
    • 2018
  • Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

A study of SSO design based SAML for public library clustering (공공도서관 클러스터링을 위해 SAML 기반의 사용자통합인증 설계에 관한 연구)

  • Byeon, Hoi Kyun;Ko, Il Ju
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.4 no.3
    • /
    • pp.55-67
    • /
    • 2008
  • The user has to subscribe to the library so that user use the library service. User has to register at that in order to use of the nearby another library. Moreover, service such as the inter-library loan and returning my loan book to other library in which the mutual cooperation between the library is needed necessity. But it services due to the constraint condition because of the administrative or technical problems. In this paper excludes the administrative element. The web service model is forming the cluster based on the mutual cooperation between the technologically adjacent public library and provides the technologically necessary single sign-on (SSO) in order to support the additional service. The single sign-on of the library which is concluded by this model using the security information exchange standard (Security Assertion Markup Language : SAML), it is processed by XML base. In using this model, the loan information is confirmed in the attribution in return service library and the model can utilize for the return of loan book in other library. It designs the single sign-on about it.

Mitochondrial DNA-based investigation of dead rorqual (Cetacea: Balaenopteridae) from the west coast of India

  • Shantanu Kundu;Manokaran Kamalakannan;Dhriti Banerjee;Flandrianto Sih Palimirmo;Arif Wibowo;Hyun-Woo Kim
    • Fisheries and Aquatic Sciences
    • /
    • v.27 no.1
    • /
    • pp.48-55
    • /
    • 2024
  • The study assessed the utility of mitochondrial DNA for identifying a deceased rorqual discovered off the western coast of India. Both the COI and Cytb genes exhibited remarkable 99-100% similarity with the GenBank sequence of Balaenoptera musculus through a global BLAST search, confirming their affiliation with this species. Inter-species genetic distances for COI and Cytb genes ranged from 6.75% to 9.80% and 7.37% to 10.96% respectively, compared with other Balaenopteridae species. The Bayesian phylogenies constructed based on both COI and Cytb genes demonstrated clear and separate clustering for all Balaenopteridae species, further reaffirming their distinctiveness, while concurrently revealing a cohesive clustering pattern of the generated sequences within the B. musculus clade. Beyond species confirmation, this study provides valuable insights into the presence of live and deceased B. musculus individuals within Indian marine ecosystems. This information holds significant potential for guiding conservation efforts aimed at safeguarding Important Marine Mammal Areas (IMMAs) in India over the long term.

Algorithm for Adjusting Cluster Size according to Location Information in WSN (무선 센서네트워크에서 센서노드의 위치 정보를 이용한 클러스터 크기 조정 알고리즘)

  • Kwak, Tae-Kil;Jin, Kyo-Hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.389-392
    • /
    • 2007
  • In this paper, we propose an algorithm that improve network lifetime by adjusting cluster size according to location information of sensor node in wireless sensor network (WSN) using clustering technique. The sensed information in each cluster transfers to sink node through inter-cluster communications. Cluster head (CH) that nearby located in sink node much more spend own energy than far away CHs, because nearer CH forwards more data, so network lifetime is decreased. Proposed algorithm minimizes energy consumption in adjacent cluster to sink node by decreasing cluster site, and improve CH lifetime by distributing transmission paths. As a result of analysis, the proposed algorithm shows longer network lifetime in WSN.

  • PDF

Adjusting Cluster Size for Alleviating Network Lifetime in Wireless Sensor Network (무선 센서네트워크에서 네트워크 수명 연장을 위한 클러스터 크기 조정 알고리즘)

  • Kwak, Tae-Kil;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1201-1206
    • /
    • 2007
  • In this paper, we propose an algorithm that improve network lifetime by adjusting cluster size according to location information of sensor node in wireless sensor network (WSN) using clustering algorithm. The collected sensing information by sensor nodes in each cluster are transferred to sink node using inter-cluster communications method. Cluster head (CH) that located nearby sink node spend much more energy than those of far from sink node, because nearer CH forwards more data, so network lifetime has a tendency to decrease. Proposed algorithm minimizes energy consumption in adjacent cluster to sink node by decreasing cluster size, and improve CH lifetime by distributing transmission paths. As a result of mathematical analysis, the proposed algorithm shows longer network lifetime in WSN.

Realignment of Clients in Client-server Database System (클라이언트-서버 데이터베이스에서 의 온라인 클라이언트 재배치)

  • Park, Young-B.;Park, J.
    • 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.

Interaction Effect of Network Structure and Knowledge Search on Knowledge Diffusion (지식 전파에 있어 네트워크 구조와 지식 탐색의 상호작용)

  • Park, Chulsoon
    • Korean Management Science Review
    • /
    • v.32 no.4
    • /
    • pp.81-96
    • /
    • 2015
  • This paper models knowledge diffusion on an inter-organizational network. Based on literatures related to knowledge diffusion, the model considers critical factors that affect diffusion behavior including nodal property, relational property, and environmental property. We examine the relationships among network structure, knowledge search, and diffusion performance. Through a massive simulation runs based on the agent-based model, we find that the average path length of a network decreases a firm's cumulative knowledge stock, whereas the clustering coefficient of a firm has no significant relationship with the firm's knowledge. We also find that there is an interaction effect of network structure and the range of knowledge search on knowledge diffusion. Specifically, in a network of a larger average path length (APL) the marginal effect of search conduct is significantly greater than in that of a smaller APL.

Efficient MLSE Equalization algorithm in Frequency selective channel environment (주파수 선택적 채널 환경에서의 효율적인 MLSE 등화 알고리즘)

  • Kang, Jee-Hye;Kim, Sung-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2565-2567
    • /
    • 2004
  • 본 논문에서는 빠르게 변화하는 이동 무선 채널 환경에서 심각한 성능 저하를 일으키는 인접 심볼 간섭(Inter-symbol interference: ISI)에 대처하기 위해 MLSE(Maximum Likelihood Sequence Estimztion) 등화기의 성능을 향상시키는 방법을 제안하였다. 기존의 MLSE 등화기는 비터비 알고리즘으로 어느 정도 계산량을 감소시켰지만, 정확한 채널 임펄스 응답을 필요로 하기 때문에, 시변 채널에서의 복잡한 채널 추정이 그 문제점으로 남아 있다. 이러한 문제점을 해결하기 위해서, 간단하고 향상된 칼만 필터 기반의 채널 추정기를 새롭게 제안하여 MLSE의 복잡성을 줄였다. 또한, 복잡한 채널 추정을 대신하여 페이딩 채널을 거쳐 수신된 데이터를 클러스터로 매핑하여 클러스터 중심 추정을 이용한 1-D CBSE(1-Dimensional Clustering-based Sequence Equalizer) 알고리즘에, 최소 길이를 지닌 훈련 시퀀스를 제안하여 개선된 1-D CBSE을 이용한 MLSE 등화 성능을 보여주었다.

  • PDF

3D Coordinates Transformation in Orthogonal Stereo Vision (직교식 스테레오 비젼 시스템에서의 3차원 좌표 변환)

  • Yoon, Hee-Joo;Cha, Sun-Hee;Cha, Eui-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.855-858
    • /
    • 2005
  • 본 시스템은 어항 속의 물고기 움직임을 추적하기 위해 직교식 스테레오 비젼 시스템(Othogonal Stereo Vision System)으로부터 동시에 독립된 영상을 획득하고 획득된 영상을 처리하여 좌표를 얻어내고 3차원 좌표로 생성해내는 시스템이다. 제안하는 방법은 크게 두 대의 카메라로부터 동시에 영상을 획득하는 방법과 획득된 영상에 대한 처리 및 물체 위치 검출, 그리고 3차원 좌표 생성으로 구성된다. Frame Grabber를 사용하여 초당 8-Frame의 두 개의 영상(정면영상, 상면영상)을 획득하며, 실시간으로 갱신하는 배경영상과의 차영상을 통하여 이동객체를 추출하고, Labeling을 이용하여 Clustering한 후, Cluster의 중심좌표를 검출한다. 검출된 각각의 좌표를 직선방정식을 이용하여 3차원 좌표보정을 수행하여 이동객체의 좌표를 생성한다.

  • PDF