• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.290-298
• /
• 2003

Internet-based computer systems have to provide both high-availability and high-performance. Cluster technology has been used to obtain availability and performance simultaneously Generally, high-availability cluster systems tolerate a failure of a cluster node and cost-effectively solve it. In this paper, we study availability and downtime cost of (n,k) cluster systems. By considering performance, we model state transition of (n,k) cluster systems and apply software rejuvenation technique to improve availability of the system. We find that software rejuvenation can be used to improve availability of (n,k) cluster systems.

• Bulletin of the Korean Space Science Society
• /
• 2010.04a
• /
• pp.34.4-34.4
• /
• 2010

We present the properties of globular cluster systems for 10 early-type galaxies in low density environments obtained using deep images from the Advanced Camera for Surveys (ACS) on the Hubble Space Telescope (HST). Using the ACS Virgo Cluster Survey as a counterpart in high-density environments, we investigate the role of environment in determining the properties of their globular cluster systems. We detect a strong colour bimodality of globular cluster systems in half of our galaxy sample. It is found that there is a strong correlation between the colour and richness of globular cluster populations and their host galaxy luminosities: the less bright galaxies possess bluer and fewer globular clusters as also seen in rich cluster environments. However, the mean colour of globular clusters in our field sample are slightly bluer than those in cluster environments at a given galaxy luminosity, and the colour of the red population has a steeper slope with absolute luminosity. By employing the YEPS simple stellar population model, the colour offset corresponds to metallicity difference of $\Delta$[F e/H ] ~ 0.15 - 1.20 or an age difference of $\Delta$age ~ 2 Gyr on average, implying that GCs in field galaxies appear to be either less metal-rich or younger than those in cluster galaxies. Although we have found that galaxy environment has a subtle effect on the formation and metal enrichment of GC systems, host galaxy mass is the primary factor that determines the stellar populations of GCs and the galaxy itself.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.5
• /
• pp.385-393
• /
• 2004

Cluster systems have been widely used for solving problems in various application domains, and regarded as useful high performance computing resources. As the number of cluster system user is increasing, it is no less important to maintain stable operation than to improve cluster system performance. Although hardware preventive maintenance is important for keeping normal operation, the testing tool which can be used for general cluster systems during maintenance has received little attention. In this Paper, considering hardware Preventive maintenance, we suggest a testing tool for hardware of cluster system. The cluster system testing tool which is named CTS(Cluster system Test Suite) has two check routines; one for memory, and the other for NIC respectively. The CTS is designed to support the common features of general cluster systems and all the Jobs such as setting test conditions to querying the results can be done entirely within an integrated GUI environment. CTS is used as the testing tool for two kinds of cluster systems during maintenance, and the experimental results show that CTS reports useful information for cluster systems management.

• The Journal of Information Systems
• /
• v.17 no.3
• /
• pp.135-152
• /
• 2008

Basically within a special regional area, a regional cluster seems to be based on core competencies of individual intra-cluster companies and collaboration among them. Information infrastructure has been emphasized as on one of competitive factors of a regional cluster, and it can be organized using collaboration system architecture integrated with each company's internal systems for efficient supply chain operation. As one of technical methods to prepare the system infrastructure supporting the collaboration of companies in a regional cluster, the Web Services can be effectively used. In this paper, a collaborative information system infrastructure for a regional cluster is suggested within the scope of supply chain management. And the efficiency of the proposed alternative is appraised with the features of a regional cluster.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.6
• /
• pp.621-626
• /
• 1999

In this paper a new cluster validation index which is heuristic but able to eliminate the monotonically decreasing tendency occurring in which the number of cluster c gets very large and close to the number of data points n is proposed. We review the FCM algorithm and some conventional cluster validity criteria discuss on the limiting behavior of the proposed validity index and provide some numerical examples showing the effectiveness of the proposed cluster validity index.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.9
• /
• pp.920-926
• /
• 2007

Establishing a fixed path for the message delivery through a wireless network is impossible due to the mobility. Among the number of routing protocols that have been proposed for wireless ad-hoc networks, the AODV(Ad-hoc On-demand Distance Vector) algorithm is suitable in the case of highly dynamic topology changes, along with ZigBee Routing(ZBR), with the exception of route maintenance. Accordingly, this paper introduces a routing scheme focusing on the energy efficiency and route discovery time for wireless alarm systems using IEEE 802.15.4-based ZigBee. Essentially, the proposed routing algorithm utilizes a cluster structure and applies ZBR within a cluster and DSR (Dynamic Source Routing) between clusters. The proposed algorithm does not require a routing table for the cluster heads, as the inter-cluster routing is performed using DSR. The performance of the proposed algorithm is evaluated and compared with ZBR using an NS2 simulator. The results confirm that the proposed Cluster-based AODV (CAODV) algorithm is more efficient than ZBR in terms of the route discovery time and energy consumption.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.11-16
• /
• 2023

Vehicular networks are part of the next generation wireless and smart Intelligent Transportation Systems (ITS). In the future, autonomous vehicles will be an integral part of ITS and will provide safe and reliable traveling features to the users. The reliability and security of data transmission in vehicular networks has been a challenging task. To manage data transmission in vehicular networks, road networks are divided into clusters and a cluster head is selected to handle the data. The selection of cluster heads is a challenge as vehicles are mobile and their connectivity is dynamically changing. In this paper, a novel secure cluster head selection algorithm is proposed for secure and reliable data sharing. The idea is to use the secrecy rate of each vehicle in the cluster and adaptively select the most secure vehicle as the cluster head. Simulation results show that the proposed scheme improves the reliability and security of the transmission significantly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.1
• /
• pp.24-35
• /
• 2013

A cell formation approach based on cluster analysis is developed for the configuration of manufacturing cells. Cell formation, which is to group machines and parts into machine cells and the associated part families, is implemented to add the flexibility and efficiency to manufacturing systems. In order to develop an efficient clustering procedure, this paper proposes a cluster analysis-based approach developed by incorporating and modifying two cluster analysis methods, a hierarchical clustering and a non-hierarchical clustering method. The objective of the proposed approach is to minimize intercellular movements and maximize the machine utilization within clusters. The proposed approach is tested on the cell formation problems and is compared with other well-known methodologies available in the literature. The result shows that the proposed approach is efficient enough to yield a good quality solution no matter what the difficulty of data sets is, ill or well-structured.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.1
• /
• pp.21-30
• /
• 2006

As the amount of information to be processed by computers has recently been increased, there has been cluster computing systems developed by connecting PCs and workstations using high-speed networks. hs a result, the studies on a cluster-based DBMS have been done with a wide range and it is necessary to develop a cluster manager for monitoring and managing cluster-based DBMSs. But, a cluster manager for efficiently managing cluster-based DBMSs has been studied in a first step. In this paper, we design and implement a high-availability cluster manager for a cluster-based DBMS. It monitors the status of nodes in cluster systems as well as the status of DBMS instances in a node, by using a graphic user interface (GUI). Our cluster manager supports the high-availability for a cluster-based DBMS by perceiving errors and recovering them, based on the monitored information on the status of a server.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.330-333
• /
• 2003

Initial cluster size for clustering of partitioning methods is very important to the clustering result. In K-means algorithm, the result of cluster analysis becomes different with optimal cluster size K. Usually, the initial cluster size is determined by prior and subjective information. Sometimes this may not be optimal. Now, more objective method is needed to solve this problem. In our research, we propose a hybrid genetic algorithm, a tree induction based evolution algorithm, for determination of optimal cluster size. Initial population of this algorithm is determined by the number of terminal nodes of tree induction. From the initial population based on decision tree, our optimal cluster size is generated. The fitness function of ours is defined an inverse of dissimilarity measure. And the bagging approach is used for saying computational time cost.