• 대한원격탐사학회지
• /
• 제16권2호
• /
• pp.145-156
• /
• 2000

Clustering is the process of partitioning a data set into meaningful clusters. As the data to process increase, a laster algorithm is required than ever. In this paper, we propose a clustering algorithm to partition a multispectral remotely sensed image data set into several clusters using a hash search algorithm. The processing time of our algorithm is compared with that of clusters algorithm using other speed-up concepts. The experiment results are compared with respect to the number of bands, the number of clusters and the size of data. It is also showed that the processing time of our algorithm is shorter than that of cluster algorithms using other speed-up concepts when the size of data is relatively large.

• 천문학논총
• /
• 제25권3호
• /
• pp.91-99
• /
• 2010

An increasing number of observations have confirmed the presence of multiple stellar populations in Galactic globular clusters. Multiple populations evidence come from the complex chemical pattern of stars hosted in GCs and from the split or broadening of different evolutionary sequences in the color-magnitude diagrams. Multiple stellar populations have been identified in Galactic and Magellanic Cloud clusters, as well as in external galaxies. In this paper I will summarize the observational facts.

• Communications for Statistical Applications and Methods
• /
• 제12권1호
• /
• pp.207-216
• /
• 2005

A binary segmentation procedure is a simple recursive approach to detect clusters and provide inferences for the study space when the shape of the clusters and the number of clusters are unknown. The procedure involves a sequence of nested hypothesis tests of a single cluster versus a pair of distinct clusters. The size and the shape of the clusters evolve as the procedure proceeds. The procedure allows for various growth clusters and for arbitrary baseline densities which govern the form of the hypothesis tests. A real tree data is used to highlight the procedure.

• 천문학회보
• /
• 제46권1호
• /
• pp.33.2-33.2
• /
• 2021

To study environmental effects on the circumgalactic medium (CGM), we use the samples of redMaPPer galaxy clusters, background quasars and cluster galaxies from the SDSS. With 82,000 quasar spectra, we detect 197 MgII absorbers in and around the clusters. The detection rate per quasar is 2.70 times higher inside the clusters than outside the clusters, indicating that MgII absorbers are relatively abundant in clusters. However, when considering the galaxy number density, the absorber-to-galaxy ratio is rather low inside the clusters. If we assume that MgII absorbers are mainly contributed by the CGM of massive star-forming galaxies, a typical halo size of cluster galaxies is smaller than that of field galaxies by 30 per cent. This finding supports that galaxy haloes can be truncated by interaction with the host cluster.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권2호
• /
• pp.116-120
• /
• 2008

Clustering is a method for unsupervised learning. General clustering tools have been depended on statistical methods and machine learning algorithms. One of the popular clustering algorithms based on machine learning is the self organizing map(SOM). SOM is a neural networks model for clustering. SOM and extended SOM have been used in diverse classification and clustering fields such as data mining. But, SOM has had a problem determining optimal number of clusters. In this paper, we propose an improvement of SOM using gap statistic and probability distribution. The gap statistic was introduced to estimate the number of clusters in a dataset. We use gap statistic for settling the problem of SOM. Also, in our research, weights of feature nodes are updated by probability distribution. After complete updating according to prior and posterior distributions, the weights of SOM have probability distributions for optima clustering. To verify improved performance of our work, we make experiments compared with other learning algorithms using simulation data sets.

• Journal of information and communication convergence engineering
• /
• 제5권1호
• /
• pp.59-63
• /
• 2007

In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Journal of information and communication convergence engineering
• /
• 제5권2호
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 II
• /
• pp.1165-1168
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

• 천문학회지
• /
• 제37권5호
• /
• pp.597-600
• /
• 2004

A substantial number of processes have been suggested as possible contributors to the extragalactic $\gamma$-ray background (EGRB). Yet another contribution to this background will be emission produced in hadronic interactions of cosmic-ray protons with the cluster thermal gas; this class of cosmic rays (CRs) has been shown to be responsible for the EUV emission in the Coma Cluster of galaxies. In this paper we assume the CRs in the Coma Cluster is prototypic of all clusters and derive the contribution to the EGRB from all clusters over time. We examine two different possibilities for the scaling of the CR flux with cluster size: the number density of the CRs scale with the number density of the thermal plasma, and alternatively, the energy density of the CRs scale with the energy density of the plasma. We find that in all scenarios the EGRB produced by this process is sufficiently low that it will not be observable in comparison with other mechanisms that are likely to produce an EGRB.

• 천문학회보
• /
• 제43권1호
• /
• pp.35.1-35.1
• /
• 2018

Shock waves have been observed in the outskirts of galaxy clusters. They are commonly interpreted as being driven by mergers of sub-clumps, so are called "merger shocks". We here report a study of the properties of merger shocks in merging galaxy clusters with cosmological hydrodynamic simulations. As a representative case, we describe the case where sub-clusters with mass ratio ~ 2 go through an almost head-on, binary-like merger. Because of the turbulent nature of hierarchical clustering, shock surfaces are not uniform, but composed of parts with different Mach numbers. As merger shocks expand from the core to the outskirts, the average Mach number, < $M_s$ >, increases. The shocks propagating along the merger axis could be observed as X-ray shocks and/or radio relics. The kinetic energy through the shocks peaks at ~ 1 Gyr after shock launching, or at ~ 1 - 2 Mpc from the core. The most energetic shocks are found to have the kinetic-energy weighted Mach number, < $M_s$ > $_{\phi}{\simeq}2-3$, and the CR-energy weighted Mach number, < $M_s$ > $_{CR}{\simeq}3-4$. We then discuss the observational implications of our results.