• Title/Summary/Keyword: 클러스터 영역

Search Result 250, Processing Time 0.02 seconds

Cause Diagnosis Method of Semiconductor Defects using Block-based Clustering and Histogram x2 Distance (블록 기반 클러스터링과 히스토그램 카이 제곱 거리를 이용한 반도체 결함 원인 진단 기법)

  • Lee, Young-Joo;Lee, Jeong-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.9
    • /
    • pp.1149-1155
    • /
    • 2012
  • In this paper, we propose cause diagnosis method of semiconductor defects from semiconductor industrial images. Our method constructs feature database (DB) of defect images. Then, defect and input images are subdivided by uniform block. And the block similarity is measured using histogram kai-square distance after color histogram calculation. Then, searched blocks in each image are merged into connected objects using clustering. Finally, the most similar defect image from feature DB is searched with the defect cause by measuring cluster similarity based on features of each cluster. Our method was validated by calculating the search accuracy of n output images having high similarity. With n = 1, 2, 3, the search accuracy was measured to be 100% regardless of defect categories. Our method could be used for the industrial applications.

A Study of How to Improve Execution Speed of Grabcut Using GPGPU (GPGPU를 이용한 Grabcut의 수행 속도 개선 방법에 관한 연구)

  • Kim, Ji-Hoon;Park, Young-Soo;Lee, Sang-Hun
    • Journal of Digital Convergence
    • /
    • v.12 no.11
    • /
    • pp.379-386
    • /
    • 2014
  • In this paper, the processing speed of Grabcut algorithm in order to efficiently improve the GPU (Graphics Processing Unit) for processing the data from the method. Grabcut algorithm has excellent performance object detection algorithm. Grabcut existing algorithms to split the foreground area and the background area, and then background and foreground K-cluster is assigned a cluster. And assigned to gradually improve the results, until the process is repeated. But Drawback of Grabcut algorithm is the time consumption caused by the repetition of clustering. Thus GPGPU (General-Purpose computing on Graphics Processing Unit) using the repeated operations in parallel by processing Grabcut algorithm to effectively improve the processing speed of the method. We proposed method of execution time of the algorithm reduced the average of about 95.58%.

Semantic schema data processing using cache mechanism (캐쉬메카니즘을 이용한 시맨틱 스키마 데이터 처리)

  • Kim, Byung-Gon;Oh, Sung-Kyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.89-97
    • /
    • 2011
  • In semantic web information system like ontology that access distributed information from network, efficient query processing requires an advanced caching mechanism to reduce the query response time. P2P network system have become an important infra structure in web environment. In P2P network system, when the query is initiated, reducing the demand of data transformation to source peer is important aspect of efficient query processing. Caching of query and query result takes a particular advantage by adding or removing a query term. Many of the answers may already be cached and can be delivered to the user right away. In web environment, semantic caching method has been proposed which manages the cache as a collection of semantic regions. In this paper, we propose the semantic caching technique in cluster environment of peers. Especially, using schema data filtering technique and schema similarity cache replacement method, we enhanced the query processing efficiency.

RRA : Ripple Routing Algorithm Considering the RF-Coverage of the node in WSN (RRA : 무선센서 네트워크에서 노드의 통신영역을 고려한 랜덤 배치 고정형 라우팅 알고리즘)

  • Lee, Doo-Wan;Kim, Min-Je;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.820-823
    • /
    • 2011
  • WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. In this paper, we propose a self-configuration routing protocol for WSN, which consists of step-wise ripple routing algorithm for initial deployment, effective joining of sensor nodes. RRA is search node in RF-coverage of each node, which result in fast network connection, reducing overall power consumption, and extending the lifetime of network.

  • PDF

Analysis of Connectivity between Jobs in University Libraries (대학도서관의 직무 연결성 분석)

  • Cho, Jane;Lee, Ji-Won
    • Journal of Information Management
    • /
    • v.43 no.4
    • /
    • pp.31-48
    • /
    • 2012
  • Social network analysis was performed on 545 job descriptions in 32 university libraries in Seoul, and drew the job distribution and their relations. Furthermore, for finding the differences according to scale of libraries, this study performed secondary analysis by dividing them two groups. Results show that large scale library show lower density and loose connectivity than small scale library. And while jobs of small scale library were clustered 3 groups, large scale university cluster 4 groups containing 1 technical job and 3 diverse user services. And the jobs that has high specificity, such as catalog or classification, shows high degree centrality in the case of small scale library. Whereas in large scale library they show lower degree centrality, so it can be said that these jobs were performed somewhat independently in large scale libraries.

Efficient Parallel Spatial Join Processing Method in a Shared-Nothing Database Cluster System (비공유 공간 클러스터 환경에서 효율적인 병렬 공간 조인 처리 기법)

  • Chung, Warn-Ill;Lee, Chung-Ho;Bae, Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.591-602
    • /
    • 2003
  • Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

A Study on the Energy Efficient Data Aggregation Method for the Customized Application of Underwater Wireless Sensor Networks (특정 응용을 위한 수중센서네트워크에서 에너지 효율적인 데이터통합 방법 연구)

  • Kim, Sung-Un;Park, Seon-Yeong;Yu, Hyung-Cik
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.11
    • /
    • pp.1438-1449
    • /
    • 2011
  • UWSNs(Underwater Wireless Sensor Networks) need effective modeling fitted to the customized type of application and its covering area. In particular it requires an energy efficient data aggregation method for such customized application. In this paper, we envisage the application oriented model for monitoring the pollution or intrusion detection over a given underwater area. The suggested model is based on the honeycomb array of hexagonal prisms. In this model, the purpose of data aggregation is that the head node of each layer(cluster) receives just one event data arrived firstly and transfer this and its position data to the base station effectively in the manner of energy efficiency and simplicity without duplication. Here if we apply the existent data aggregation methods to this kind of application, the result is far from energy efficiency due to the complexity of the data aggregation process based on the shortest path or multicast tree. In this paper we propose three energy efficient and simple data aggregation methods in the domain of cluster and three in the domain of inter-cluster respectively. Based on the comparative performance analysis of the possible combination pairs in the two domains, we derive the best energy efficient data aggregation method for the suggested application.

Institutional Approach to Innovation: the Knowledge Spillovers in Regional Innovation System and Innovative Cluster - Review and New Issue of Antecedent Research - (혁신의 제도적 접근: 지역혁신체제와 혁신클러스터의 지식파급효과 -선행연구의 검토와 새로운 쟁점-)

  • Bae, Eong Hwan
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.18 no.1
    • /
    • pp.115-135
    • /
    • 2015
  • In the glocalization a common phenomenon of several nations reveals knowledge innovation and growth by the important subject of region and state and is studied at theory and practice. the successful cases of regional development in an advanced country have leading innovation through regional innovation system and cluster. therefore we are necessary to analyse how the knowledge spillovers in innovative cluster as the reduced model of regional innovation system guide firm innovation and region growth. this article reviews theories and empirical studies of the knowledge spillovers in the regional innovation system and innovative cluster of innovative geography and proposes a new research issues for further explorations of the knowledge spillovers. Previous studies assist that knowledge spillovers exist in knowledge-based industries of specific local area and local innovation accomplishes through pure knowledge spillover. but limits of these studies include narrow region and technological area, few analytical variable and exclusion of rent knowledge spillover. therefore new research topics related with that exemplifies geographical dimension(concentration and decentralization), technological dimension(knowledge based industry), category of analytic variables(previous indicators, time, and social capital), conceptualization(appropriation means, markets for technology) etc.

  • PDF

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

A Control Channel Access Scheme for Clustered Multi-interface Multi-hop Cognitive Radio Networks (클러스터 형태의 다중 인터페이스 다중 홉 인지 라디오 네트워크를 위한 제어 채널 접근 기법)

  • Lee, Ji-Wun;Jeon, Wha-Sook;Jeong, Dong-Geun
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.301-306
    • /
    • 2010
  • We propose the control channel access scheme for multi-interface multi-hop cognitive radio (CR) environment having a cluster structure. Due to the difficulty of obtaining common channels across the entire CR network, most multi-interface multi-hop CR networks put the control channel outside the CR bandwidth and dedicate one network interface to it in order to exchange the control information such as the activation of licensed users. However, this will be the waste of the network interface. Our focus is how to alternate between the control and the data channel without multichannel hidden node problem under the cluster structure where CR nodes connect with neighbors through multiple data channels. By using simulation, we evaluate the performance of the proposed scheme. The results show that the proposed scheme achieves higher network throughput than the dedicated scheme where one network interface card should dedicate to the control channel and cannot be used for data transmission.