• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.35-41
• /
• 2018

In this paper, we propose a swarm-based possibilistic c-means(PCM) algorithm in order to overcome the problems of PCM, which are sensitiveness of clustering performance due to initial cluster center's values and producing coincident or close clusters. To settle the former problem of PCM, we adopt a swam-based global optimization method which can be provided the optimal initial cluster centers. Furthermore, to settle the latter problem of PCM, we design an adaptive thresholding model based on the optimized cluster centers that yields preliminary clustered and un-clustered dataset. The preliminary clustered dataset plays a role of preventing coincident or close clusters and the un-clustered dataset is lastly clustered by PCM. From the experiment, the proposed method obtains a better performance than other PCM algorithms on a simulated magnetic resonance(MR) brain image dataset which is corrupted by various noises and bias-fields.

• Journal of Astronomy and Space Sciences
• /
• v.36 no.1
• /
• pp.1-9
• /
• 2019

In this paper we present analysis of current density when the Cluster spacecraft pass the nightside auroral region at about $4-5R_E$ from the center of Earth. The analysis is made when the inter-spacecraft separation is within 200 km, which allows all four spacecraft to be situated inside the same current sheet. On 22 February 2002, two field-aligned current (FAC) events were observed in both the southern and the northern hemispheres. The FACs were calculated with magnetic field data obtained by the four spacecraft using the Curlometer method. The scales of the FACs along the spacecraft trajectory and the magnitudes were hundreds of kilometers and tens of $nA/m^2$, respectively, and both events were mapped to the auroral region in the ionosphere. We also examined reliability of the results with some parameters, and found that our results are adequately comparable with other studies. Nevertheless, some limitations that decrease the accuracy of current estimation exist.

• Bulletin of the Korean Chemical Society
• /
• v.14 no.2
• /
• pp.225-234
• /
• 1993

As an application of the cluster orbitals proposed previously, nickel-, palladium-, and platinum-hydrogen systems are studied. Density of states, projected density of states, HOMO levels, and stabilization energies are calculated and compared with those obtained by extended Huckel method for small clusters. These calculations are extended to large clusters to find the size dependence of several physical quantities. Reduced overlap populations are also calculated to clarify the charge transfer phenomena reported earlier. The calculated physical quantities show no dependence on the cluster size. It is also found that the charge transfer occurs due to the intrinsic character of palladium, not due to the edge effect which may be present in small clusters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.176-179
• /
• 2022

In this paper, we consider a sectorized wireless powered sensor network (WPSN), wherein sensor nodes are clustered based on sectors and transmit data to the cluster head (CH) using energy harvested from a hybrid access point. We construct a system model for this sectorized WPSN and find optimal coordinates of CH that maximize the achievable transmission rate of sensing data. To obtain the optimal CH with low overhead, we perform an asymptotic geometric analysis (GA). Simulation results show that the proposed GA-based CH selection method is close to the optimal performance exhibited by exhaustive search with a low feedback overhead.

• Journal of The Korean Astronomical Society
• /
• v.37 no.5
• /
• pp.349-353
• /
• 2004

Magnetic fields are an important ingredient of galaxy clusters and are indirectly observed on cluster scales as radio haloes and radio relics. One promising method to shed light on the properties of cluster wide magnetic fields is the analysis of Faraday rotation maps of extended extragalactic radio sources. We developed a Fourier analysis for such Faraday rotation maps in order to determine the magnetic power spectra of cluster fields. In an advanced step, here we apply a Bayesian maximum likelihood method to the RM map of the north lobe of Hydra A on the basis of our Fourier analysis and derive the power spectrum of the cluster magnetic field. For Hydra A, we measure a spectral index of -5/3 over at least one order of magnitude implying Kolmogorov type turbulence. We find a dominant scale of about 3 kpc on which the magnetic power is concentrated, since the magnetic autocorrelation length is ${\lambda}_B = 3 {\pm} 0.5\;kpc$. Furthermore, we investigate the influences of the assumption about the sampling volume (described by a window function) on the magnetic power spectrum. The central magnetic field strength was determined to be ${\~}7{\pm}2{\mu}G$ for the most likely geometries.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.165-170
• /
• 2011

Due to advances in hardware performance, user-friendly interfaces are becoming one of the major concerns in information systems. Linguistic conversation is a very natural way of human communications. Fuzzy techniques have been employed to liaison the discrepancy between the qualitative linguistic terms and quantitative computerized data. This paper deals with linguistic queries using clustering results on data sets, which are intended to retrieve the close clusters or distant clusters from the clustering results. In order to support such queries, a fuzzy technique-based method is proposed. The method introduces distance membership functions, namely, close and distant membership functions which transform the metric distance between two objects into the degree of closeness or farness, respectively. In order to measure the degree of closeness or farness between two clusters, both cluster closeness measure and cluster farness measure which incorporate distance membership function and cluster memberships are considered. For the flexibility of clustering, fuzzy clusters are assumed to be formed. This allows us to linguistically query close or distant clusters by constructing fuzzy relation based on the measures.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1097-1106
• /
• 2004

The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.4
• /
• pp.206-216
• /
• 2010

Wireless sensor networks (WSNs) are used to collect various data in environment monitoring applications. A spatial clustering may reduce energy consumption of data collection by partitioning the WSN into a set of spatial clusters with similar sensing data. For each cluster, only a few sensor nodes (samplers) report their sensing data to a base station (BS). The BS may predict the missed data of non-samplers using the spatial correlations between sensor nodes. ASAP is a representative data collection algorithm using the spatial clustering. It periodically reconstructs the entire network into new clusters to accommodate to the change of spatial correlations, which results in high message overhead. In this paper, we propose a new data collection algorithm, name EPDC (Energy-efficient Periodic Data Collection). Unlike ASAP, EPDC identifies a specific cluster consisting of many dissimilar sensor nodes. Then it reconstructs only the cluster into subclusters each of which includes strongly correlated sensor nodes. EPDC also tries to reduce the message overhead by incorporating a judicious probabilistic model transfer method. We evaluate the performance of EPDC and ASAP using a simulation model. The experiment results show that the performance improvement of EPDC is up to 84% compared to ASAP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.123-145
• /
• 2017

Due to the increasing demand for spectrum resources, cognitive radio networks and dynamic spectrum access draw a lot of research into efficiently utilizing limited spectrum resources. To set up cluster-based CR ad-hoc common channels, conventional methods require a relatively long time to successfully exchange the initialization messages. In this paper, we propose a fast and reliable common channel initialization protocol for CR ad-hoc networks. In the proposed method, the cluster head sequentially broadcasts a system activation signal through its available channels with a predetermined correlation pattern. To detect the cluster head's broadcasting channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation of an FFT bin sequence for each available channel of the member node. This is compared to the predetermined reference pattern. The join request and channel decision procedures are also presented in this paper. In a simulation study, the performance of the proposed method is evaluated.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1661-1669
• /
• 2010

In this paper, I propose an Energy efficient Clustering based on Genetic Algorithm(ECGA) which reduces energy consumption by distributing energy overload to cluster group head and cluster head in order to lengthen the lifetime of sensor network. ECGA algorithm calculates the values like estimated energy cost summary, average and standard deviation of residual quantity of sensor node and applies them to fitness function. By using the fitness function, we can obtain the optimum condition of cluster group and cluster. I demonstrated that ECGA algorithm reduces the energy consumption and lengthens the lifetime of network compared with the previous clustering method by stimulation.