• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.543-545
• /
• 2003

In this study, the authors evaluate the suitability of the candidate routes selected by the route selection method, which is developed by the authors, by combination of Geographic Information Systems (GIS) and Analytic Hierarchy Process. To evaluate the suitability of the candidate routes, from the viewpoint of the residents, we have considered element factors such as, population, household, aging situation, elevation, gradient, housing density and the Control Point. The results of this study are expected to assess the suitability of the candidate routes of the hillside transportation for the residents and examine the application limit of the route selection method.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.145-154
• /
• 2015

This paper proposes an enhanced projection candidate selection algorithm to improve the performance of the existing path prediction algorithm. Various user path prediction algorithms have previously been developed, but those algorithms are inappropriate for a real-time and close user path prediction environment. To resolve this issue, a new prediction algorithm has been proposed, but several problems still remain. In particular, this algorithm should be enhanced to provide much faster processing performance. The major cause of the high processing time of the previous path prediction algorithm is the high time complexity of its projection candidate selection. Therefore, this paper proposes a new path fragment management structure and an improved projection candidate selection algorithm to improve the processing speed of the existing projection candidate selection algorithm. This paper also shows the effectiveness of the algorithm herein proposed through a comparative performance evaluation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.191-196
• /
• 2009

In this paper, we proposed a feature selection method using Binary Particle Swarm Optimization(BPSO) and Mutual information. This proposed method consists of the feature selection part for selecting candidate feature subset by mutual information and the optimal feature selection part for choosing optimal feature subset by BPSO in the candidate feature subsets. In the candidate feature selection part, we computed the mutual information of all features, respectively and selected a candidate feature subset by the ranking of mutual information. In the optimal feature selection part, optimal feature subset can be found by BPSO in the candidate feature subset. In the BPSO process, we used multi-object function to optimize both accuracy of classifier and selected feature subset size. DNA expression dataset are used for estimating the performance of the proposed method. Experimental results show that this method can achieve better performance for pattern recognition problems than conventional ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.657-667
• /
• 2012

In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.1-7
• /
• 2023

In this paper, we propose a base address candidate selection method using the $gp register and page granularity as a way to build a static analysis environment for firmware based on MIPS architecture. As a way to shorten the base address search time, which is a disadvantage of the base address candidate selection method through inductive reasoning in existing studies, this study proposes a method to perform page-level search based on the $gp register in the existing base address candidate selection method as a reference point for search. Then, based on the proposed method, a base address search tool is implemented and a static analysis environment is constructed to prove the validity of the target tool. The results show that the proposed method is faster than the existing candidate selection method through inductive reasoning.

• Journal of Animal Science and Technology
• /
• v.56 no.7
• /
• pp.23.1-23.7
• /
• 2014

Background: Scanning of the genome for selection signatures between breeds may play important role in understanding the underlie causes for observable phenotypic variations. The discovery of high density single nucleotide polymorphisms (SNPs) provide a useful starting point to perform genome-wide scan in pig populations in order to identify loci/candidate genes underlie phenotypic variation in pig breeds and facilitate genetic improvement programs. However, prior to this study genomic region under selection in commercially selected Berkshire and Korean native pig breeds has never been detected using high density SNP markers. To this end, we have genotyped 45 animals using Porcine SNP60 chip to detect selection signatures in the genome of the two breeds by using the $F_{ST}$ approach. Results: In the comparison of Berkshire and KNP breeds using the FDIST approach, a total of 1108 outlier loci (3.48%) were significantly different from zero at 99% confidence level with 870 of the outlier SNPs displaying high level of genetic differentiation ($F_{ST}{\geq}0.490$). The identified candidate genes were involved in a wide array of biological processes and molecular functions. Results revealed that 19 candidate genes were enriched in phosphate metabolism (GO: 0006796; ADCK1, ACYP1, CAMK2D, CDK13, CDK13, ERN1, GALK2, INPP1; MAK, MAP2K5, MAP3K1, MAPK14, P14KB, PIK3C3, PRKC1, PTPRK, RNASEL, THBS1, BRAF, VRK1). We have identified a set of candidate genes under selection and have known to be involved in growth, size and pork quality (CART, AGL, CF7L2, MAP2K5, DLK1, GLI3, CA3 and MC3R), ear morphology and size (HMGA2 and SOX5) stress response (ATF2, MSRB3, TMTC3 and SCAF8) and immune response (HCST and RYR1). Conclusions: Some of the genes may be used to facilitate genetic improvement programs. Our results also provide insights for better understanding of the process and influence of breed development on the pattern of genetic variations.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.164-172
• /
• 2004

For a local search algorithm to find a bettor quality solution it is required to generate and evaluate a sufficiently large number of candidate solutions as neighbors at each iteration, demanding quite an amount of CPU time. This paper presents a method of selectively generating only good-looking candidate neighbors, so that the number of neighbors can be kept low to improve the efficiency of search. In our method, a newly generated candidate solution is probabilistically selected to become a neighbor based on the quality estimation determined heuristically by a very simple evaluation of the generated candidate. Experimental results on the problem of load balancing for production scheduling have shown that our candidate selection method outperforms other random or greedy selection methods in terms of solution quality given the same amount of CPU time.

• Asian-Australasian Journal of Animal Sciences
• /
• v.14 no.4
• /
• pp.587-596
• /
• 2001

In the last decade, rapid developments in molecular biotechnology and of genomic tools have enabled the creation of dense linkage maps across whole genomes of human, plant and animals. Successful development and implementation of interval mapping methodologies have allowed detection of the quantitative trait loci (QTL) responsible for economically important traits in experimental and commercial livestock populations. The candidate gene approach can be used in any general population with the availability of a large resource of candidate genes from the human or rodent genomes using comparative maps, and the validated candidate genes can be directly applied to commercial breeds. For the QTL detected from primary genome scans, two incipient fine mapping approaches are applied by generating new recombinants over several generations or utilizing historical recombinants with identity-by-descent (IBD) and linkage disequilibrium (LD) mapping. The high resolution definition of QTL position from fine mapping will allow the more efficient implementation of breeding programs such as marker-assisted selection (MAS) or marker-assisted introgression (MAI), and will provide a route toward cloning the QTL.

• Journal of Animal Science and Technology
• /
• v.62 no.3
• /
• pp.293-305
• /
• 2020

The difference in the breeding programs and population history may have diversely shaped the genomes of Korean native cattle breeds. In the absence of phenotypic data, comparisons of breeds that have been subjected to different selective pressures can aid to identify genomic regions and genes controlling qualitative and complex traits. In this study to decipher genetic variation and identify evidence of divergent selection, 3 Korean cattle breeds were genotyped using the recently developed high-density GeneSeek Genomic Profiler F250 (GGP-F250) array. The three Korean cattle breeds clustered according to their coat color phenotypes and breeding programs. The Heugu breed reliably showed smaller effective population size at all generations considered. Across the autosomal chromosomes, 113 and 83 annotated genes were identified from Hanwoo-Chikso and Hanwoo-Heugu comparisons, respectively of which 16 genes were shared between the two pairwise comparisons. The most important signals of selection were detected on bovine chromosomes 14 (24.39-25.13 Mb) and 18 (13.34-15.07 Mb), containing genes related to body size, and coat color (XKR4, LYN, PLAG1, SDR16C5, TMEM68, CDH15, MC1R, and GALNS). Some of the candidate genes are also associated with meat quality traits (ACSF3, EIF2B1, BANP, APCDD1, and GALM) and harbor quantitative trait locus (QTL) for beef production traits. Further functional analysis revealed that the candidate genes (DBI, ACSF3, HINT2, GBA2, AGPAT5, SCAP, ELP6, APOB, and RBL1) were involved in gene ontology (GO) terms relevant to meat quality including fatty acid oxidation, biosynthesis, and lipid storage. Candidate genes previously known to affect beef production and quality traits could be used in the beef cattle selection strategies.

• 한국사회정책
• /
• v.20 no.3
• /
• pp.9-46
• /
• 2013

The degree of delegation related to the social security acts is involved in the candidate selection methods and the standing committee system. The social security acts with a small amount of delegation have an affinity with the bottom-up selection methods and the standing committee to guarantee long term in office. In Germany, the bottom-up selection method which guarantees the right of party members to nominate candidates and the standing committee to guarantee long term in office have an affinity with the Social Acts with less delegation. But the social security acts with a large number of delegation have an affinity with the top-down selection methods and the standing committee not to guarantee long term in office. In Korea, the top-down selection method in which the central headquarter of the party dominates the selection process, and the standing committee whose members are to be selected every two years have an affinity with the Social Security Acts with the excessive delegation.