• Asian-Australasian Journal of Animal Sciences
• /
• v.14 no.3
• /
• pp.302-306
• /
• 2001

This study was carried out to construct mapping population and to evaluate the methods involved, including polymorphic DNA marker system and appropriate statistical analysis. As an initial step to establish chicken genome mapping project, White Leghorn (WL) and Korean Ogol chicken (KOC) were used for generating backcross population. From 8 initial parents, total 280 backcross progenies were obtained and 40 were used for genotyping and linkage analysis. For development of novel polymorphic markers for KOC, Random Amplified Polymorphic DNA (RAPD) markers specific for this chicken line were generated. Also included in this study were six microsatellite markers from East Lansing map as reference loci. For segregation analysis, 15 RAPD markers and 6 microsatellites were used to genotype the backcross population. Among the RAPD markers that we developed, 2 pairs of markers were identified to be linked and another 4 RAPD markers showed linkage with microsatellites of known map. In summary, this study showed that our backcross population generated from the mating of KOC to WL serves as a valuable genetic resource for genotyping. Furthermore, RAPD markers are proved to be valuable in linkage mapping analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.432-438
• /
• 2010

In this paper we study the effect of bit-to-symbol mappings on the convergence behavior of turbo equalizers employing low-density parity-check (LDPC) codes over high order modulations. We analyze the effective SNR of the outputs from linear minimum mean-squared error (MMSE) equalizers and the convergence property of LDPC decoding for different symbol mappings. Numerical results show that the bit-reliability (BR) mapping provides better performance than random mapping in LDPC-coded turbo equalizers over high order modulations. We also verify the effect of symbol mappings through the noise threshold and error performance.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.15 no.2
• /
• pp.91-106
• /
• 1997

The new algorithm for halftone generation for gravure engraving was developed. The basic concept of this algorithm is based on the mapping and equal density expansion methods that we are mapped out. The program was used by the Microsoft Visiul C++2.0 and could be loaded in IBM personal computer.

• 한국연소학회:학술대회논문집
• /
• 2004.06a
• /
• pp.102-111
• /
• 2004

Partial quenching structure of turbulent diffusion flames in a turbulent mixing layer is investigated by the method of flame hole dynamics to develope a prediction model for the turbulent lift off. The present study is specifically aimed to remedy the problem of the stiff transition of the conditioned partial burning probability across the crossover condition by adopting level-set method which describes propagating or retreating flame front with specified propagation speed. In light of the level-set simulations with two model problems for the propagation speed, the stabilizing conditions for a turbulent lifted flame are suggested. The flame hole dynamics combined with level-set method yields a temporally evolving turbulent extinction process and its partial quenching characteristics is compared with the results of the previous model employing the flame-hole random walk mapping. The probability to encounter reacting' state, conditioned with scalar dissipation rate, demonstrated that the conditional probability has a rather gradual transition across the crossover scalar dissipation rate in contrast to the stiff transition of resulted from the flame-hole random walk mapping and could be attributed to the finite response of the flame edge propagation.

• Structural Engineering and Mechanics
• /
• v.77 no.2
• /
• pp.231-243
• /
• 2021

In this paper, a dynamic response mapping model of the wheel-rail system is established by using the support vector regression (SVR) method, and the hierarchical safety thresholds of the subgrade void are proposed based on the reliability theory. Firstly, the vehicle-track coupling dynamic model considering the subgrade void is constructed. Secondly, the subgrade void area, the subgrade compaction index K30 and the fastener stiffness are selected as random variables, and the mapping model between these three random parameters and the dynamic response of the wheel-rail system is built by using the orthogonal test and the SVR. The sensitivity analysis is carried out by the range analysis method. Finally, the hierarchical safety thresholds for the subgrade void are proposed. The results show that the subgrade void has the most significant influence on the carbody vertical acceleration, the rail vertical displacement, the vertical displacement and the slab tensile stress. From the range analysis, the subgrade void area has the largest effect on the dynamic response of the wheel-rail system, followed by the fastener stiffness and the subgrade compaction index K30. The recommended safety thresholds for the subgrade void of level I, II and III are 4.01㎡, 6.81㎡ and 9.79㎡, respectively.

• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.395-407
• /
• 2010

In this paper, we prove the generalized Hyers-Ulam stability of the following quadratic functional equations $$cf\(\sum_{i=1}^{n}x_i\)+\sum_{j=2}^{n}f\(\sum_{i=1}^{n}x_i-(n+c-1)x_j\)\\=(n+c-1)\(f(x_1)+c\sum_{i=2}^{n}f(x_i)+\sum_{i<j,j=3}^{n}\(\sum_{i=2}^{n-1}f(x_i-x_j\)\),\\Q\(\sum_{i=1}^{n}d_ix_i\)+\sum_{1{\leq}i<j{\leq}n}d_id_jQ(x_i-x_j)=\(\sum_{i=1}^{n}d_i\)\(\sum_{i=1}^{n}d_iQ(x_i)\)$$ in random normed spaces.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.12
• /
• pp.1675-1683
• /
• 2005

In the process of crossbreeding, the linkage disequilibria between the quantitative trait loci (QTL) and their linked markers were reduced gradually with increasing generations. To study the potential of QTL mapping using the crossbred population, we presented a mixed effect model that treated the mean allelic value of the different founder populations as the fixed effect and the allelic deviation from the population mean as random effect. It was assumed that there were fifty QTLs having effect on the trait variation, the population mean and variance were divided to each QTL in founder generation in our model. Only the additive effect was considered in this model for simulation. Six schemes (S1-S6) of crossbreeding were studied. The selection index was used to evaluate the synthetic breeding value of two traits of the individual in the scheme of S2, S4 and S6, and the individuals with high selection index were chosen as the parents of the next generation. Random selection was used in the scheme of S1, S3 and S5. In this study, we premised a QTL explained 40% of the genetic variance was located in a region of 20 cM by the linkage analysis previously. The log likelihood ratio (log LR) was calculated to determine the presence of a QTL at the particular chromosomal position in each of the generations from the fourth to twentieth. The profiles of log LR and the number of the highest log LR located in the region of 5, 10 and 20 cM were compared between different generations and schemes. The profiles and the correct number reduced gradually with the generations increasing in the schemes of S2, S4 and S6, but both of them increased in the schemes of S1, S3 and S5. From the results, we concluded that the crossbreeding population undergoing random selection was suitable for improving the resolution of QTL mapping. Even experiencing index selection, there was still enough variation existing within the crossbred population before the fourteenth generation that could be used to refine the location of QTL in the chromosome region.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.3
• /
• pp.41-48
• /
• 2010

Photon mapping is a traditional global illumination method using many photons emitted from the light source for photo-realistic rendering. However, this method needs a lot of resources to perform tracing of millions of photons. Progressive photon mapping solves this problem. Typical progressive photon mapping performs ray tracing at first to find the hit points on diffuse surface of objects. Next, light source repeatedly emits a small number of photons in photon tracing pass, and power of photons in each sphere that has a fixed radius with the hit points in the center is accumulated. This method requires less resources than previous photon mapping, but it spends much time for gathering enough photons since each of photons progresses through a random direction and rendering high quality image. To improve the method, we propose photon probing that calculates variance of photons in the sphere and controls radius of sphere. In addition, we apply cone filter in radiance estimation step for reducing aliasing at the edges in result image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.174-177
• /
• 2016

Wireless network-on-chip (WNoC) can alleviate critical path problem of existing typical NoCs by integrating radio-frequency module on router. In this paper, core-connection-aware genetic algorithm-based core and WIR mapping methodology at small world WNoC is presented. The methodology could optimize the critical path between cores with heavy communication. The 33% of average latency improvement is achieved compared to random mapping methodology.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2311-2319
• /
• 1999

We present two heuristic algorithms for the task allocation problem (NP-complete problem) in parallel computing. The problem is to find an optimal mapping of multiple communicating tasks of a parallel program onto the multiple processing nodes of a distributed-memory multicomputer. The purpose of mapping these tasks into the nodes of the target architecture is the minimization of parallel execution time without sacrificing solution quality. Many heuristic approaches have been employed to obtain satisfactory mapping. Our heuristics are based on genetic algorithms and simulated annealing. We formulate an objective function as a total computational cost for a mapping configuration, and evaluate the performance of our heuristic algorithms. We compare the quality of solutions and times derived by the random, greedy, genetic, and annealing algorithms. Our experimental findings from a simulation study of the allocation algorithms are presented.