• Nuclear Engineering and Technology
• /
• v.48 no.2
• /
• pp.482-494
• /
• 2016

The Feshbache-Kermane-Koonin (FKK) multi-step direct (MSD) theory of pre-equilibrium reactions has been used to compute the single-step cross-sections for some (p,${\alpha}$) reactions using the knock-on and pick-up reaction mechanisms at two incident proton energies. For the knock-on mechanism, the reaction was assumed to have taken place by the direct ejection of a preformed alpha cluster in a shell-model state of the target. But the reaction was assumed to have taken place by the pick-up of a preformed triton cluster (also bound in a shell-model state of the target core) by the incident proton for the pick-up mechanism. The Yukawa forms of potential were used for the proton-alpha (for the knock-on process) and proton-triton (for the pick-up process) interaction and several parameter sets for the proton and alpha-particle optical potentials. The calculated cross-sections for both mechanisms gave satisfactory fits to the experimental data. Furthermore, it has been shown that some combinations of the calculated distorted wave Born approximation cross-sections for the two reaction mechanisms in the FKK MSD theory are able to give better fits to the experimental data, especially in terms of range of agreement. In addition, the theory has been observed to be valid over a wider range of energy.

• 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.

• Phonetics and Speech Sciences
• /
• v.1 no.1
• /
• pp.33-40
• /
• 2009

This study examines how young speakers of Seoul Korean produce tri-consonantal clusters /1kt/ and /1pt/ as in palk-ta ('to be bright') and palp-ta ('to step on'). Production data were collected from 20 speakers of Seoul Korean. The results of narrow transcription of the data showed that simplification is not obligatory as some speakers often preserve all three consonants. When simplified, there was a clear asymmetry between /1kt/ and /1pt/. Speakers showed no clear preference for either C1 preservation (C1=/1/) or C2 preservation (C2=/k/ in /1kt/ and /p/ in /1pt/) in production of /1kt/, but in production of /1pt/, strong preference was found for C1-preserved to C2-preserved variant. When compared with production data in Cho (1999), simplification patterns appear to have changed over the past 10 years, in a direction to preserve the first member of the cluster (/1/) more often, especially with /1kt/. There was no substantial between-item variation, indicating that simplification patterns are not lexically specified. Finally, the results suggest that the process of tri-consonantal simplification has not been fully phonologized in the grammar of the language as evident in substantial inter- and intra-speaker variation.

• Journal of information and communication convergence engineering
• /
• v.5 no.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.

• Journal of Global Scholars of Marketing Science
• /
• v.17 no.3
• /
• pp.1-19
• /
• 2007

1. Purpose Rural tourism is made by individuals with different characteristics, needs and wants. It is important to have information on the characteristics and preferences of the consumers of the different types of existing rural accommodation. The stud aims to identify the determinants of consumer preference by type of accommodations. 2. Methodology 2.1 Sample Data were collected from 1000 people by telephone survey with three-stage stratified random sampling in seven metropolitan areas in Korea. Respondents were chosen by sampling internal on telephone book published in 2006. We surveyed from four to ten-thirty 0'clock afternoon so as to systematic sampling considering respondents' life cycle. 2.2 Two-step cluster Analysis Our study is accomplished through the use of a two-step cluster method to classify the accommodation in a reduced number of groups, so that each group constitutes a type. This method had been suggested as appropriate in clustering large data sets with mixed attributes. The method is based on a distance measure that enables data with both continuous and categorical attributes to be clustered. This is derived from a probabilistic model in which the distance between two clusters in equivalent to the decrease in log-likelihood function as a result of merging. 2.3 Multinomial Logit Analysis The estimation of a Multionmial Logit model determines the characteristics of tourist who is most likely to opt for each type of accommodation. The Multinomial Logit model constitutes an appropriate framework to explore and explain choice process where the choice set consists of more than two alternatives. Due to its ease and quick estimation of parameters, the Multinomial Logit model has been used for many empirical studies of choice in tourism. 3. Findings The auto-clustering algorithm indicated that a five-cluster solution was the best model, because it minimized the BIC value and the change in them between adjacent numbers of clusters. The accommodation establishments can be classified into five types: Traditional House, Typical Farmhouse, Farmstay house for group Tour, Log Cabin for Family, and Log Cabin for Individuals. Group 1 (Traditional House) includes mainly the large accommodation establishments, i.e. those with ondoll style room providing meals and one shower room on family tourist, of original construction style house. Group 2 (Typical Farmhouse) encompasses accommodation establishments of Ondoll rooms and each bathroom providing meals. It includes, in other words, the tourist accommodations Known as "rural houses." Group 3 (Farmstay House for Group) has accommodation establishments of Ondoll rooms not providing meals and self cooking facilities, large room size over five persons. Group 4 (Log Cabin for Family) includes mainly the popular accommodation establishments, i.e. those with Ondoll style room with on shower room on family tourist, of western styled log house. While the accommodations in this group are not defined as regards type of construction, the group does include all the original Korean style construction, Finally, group 5 (Log Cabin for Individuals)includes those accommodations that are bedroom western styled wooden house with each bathroom. First Multinomial Logit model is estimated including all the explicative variables considered and taking accommodation group 2 as base alternative. The results show that the variables and the estimated values of the parameters for the model giving the probability of each of the five different types of accommodation available in rural tourism village in Korea, according to the socio-economic and trip related characteristics of the individuals. An initial observation of the analysis reveals that none of variables income, the number of journey, distance, and residential style of house is explicative in the choice of rural accommodation. The age and accompany variables are significant for accommodation establishment of group 1. The education and rural residential experience variables are significant for accommodation establishment of groups 4 and 5. The expenditure and marital status variables are significant for accommodation establishment of group 4. The gender and occupation variable are significant for accommodation establishment of group 3. The loyalty variable is significant for accommodation establishment of groups 3 and 4. The study indicates that significant differences exist among the individuals who choose each type of accommodation at a destination. From this investigation is evident that several profiles of tourists can be attracted by a rural destination according to the types of existing accommodations at this destination. Besides, the tourist profiles may be used as the basis for investment policy and promotion for each type of accommodation, making use in each case of the variables that indicate a greater likelihood of influencing the tourist choice of accommodation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.2
• /
• pp.405-413
• /
• 2016

In this paper, we propose a proactive inference method of finding suspicious domains. Our method detects potential malicious domains from the seed domain information extracted from the TLD Zone files and WHOIS information. The inference process follows the three steps: searching the candidate domains, machine learning, and generating a suspicious domain pool. In the first step, we search the TLD Zone files and build a candidate domain set which has the same name server information with the seed domain. The next step clusters the candidate domains by the similarity of the WHOIS information. The final step in the inference process finds the seed domain's cluster, and make the cluster as a suspicious domain set. In experiments, we used .COM and .NET TLD Zone files, and tested 10 seed domains selected by our analysts. The experimental results show that our proposed method finds 55 suspicious domains and 52 true positives. F1 scores 0.91, and precision is 0.95 We hope our proposal will contribute to the further proactive malicious domain blacklisting research.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.1-8
• /
• 2018

K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, this method has the limitation to be used with fixed number of clusters because of only considering the intra-cluster distance to evaluate the data clustering solutions. Silhouette is useful and stable valid index to decide the data clustering solution with number of clusters to consider the intra and inter cluster distance for unsupervised data. However, this valid index has high computational burden because of considering quality measure for each data object. The objective of this paper is to propose the fast and simple speed-up method to overcome this limitation to use silhouette for the effective large-scale data clustering. In the first step, the proposed method calculates and saves the distance for each data once. In the second step, this distance matrix is used to calculate the relative distance rate ($V_j$) of each data j and this rate is used to choose the suitable number of clusters without much computation time. In the third step, the proposed efficient heuristic algorithm (Group search optimization, GSO, in this paper) can search the global optimum with saving computational capacity with good initial solutions using $V_j$ probabilistically for the data clustering. The performance of our proposed method is validated to save significantly computation time against the original silhouette only using Ruspini, Iris, Wine and Breast cancer in UCI machine learning repository datasets by experiment and analysis. Especially, the performance of our proposed method is much better than previous method for the larger size of data.

• Publications of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.393-395
• /
• 2015

Weak gravitational lensing is an efficient technique for detecting galaxy clusters and probing their mass distribution. We present a weak gravitational lensing analysis of a large sample of galaxy clusters. We have built a nearly complete sample of 50 optically rich clusters, located in the redshift range 0.1 < z < 0.6 and observed in the Canada France Hawaii Telescope Legacy Survey (CFHT-LS). We used weak gravitational lensing to measure, for each galaxy cluster, the density radial profile, the total mass and the mass-to-light ratio (by comparing with the total luminosity of the member galaxies). This project is a preliminary step towards the next analysis of the weak lensing galaxy clusters in the surveys KiDS and VOICE, which are currently collecting data with the VLT Survey Telescope, in Chile.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.57.1-57.1
• /
• 2021

K-SIM (KASI-Simulation) research project is dedicated to develop new numerical techniques in order to theoretically study galaxy formation and evolution. As the first step of the K-SIM, to model tidal stripping of galaxies with a very high resolution in a fully cosmological context, we invented the Galaxy Replacement Technique (GRT) that is very efficient and fast. The high resolution allows us to accurately resolve the tidal stripping process and well describe the formation of ultra-low surface brightness features in the galaxy cluster (㎶ < 32 mag/arcsec^2), such as the intra-cluster light, shells and tidal streams. I'll introduce how the GRT is designed and which science topics in low-surface brightness regime can be visited using the GRT.

• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.3
• /
• pp.166-171
• /
• 2023

Efficient energy management is a very important factor in sensor networks with limited resources, and cluster techniques have been studied a lot in this respect. However, a problem may occur in which energy use of the cluster header is concentrated, and when the cluster header is not evenly distributed over the entire area but concentrated in a specific area, the transmission distance of the cluster members may be large or very uneven. The transmission distance can be directly related to the problem of energy consumption. Since the energy of a specific node is quickly exhausted, the lifetime of the sensor network is shortened, and the efficiency of the entire sensor network is reduced. Thus, balanced energy consumption of sensor nodes is a very important research task. In this study, factors for balanced energy consumption by cluster headers and sensor nodes are analyzed, and a balancing distribution clustering method in which cluster headers are balanced distributed throughout the sensor network is proposed. The proposed cluster method uses multi-hop routing to reduce energy consumption of sensor nodes due to long-distance transmission. Existing multi-hop cluster studies sets up a multi-hop cluster path through a two-step process of cluster setup and routing path setup, whereas the proposed method establishes a hierarchical cluster routing path in the process of selecting cluster headers to minimize the overhead of control messages.