• Journal of The Korean Astronomical Society
• /
• v.38 no.3
• /
• pp.345-355
• /
• 2005

We present a photometric study of the star cluster system in the merging galaxy NGC 1487, based on the BI photometry obtained from the F450W and F814W images in the HST /WFPC2 archive data. We have found about 560 star cluster candidates in NGC 1487, using the morphological parameters of the objects. We have investigated several photometric characteristics of the clusters: color-magnitude diagrams (CMDs), color distribution, spatial distribution, age, size and luminosity function. The CMD of the bright clusters with 18.5 < B < 24 mag in NGC 1487 shows three major populations of clusters: a blue cluster population with $(B-I){\le}0.45$, an intermediate-color cluster population with $0.45<(B-I){\le}1.55$, and a red cluster population with (B - I) > 1.55. The intermediate-color population is the most dominant among the three populations. The brightest clusters in the blue and intermediate- color populations are as bright as $B{\approx}18mag$ ($M_B{\approx}-12mag$), which are three magnitudes brighter than those in the red population. The blue and intermediate-color clusters are strongly concentrated on the bright condensations, while the red clusters are relatively more scattered over the galaxy. The CMD of these clusters is found to be remarkably similar to that of the clusters in the famous interacting system M51. From this we suggest that the intermediate-color clusters were, probably, formed during the merging process which occurred about 500 Myrs ago.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1082-1092
• /
• 2008

In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.783-790
• /
• 2009

The necessity of wireless sensor networks is increasing in the recent years. So many researches are studied in wireless sensor networks. The clustering algorithm provides an effective way to prolong the lifetime of the wireless sensor networks. The one-hop routing of LEACH algorithm is an inefficient way in the energy consumption of cluster-head, because it transmits a data to the BS(Base Station) with one-hop. On the other hand, other clustering algorithms transmit data to the BS with multi-hop, because the multi-hop transmission is an effective way. But the multi-hop routing of other clustering algorithms which transmits data to BS with multi-hop have a data bottleneck state problem. The unequal clustering algorithm solved a data bottleneck state problem by increasing the routing path. Most of the unequal clustering algorithms partition the nodes into clusters of unequal size, and clusters closer to the BS have small-size the those farther away from the BS. However, the energy consumption of cluster-head in unequal clustering algorithm is more increased than other clustering algorithms. In the thesis, I propose an energy efficient unequal clustering algorithm which decreases the energy consumption of cluster-head and solves the data bottleneck state problem. The basic idea is divided a three part. First of all I provide that the election of appropriate cluster-head. Next, I offer that the decision of cluster-size which consider the distance from the BS, the energy state of node and the number of neighborhood node. Finally, I provide that the election of assistant node which the transmit function substituted for cluster-head. As a result, the energy consumption of cluster-head is minimized, and the energy consumption of total network is minimized.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.02a
• /
• pp.135-136
• /
• 2012

Carbon atoms near the surface of W(110) induce reconstructions such as $R(15{\times}12)$ -C/W(110) which consists of two characteristic parts, one square shaped and bright protrusion and two smaller ones. In the atomic resolution STM image, the bigger protrusion shows the periodicities of clean W(110), indicating that it is almost carbon poor region. The smaller protrusion contains hexagonal carbide surface layer of ${\alpha}$-W2C on W(110). Employing this carburized W(110) as templates, we grow Co and Fe clusters of less than ten atoms. Due to the selectivity of bonding sites, growth of larger cluster is highly unfavorable for Co and the size of clusters is very uniform. Since Co atoms prefer to sit on the bigger protrusion rather than smaller one, Co cluster can be arranged one-dimensionally in $R(15{\times}12)$-C/W(110) with quite uniform size distribution. However, Fe clusters sit on both sites without favored site, but still with uniform size distribution. On the other hand, Fe clusters can be grown with quasi one-dimensional order in $R(15{\times}3)$-C/W(110), which consists of only smaller protrusions. We investigate the magnetic properties of the ordered nano-sized clusters. Experiments using XMCD reveals little magnetic moment of Co cluster on $R(15{\times}12)$-C/W(110). This observation is consistent with the predictions of our first principles calculations that small Co clusters can be nonmagnetic or antiferromagnetic with low mean magnetic moment per atom.

• Journal of the Korean Home Economics Association
• /
• v.41 no.6
• /
• pp.119-129
• /
• 2003

This study was peformed to establish the standard size system to be required for the production of brassiere. The subject were 155 Korean twenties-aged women and were directly measured anthropometrically. From 27 measurements, 5 factors were extracted through factor analysis. The accumulative contribution ratio is 76.92％. Factor 1 indicates the degree of obesity around the chest, factor 2 is the drooping degree of breast, factor 3 is the contours and prominence, factor 4 is the breast breadth and breadth of bust point, factors 5 is the volume of breast. The subject were classified into 3 cluster as their breast types through cluster analysis. Type 1 is the closest to the ideal breast shape and not too droopy. This group belonged to 75A. Type 2 has small breast and belonged to 70AA group. Type 3 is the obesest and has the biggest and droopy breast. This group belonged to 75B. The distribution of size of brassiere had 3 sections from 70 to 80 showing a rate of 81.94% and the sin of the cup had 4 sections from AAA cup to B cup showing a rate of 89.70％. The production ratio of each brassiere size, it was found that the brassiere size of highest production ratio was 75A(16.39％) in type 1,70AA(16.27%) in type 2, and 75B(13.72％) in type 3. This suggests that it is necessary to adjust for the production rate of brassieres.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.331-338
• /
• 2003

Cluster is the cost-effective parallel processing environment, and consists of the off-the-shelf computers connected by the computer net works. The characteristics of cluster are the node heterogeneity, the variety of node load, and the variety of network load. Because these characteristics influence the performance of parallel program executions, the load sharing for cluster is important, and by using the proper load sharing strategy, we can reduce the execution time of parallel programs. In this paper, we propose modified GSS algorithm, αGSS. In the proposed load sharing algorithms α GSS, the size of tasks are decided using the BogoMIPS of node. From the result of out experiments, we conclude that the proposed αGSS algorithm is effective in the heterogeneous cluster.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.689-698
• /
• 2008

The performance of a TCP protocol on MANETs has been studied in a numerous researches. One of the significant reasons of TCP performance degradation on MANETs is inability to distinguish between packet losses due to congestion from those caused by nodes mobility and as consequence broken routes. This paper presents the Cluster-Label-based Routing (CLR) protocol that is an attempt to compensate source of TCP problems on MANETs - multi-hop mobile environment. By utilizing Cluster-Label-based mechanism for Backbone, the CLR is able to concentrate on detection and compensation of movement of a destination node. The proposed protocol provides better goodput and delay performance than standardized protocols especially in cases of large network size and/or high mobility rate.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.5
• /
• pp.511-518
• /
• 2015

As the cost-per-byte of SSDs dramatically decreases, the introduction of SSDs to Hadoop becomes an attractive choice for high performance data processing. In this paper the cost-per-performance of SSD-based Hadoop cluster (SSD-Hadoop) and HDD-based Hadoop cluster (HDD-Hadoop) are evaluated. For this, we propose a MapReduce performance model using queuing network to simulate the execution time of MapReduce job with varying cluster size. To achieve an accurate model, the execution time distribution of MapReduce job is carefully profiled. The developed model can precisely predict the execution time of MapReduce jobs with less than 7% difference for most cases. It is also found that SSD-Hadoop is 20% more cost efficient than HDD-Hadoop because SSD-Hadoop needs a smaller number of nodes than HDD-Hadoop to achieve a comparable performance, according to the results of simulation with varying the number of cluster nodes.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.17 no.4
• /
• pp.602-607
• /
• 1993

Concept of the comfort and fitness becomes a major concern in the basic function of the ready-made clothes. This research was performed to classify and characterize Korean adult males anthropometrically. Sample size was 1290 subjects and their age range was from 19 to 54 years old. Sampling was carried out by the stratified sampling method. 75 variables in total were applied to classify the bodytypes. Data were analyzed by the multivariate method, especially factor and cluster analysis. The high factor loading items extracted by factor analysis were based to determine the variables of the cluster analysis for the similar bodytypes respectively. In the part of the lower body, 14 variables from the data were applied to classify the bodytypes of lower part by Ward's minimum variance method. The group fanning a cluster were subdivided into 5 sets by cross-tabulation extracted by the hierarchical cluster analysis. Type 3 and 4 in lower body were composed of the majority of 53.1% of the subjects. The Korean adult males had relatively well-balanced in lower body.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1706-1715
• /
• 2008

In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.