• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.11
• /
• pp.45-54
• /
• 2008

In this paper, we use particle swarm optimization (PSO) to design a randomly excited and randomly spaced linear array with either the lowest side lobe level (SLL) or the narrowest beamwidth. The positions and the excitation amplitudes of the array elements are considered as variables to be controlled. The beam pattern is optimized by controlling the two variables simultaneously and randomly. The best beam patterns are obtained using PSO in the fitness function where performance is improved by the random assignment of weight coefficients to each angular sector of the beam Pattern. The weight coefficients and angles are obtained through several trial runs. Also, an extra term, ${\beta}{\ast}BW$, is added to the fitness function to account for the beamwidth as well as the SLL. Is produces the best result for the beam pattern with either the lowest SLL or the narrowest beamwidth. In the former case, the SLL and beamwidth are about -43dB and $32.2^{\circ}$, respectively, with only 10 elements. In the latter case, the SLL and beamwidth are about -26dB and $24.2^{\circ}$, respectively.

• The Korean Journal of Applied Statistics
• /
• v.23 no.1
• /
• pp.13-28
• /
• 2010

Assuming a mixture distribution for credit evaluation studies, we discuss estimating threshold methods to minimize errors that default borrowers are predicted as non defaults or non defaults are regarded as defaults. A method by using statistical hypotheses tests, the most powerful test and generalized likelihood ratio test, for the probability density functions which are defined with the score random variable and the parameter space consisted of only two elements such as the default and non default states is proposed to estimate a threshold. And anther optimal thresholds to maximize classification accuracy measures of the accuracy and the true rate for ROC and CAP curves are estimated as equations related with these probability density functions. Three kinds of optimal thresholds in terms of the hypotheses testing, the accuracy and the true rate are obtained from normal random samples with various means and variances. The sums of the type I and type II errors corresponding to each optimal threshold are obtained and compared. Finally we discuss about their efficiency and derive conclusions.

• Journal of Forest and Environmental Science
• /
• v.25 no.2
• /
• pp.93-100
• /
• 2009

In Malaysia, Labisia pumila Benth & Hook f, popularly known as 'Kacip Fatimah' has been used traditionally to treat various elements of the woman's health in Malay community. The objective of this study was to develop randomly amplified polymorphic DNA (RAPD) based DNA markers for the identification of L. pumila and to distinguish its three varieties from each other. Total DNA from nine accessions of L. pumila was extracted by CTAB method and polymerase chain reactions (PCR) were carried out to amplify the segments of DNA using different primers to develop DNA barcode using RAPD technique. To find out variety-specific DNA marker/s, twenty different 10-mer primer sequences with annealing temperature from 36-$40^{\circ}C$ were evaluated in triplicate. Out of 20 random primers, two primers (OPA-1 and OPA-2/A10) were selected which produced reliable RAPD band patterns. To have DNA based handle, two RAPD amplification products were cloned and sequenced to determine the identity of the DNA. RAPD analysis using two random primers generated 72 discrete bands ranging in size 200 bp-3,000 bp. Fifty nine of these were polymorphic loci (82%) and thirteen were non-polymorphic loci (18%). A total of 32 bands polymorphic loci (72%) were amplified with primer OPA-1 and analyzed by cluster analysis and UPGMA (Unweighted Pair Group Method with Arithmetic) to present a dendogram depicting the degree of genetic relationship among nine accessions of L. pumila. Our results shows the reasonable genetic diversity among the L. pumila varieties and within varieties; and two RAPD marker sequences obtained could be used to identify L. pumila at species level.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1550-1556
• /
• 1997

In this paper, we apply the evolutionary algorithm to the combinatorial optimization problem. Evolutionary algorithm useful for the optimization of the large space problem. This paper propose a method for the reuse of wastes of light water in atomic reactor system. These wastes contain several reusable elements, and they should be carefully selected and blended to satisfy requirements as an input material to the heavy water atomic reactor system. This problem belongs to an NP-hard like the 0/1 knapsack problem. Two evolutionary strategies are used as approximation algorithms in the highly constrained combinatorial optimization problem. One is the traditional strategy, using random operator with evaluation function, and the other is heuristic based search that uses the vector operator reducing between goal and current status. We also show the method which perform the feasible test and solution evaluation by using the vectored knowledge in problem domain. Finally, We compare the simulation results of using random operator and vector operator for such combinatorial optimization problems.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.37-44
• /
• 2006

In this paper, a new version of the ICM method(MICM, modified ICM) in which the contextual information is modelled by Markov random fields (MRF) is introduced. To extract the feature, a new local MRF model with a fitting block neighbourhood is proposed. This model selects contextual information not only from the relative intensity levels but also from the geometrically directional position of neighbouring cliques. Feature extraction depends on each block's contribution to the local variance. They discriminates it into several regions, for example context and background. Boundaries between these regions are also distinctive. The proposed algerian performs segmentation using directional block fitting procedure which confines merging to spatially adjacent elements and generates a partition such that pixels in unified cluster have a homogeneous intensity level. From experiment with ink rubbed copy images(Takbon, 拓本), this method is determined to be quite effective for feature identification. In particular, the new algorithm preserves the details of the images well without over- and under-smoothing problem occurring in general iterated conditional modes (ICM). And also, it may be noted that this method is applicable to the handwriting recognition.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.144-152
• /
• 1996

In this paper, a pulse-mode digital multilayer neural network with a massively parallel yet compact and flexible network architecture is presented. Algebraicneural operations are replaced by stochastic processes using pseudo-random pulse sequences and simple logic gates are used as basic computing elements. The distributions of the results from the stochastic processes are approximated using the hypergeometric distribution. A statistical model of the noise(error) is developed to estimate the relative accuracy associated with stochastic computing in terms of mean and variance. Numerical character recognition problems are applied to the network to evaluate the network performance and to justify the validity of analytic results based on the developed statistical model. The network architectures are modeled in VHDL using the mixed descriptions of gate-level and register transfer level (RTL). Experiments show that the statistical model successfully predicts the accuracy of the operations performed in the network and that the character classification rate of the network is competitive to that of ordinary Back-Propagation networks.

• The Journal of the Korea Contents Association
• /
• v.16 no.4
• /
• pp.644-654
• /
• 2016

The purpose of this study was to identify the elements of virtuous cycle to lay a foundation for the coevolution of corporations(organizations) and communities through corporate growth and distribution based on the social capital of social enterprises. The study aimed to categorize social capital into structural, cognitive, and relational capital and examine their effects on the economic and social performance of social enterprises. The subject companies include 250 of social enterprises registered at and certified by the Korea Social Enterprise Promotion Agency through random sampling. The study set two hypotheses and 6 particular hypotheses and performed correlation and regression analysis to empirically analyze the effects of social capital on social enterprise performance. The findings were summarized as follows: First, the study looked into the effects of social capital on economic performance and found that relational capital was proper for it. Second, the study also looked into the effects of social capital on social performance and found that relational capital was proper for it.

• Journal of Wetlands Research
• /
• v.17 no.4
• /
• pp.402-406
• /
• 2015

This study aims at favorable environmental conditions by river otter residing in Hongcheon river ecosystems using spraints along the river. Otter spraints were indicative of habitat use pattern and marking a territory in the areas. Nae-chon and Kuneob-chon river otter spraints were collected totaling 478 with 8 times during 2009-2011, and based on the number river use patterns were analyzed with the technique of index of dispersion. Results with larger than one indicated that river otter habitat use pattern were not random; instead they used preferred areas for habitat use. 'I' values greater than one indicate a clumped distribution and lower than one indicate random distribution. This study also demonstrated that we need a sophiscated linear model that should be developed to identify key habitat elements in river ecosystems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.569-580
• /
• 2003

One of the important advantages of multichannel switches is the incorporation of inherent fault tolerance into the switching fabric. For example, if a link which belongs to the multichannel group fails, the remaining links can assume responsibility for some of the traffic on the failed link. On the other hand, if faults occur in the switching elements, it can lead to erroneous routing and sequencing in the multichannel switch. We investigate several fault localization algorithms in multichannel crossbar ATM switches with a view to early fault recovery, The optimal algorithm gives the best performance in terms of time to localization but is computationally complex which makes it difficult to implement. We develop an on-line algorithm which is computationally mote efficient than the optimal algorithm. We evaluate its performance through simulation. The simulation results show that performance of the on line algorithm is only slightly sub-optimal for both random and bursty traffic. Finally a fault recovery algorithm is described which utilizes the information provided by the fault localization algorithm.

• Journal of Intelligence and Information Systems
• /
• v.3 no.2
• /
• pp.1-9
• /
• 1997

These papers propose an evolutionary algorithm for re-using output of waste fuel of light water reactor system in nuclear power plants. Evolutionary algorithm is useful for optimization of the large space problem. The wastes contain several re-useable elements, and they should be carefully selected and blended to satisfy requirements as input material to the heavy water nuclear reactor system. This problem belongs to a NP-hard like the 0/1 Knapsack problem. Two evolutionary strategies are used as a, pp.oximation algorithms in the highly constrained combinatorial optimization problem. One is the traditional strategy, using random operator with evaluation function, and the other is heuristic based search that uses the vector operator reducing between goal and current status. We also show the method, which performs the feasible teat and solution evaluation by using the vectorized data in problem. Finally, We compare the simulation results of using random operator and vector operator for such combinatorial optimization problems.