• Journal of the Korean Vacuum Society
• /
• v.5 no.3
• /
• pp.251-257
• /
• 1996

The present paper represents the results of development and first experimental tests of a new ionized cluster beam (ICB) source. The novelty of ICB source lies in the fact that the crucible and ionization parts are spaced in one cylindrical shell but are not divided in an electric circuit. The ICB source adapts permanent magnets to increase the ionization efficiency. The maximum obtained $Cu^+$ ion current denisity is $1.5{\mu}A/\textrm{cm}^2$, therewith the ionization rate amounts 3% under deposition rate is 0.2$\AA$/s and the acceleration voltage is 4 kV, the $Cu^+$ ion beam uniformity is better than 95%.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.875-880
• /
• 2005

One of the most important issues in the sensor network with resource-constrained sensor nodes is prolonging the network lifetime by efficiently utilizing the given energy of nodes. The most representative mechanism to achieve a long-lived network is the clustering mechanism. In this paper, we propose a new dynamic-size multi-hop clustering mechanism in which the burden of a node acting as a cluster head(CH) is balanced regardless of the density of nodes in a sensor network by adjusting the size of a cluster based on the information about the communication load and the residual energy of the node and its neighboring nodes. We show that our proposed scheme outperforms other single-hop or fixed-size multi-hop clustering mechanisms by carrying out simulations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.3
• /
• pp.203-210
• /
• 2000

In this paper, we propose a new unsupervised learning network and competitive learning algorithm for pattern classification. The proposed network is based on relative similarity, which is similarity measure between input data and cluster group. So, the proposed network and algorithm is called relative similarity network(RSN) and learning algorithm. According to definition of similarity and learning rule, structure of RSN is designed and pseudo code of the algorithm is described. In general pattern classification, RSN, in spite of deletion of learning rate, resulted in the identical performance with those of WTA, and SOM. While, in the patterns with cluster groups of unclear boundary, or patterns with different density and various size of cluster groups, RSN produced more effective classification than those of other networks.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.1
• /
• pp.57.2-57.2
• /
• 2013

Based on N-body simulations, we find out that significant fraction of dynamically formed BH-BH (10 $M_{\odot}$ and NS-NS (1.4 $M_{\odot$ ecah) binaries are ejected from globular clusters. About 30 percent of compact stars are ejected in the form of binary. The merging time of ejected binary depends on the velocity dispersion of globular cluster. Some of ejected binaries have merging time-scales shorter than Hubble time and are expected to produce gravitational waves that can be detectable by the advanced ground-based interferometers. The merger rates of ejected BH-BH and NS-NS binaries per globular cluster are estimated to be 3.5 and 17 per Gyr, respectively. Assuming the spatial density of globular clusters as 8.4 $h^3$ clusters $Mpc^{-3}$ and extrapolating to the horizon distance of the advanced LIGO-Virgo network, we expect the detection rates solely attributed to BH-BH and NS-NS with cluster origin are to be 42 and 1.7 $yr^{-1}$, respectively. Besides, we find out that BH-NS binary ejection hardly occurs in globular clusters and dynamically formed compact binaries may possibly be the source of short GRBs whose locations are far from host galaxies.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.11
• /
• pp.1241-1248
• /
• 2014

An efficient battery usage of sensor nodes is main goal in a sensor network, which is the substructure of Internet of Things. Maximizing the battery usage of sensor nodes makes the lifetime of sensor network increase as well as the reliability of the network improved. The previous solutions to solve these problems are mainly focused on the cluster head selection based on the remaining energy. In this paper, we consider both the head selection and the replacement interval which is determined by a threshold that is based on the remaining energy, density of alive nodes, and location. Our simulation results show that the proposed scheme has outstanding contribution in terms of maximizing the life time of the network and balancing energy consumption of all nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.91-96
• /
• 2014

Since the sensors of Internet of Things (IOT) collect various data, the lifetime of sensor network is very important and the data should be aggregated efficiently. The contiguous collection by the certain sensors occurs an excessive battery consumption and successive transmission of same value of data should be avoided. To solve these things, we propose an weight-based cluster head replacement method that divides whole network into several grids and cluster head is selected by remaining energy, density of alive sensors and location of sensor. The aim of algorithm maximizes the lifetime of network. Our simulation results shows that the proposed method is very simple as well as balances energy consumption.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.113-120
• /
• 2006

This paper proposes DBSCAN-SI that is an algorithm for clustering with influences of spatial objects. DBSCAN-SI that is extended from existing DBSCAN and DBSCAN-W converts from non-spatial properties to the influences of spatial objects during the spatial clustering. It increases probability of inclusion to the cluster according to the higher the influences that is affected by the properties used in clustering and executes the clustering not only respect the spatial distances, but also volume of influences. For the perspective of specific property-centered, the clustering technique proposed in this paper can makeup the disadvantage of existing algorithms that exclude the objects in spite of high influences from cluster by means of being scarcely close objects around the cluster.

• The Korean Journal of Applied Statistics
• /
• v.22 no.2
• /
• pp.355-364
• /
• 2009

A simple method is proposed for constructing nonparametric confidence intervals for the difference or ratio of two median failure times. The method applies when clustered survival data with censoring is randomized either (I) under cluster randomization or (II) subunit randomization. This method is simple to calculate and is based on non-parametric density estimation. The proposed method is illustrated with the otology study data and HL-A antigen study data. Moreover, the simulation results are reported for practical sample sizes.

• Journal of Environmental Science International
• /
• v.8 no.3
• /
• pp.331-336
• /
• 1999

The monthly water quality data measured at 14 stations located in the Geum-River watershed were clustered into 2 to 7 clusters. Furthermore, factor analyses were conducted on Gabcheon and Yugucheon to characterize the water qualtiy, based on the information obtained from the results of culster analysis. The results of cluster analysis show that the water quality charactersitic of main stream of the Geum-River is somewhat different from that of substream of the Geum-River. Furthermore, the water quality characteristic of Gabcheon which is expected to have the most serious water quality problems in the Geum-River watershed shows the most different water quality characteristic from Yugucheon. Based ont he factor loadings in each factor, Gabcheon and Yugucheon have their own water quality characteristics. This is mainly because of composite factors such as different population density, industrial activities, and land use conditions in Gabcheon and Yugucheon subwatersheds.

• Communications for Statistical Applications and Methods
• /
• v.22 no.3
• /
• pp.265-276
• /
• 2015

In this paper, we propose hierarchical cluster analysis and multidimensional scaling for joint distribution valued data. Information technology is increasing the necessity of statistical methods for large and complex data. Symbolic Data Analysis (SDA) is an attractive framework for the data. In SDA, target objects are typically represented by aggregated data. Most methods on SDA deal with objects represented as intervals and histograms. However, those methods cannot consider information among variables including correlation. In addition, objects represented as a joint distribution can contain information among variables. Therefore, we focus on methods for joint distribution valued data. We expanded the two well-known exploratory methods using the dissimilarities adopted Hall Type relative projection index among joint distribution valued data. We show a simulation study and an actual example of proposed methods.