• Title/Summary/Keyword: cluster method

Search Result 2,497, Processing Time 0.032 seconds

Design and Implementation of WMI based VOD Service for efficient Load Balance Policy (효율적인 부하 분산 정책을 위한 WMI 기반 VOD 서비스의 설계 및 구현)

  • Bang, Han-Min;Jung, In-Bum
    • Journal of Industrial Technology
    • /
    • v.29 no.A
    • /
    • pp.123-126
    • /
    • 2009
  • Cluster-based servers are utilized for large scale streaming services. These servers show good performance under fair resource usage balance policies between backend nodes. In this paper, cluster-based VOD servers are implemented based on WMI functions. Based on these functions, the information of resource usages in backend nodes can be exchanged and also the working states of cluster nodes can be monitored periodically. In experiences, we find motivations to design an effective load balancing policy. In addition, to provide reliable streaming services, the method to detect a partial failure in cluster-based servers is proposed.

  • PDF

Comparison of Reseults using Average Taxonomic Distance and Correlation Coefficient Matrices for Cluster Analyses (Cluster Analyses에서 Average Taxonomic Distance와 Correlation Coefficient 행렬식들을 이용한 결과의 비교)

  • Koh, Hung-Sun
    • The Korean Journal of Zoology
    • /
    • v.24 no.2
    • /
    • pp.91-98
    • /
    • 1981
  • It has been confirmed that two dendrograms resulted from two similarity matrices, average taxonomic distance and correlation coefficient matrices, are different with each other when cluster analyses were performed with 571 adults of deer mice, Peromyscus maniculatus using 30 morphometric characters. To choose one of two similarity matrices mentioned above in order to construct a dendrogram representing phenetic relationships among taxa, an objective method using the result from principal component analysis as a standard result to compare with two matrices has been suggested.

  • PDF

A Table Integration Technique Using Query Similarity Analysis

  • Choi, Go-Bong;Woo, Yong-Tae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.3
    • /
    • pp.105-112
    • /
    • 2019
  • In this paper, we propose a technique to analyze similarity between SQL queries and to assist integrating similar tables. First, the table information was extracted from the SQL queries through the query structure analyzer, and the similarity between the tables was measured using the Jacquard index technique. Then, similar table clusters are generated through hierarchical cluster analysis method and the co-occurence probability of the table used in the query is calculated. The possibility of integrating similar tables is classified by using the possibility of co-occurence of similarity table and table, and classifying them into an integrable cluster, a cluster requiring expert review, and a cluster with low integration possibility. This technique analyzes the SQL query in practice and analyse the possibility of table integration independent of the existing business, so that the existing schema can be effectively reconstructed without interruption of work or additional cost.

Density-based Outlier Detection in Multi-dimensional Datasets

  • Wang, Xite;Cao, Zhixin;Zhan, Rongjuan;Bai, Mei;Ma, Qian;Li, Guanyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.3815-3835
    • /
    • 2022
  • Density-based outlier detection is one of the hot issues in data mining. A point is determined as outlier on basis of the density of points near them. The existing density-based detection algorithms have high time complexity, in order to reduce the time complexity, a new outlier detection algorithm DODMD (Density-based Outlier Detection in Multidimensional Datasets) is proposed. Firstly, on the basis of ZH-tree, the concept of micro-cluster is introduced. Each leaf node is regarded as a micro-cluster, and the micro-cluster is calculated to achieve the purpose of batch filtering. In order to obtain n sets of approximate outliers quickly, a greedy method is used to calculate the boundary of LOF and mark the minimum value as LOFmin. Secondly, the outliers can filtered out by LOFmin, the real outliers are calculated, and then the result set is updated to make the boundary closer. Finally, the accuracy and efficiency of DODMD algorithm are verified on real dataset and synthetic dataset respectively.

Abell 2261: a fossil galaxy cluster in a transition phase

  • Kim, Hyowon;Ko, Jongwan;Kim, Jae-woo;Smith, Rory;Song, Hyunmi;Hwang, Ho Seong
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.43 no.1
    • /
    • pp.58.2-58.2
    • /
    • 2018
  • Fossil groups of galaxies have characteristic features of a dominant central elliptical galaxy (${\Delta}M_{12}$ > 2 in $0.5R_{vir}$) embedded in highly relaxed X-ray halo, which indicates dynamically stable and evolved systems. These are thought as a final stage of the evolution of galaxy groups in the hierarchical structure formation scenario. However, the formation and evolution of fossil clusters are still unclear due to lack of detailed studies. Therefore, we perform a kinematic research of a known fossil cluster Abell 2261 (A2261 hereafter) using spectroscopic data of 589 galaxies in the A2261 field. Even though A2261 is known as a fossil cluster, previous studies found several unusual features such as quite high X-ray entropy for a stable cluster, and an elongated shape, which are not expected in standard fossil clusters. Using the caustic method, we identify cluster member galaxies and discover a second bright galaxy (${\Delta}M_{12}=1.68$) at ${\sim}1.5R_{vir}$. The presence of such a bright galaxy can break the current fossil state of cluster in the near future. In addition, with two independent substructure finding methods, we confirm that the previously detected elongated galaxy distribution of the cluster is a real feature. These findings indicate that A2261 is not in a fully stable state, unlike the existing fossil definition diagnostic. We require a more stringent criterion for the fossil definition to represent a genuinely final stage of cluster evolution.

  • PDF

A new cluster validity index based on connectivity in self-organizing map (자기조직화지도에서 연결강도에 기반한 새로운 군집타당성지수)

  • Kim, Sangmin;Kim, Jaejik
    • The Korean Journal of Applied Statistics
    • /
    • v.33 no.5
    • /
    • pp.591-601
    • /
    • 2020
  • The self-organizing map (SOM) is a unsupervised learning method projecting high-dimensional data into low-dimensional nodes. It can visualize data in 2 or 3 dimensional space using the nodes and it is available to explore characteristics of data through the nodes. To understand the structure of data, cluster analysis is often used for nodes obtained from SOM. In cluster analysis, the optimal number of clusters is one of important issues. To help to determine it, various cluster validity indexes have been developed and they can be applied to clustering outcomes for nodes from SOM. However, while SOM has an advantage in that it reflects the topological properties of original data in the low-dimensional space, these indexes do not consider it. Thus, we propose a new cluster validity index for SOM based on connectivity between nodes which considers topological properties of data. The performance of the proposed index is evaluated through simulations and it is compared with various existing cluster validity indexes.

Implementation of Policy Based MANET Management System based on Active PDP Discovery (Active PDP Discovery에 기반한 정책 기반 MANET 관리 시스템 구현)

  • Huh, Jee-Wan;Song, Wang-Cheol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.11
    • /
    • pp.3176-3182
    • /
    • 2009
  • The PBNM on MANET is being researched to ensure the reliability and efficiency between mobile nodes. Therefore, it is essential to determine the cluster effectively which will perceive the movements of nodes and distribute the policies. In PBNM mechanism, to determine the node cluster for PDP and manage PEP nodes, Active PDP Discovery Protocol is proposed as a mechanism which is more efficient than preexistent techniques. While k-hop cluster selects the PEP nodes which PDP node manages, Active PDP Discovery actively selects the PDP node among the moving PEP node. This method prevents orphan nodes that are not connected to PDP and reduces continual broadcasting messages. This paper implements Active PDP Discovery which determines cluster in the real networks and analyzes its capability, expanding COPS-PR to detect the movement of nodes and adding MNL to PDP node.

Exploratory Study on the Success Factors of Rehabilitation Medical Device Cluster

  • Kim, Sung-Jin;Kim, Gyu-Bae
    • The Journal of Economics, Marketing and Management
    • /
    • v.6 no.4
    • /
    • pp.17-27
    • /
    • 2018
  • Purpose - As Korea is reaching a post-aged society, the number of chronic illness is increasing, and the demand for rehabilitation medical device is growing. Although there is high potential for the growth in rehabilitation industry, because most of the related companies in Korea are relatively small, lacking capital or R&D resource, it is difficult for them to create an innovative product, and currently most of the high-tech equipments are imported. Therefore a medical device cluster, where business, research, medical institutes and universities may work cooperatively to enhance research development and solve issues is necessary for future development. Research design, data, methodology - In this method we have done a literature review of the rehabilitation industry and industrial cluster. Based on the studies, we have conducted an exploratory factor analysis by studying examples of foreign and domestic medical clusters and drawing success factors in forming a medical cluster. Next based on the studies we have conducted a survey to domestic medical device companies to find their difficulties and needs to form a successful medical device cluster. Results - This paper provides both theoretic review on success factors of forming a medical device cluster and practical analysis using case study and survey. Conclusion - The significance of this paper is that based on the literature review, we have compared actual examples of domestic/foreign medical clusters and drawn difference and coincidence between literature and actual cluster success factor. We were also able to conduct a survey on actual medical device companies and through the results we were able to search difficulties and necessities of medical device companies.

Development of Subsurface Spatial Information Model with Cluster Analysis and Ontology Model (온톨로지와 군집분석을 이용한 지하공간 정보모델 개발)

  • Lee, Sang-Hoon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.13 no.4
    • /
    • pp.170-180
    • /
    • 2010
  • With development of the earth's subsurface space, the need for a reliable subsurface spatial model such as a cross-section, boring log is increasing. However, the ground mass was essentially uncertain. To generate model was uncertain because of the shortage of data and the absence of geotechnical interpretation standard(non-statistical uncertainty) as well as field environment variables(statistical uncertainty). Therefore, the current interpretation of the data and the generation of the model were accomplished by a highly trained experts. In this study, a geotechnical ontology model was developed using the current expert experience and knowledge, and the information content was calculated in the ontology hierarchy. After the relative distance between the information contents in the ontology model was combined with the distance between cluster centers, a cluster analysis that considered the geotechnical semantics was performed. In a comparative test of the proposed method, k-means method, and expert's interpretation, the proposed method is most similar to expert's interpretation, and can be 3D-GIS visualization through easily handling massive data. We expect that the proposed method is able to generate the more reasonable subsurface spatial information model without geotechnical experts' help.

Fast VQ Codebook Design by Sucessively Bisectioning of Principle Axis (주축의 연속적 분할을 통한 고속 벡터 양자화 코드북 설계)

  • Kang, Dae-Seong;Seo, Seok-Bae;Kim, Dai-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.4
    • /
    • pp.422-431
    • /
    • 2000
  • This paper proposes a new codebook generation method, called a PCA-Based VQ, that incorporates the PCA (Principal Component Analysis) technique into VQ (Vector Quantization) codebook design. The PCA technique reduces the data dimensions by transforming input image vectors into the feature vectors. The cluster of feature vectors in the transformed domain is bisectioned into two subclusters by an optimally chosen partitioning hyperplane. We expedite the searching of the optimal partitioning hyperplane that is the most time consuming process by considering that (1) the optimal partitioning hyperplane is perpendicular to the first principal axis of the feature vectors, (2) it is located on the equilibrium point of the left and right cluster's distortions, and (3) the left and right cluster's distortions can be adjusted incrementally. This principal axis bisectioning is successively performed on the cluster whose difference of distortion between before and after bisection is the maximum among the existing clusters until the total distortion of clusters becomes as small as the desired level. Simulation results show that the proposed PCA-based VQ method is promising because its reconstruction performance is as good as that of the SOFM (Self-Organizing Feature Maps) method and its codebook generation is as fast as that of the K-means method.

  • PDF