• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.4
• /
• pp.473-479
• /
• 2018

Objective: The study was designed to perform a genome-wide association (GWA) and partitioning of genome using Illumina's PorcineSNP60 Beadchip in order to identify variants and determine the explained heritability for the total number of teats in Yorkshire pig. Methods: After screening with the following criteria: minor allele frequency, $MAF{\leq}0.01$; Hardy-Weinberg equilibrium, $HWE{\leq}0.000001$, a pair-wise genomic relationship matrix was produced using 42,953 single nucleotide polymorphisms (SNPs). A genome-wide mixed linear model-based association analysis (MLMA) was conducted. And for estimating the explained heritability with genome- or chromosome-wide SNPs the genetic relatedness estimation through maximum likelihood approach was used in our study. Results: The MLMA analysis and false discovery rate p-values identified three significant SNPs on two different chromosomes (rs81476910 and rs81405825 on SSC8; rs81332615 on SSC13) for total number of teats. Besides, we estimated that 30% of variance could be explained by all of the common SNPs on the autosomal chromosomes for the trait. The maximum amount of heritability obtained by partitioning the genome were $0.22{\pm}0.05$, $0.16{\pm}0.05$, $0.10{\pm}0.03$ and $0.08{\pm}0.03$ on SSC7, SSC13, SSC1, and SSC8, respectively. Of them, SSC7 explained the amount of estimated heritability along with a SNP (rs80805264) identified by genome-wide association studies at the empirical p value significance level of 2.35E-05 in our study. Interestingly, rs80805264 was found in a nearby quantitative trait loci (QTL) on SSC7 for the teat number trait as identified in a recent study. Moreover, all other significant SNPs were found within and/or close to some QTLs related to ovary weight, total number of born alive and age at puberty in pigs. Conclusion: The SNPs we identified unquestionably represent some of the important QTL regions as well as genes of interest in the genome for various physiological functions responsible for reproduction in pigs.

• International Journal of Computer Science & Network Security
• /
• v.22 no.5
• /
• pp.17-24
• /
• 2022

Hierarchical clustering methods have been proposed for more than sixty years and yet are used in various disciplines for relation observation and clustering purposes. In 1965, divisive hierarchical methods were proposed in biological sciences and have been used in various disciplines such as, and anthropology, ecology. Furthermore, recently hierarchical methods are being deployed in economy and energy studies. Unlike most clustering algorithms that require the number of clusters to be specified by the user, hierarchical clustering is well suited for situations where the number of clusters is unknown. This paper presents an overview of the hierarchical clustering algorithm. The dissimilarity measurements that can be utilized in hierarchical clustering algorithms are discussed. Further, the paper highlights the various and recent disciplines where the hierarchical clustering algorithms are employed.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.338-345
• /
• 2020

Versatile Video Coding (VVC), which has been developing as a next generation video coding standard, has adopted various techniques to achieve more than twice the compression performance of HEVC (High Efficiency Video Coding). The recently released VVC Test Model (VTM) shows 38% Bjontegaard Delta bitrate (BD-rate) improvement and 9x/1.6x encoding/decoding complexity over HEVC. In order to reduce such increased complexity, various fast algorithms have been proposed. In this paper, gradient-based methods of fast intra mode decision and block splitting are presented. Experimental results show that, compared to VTM6.0, the proposed method gives up to 65% encoding time reduction with 3.54% BD-rate loss in All-Intra (AI) configuration.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.1
• /
• pp.39-48
• /
• 1999

An economic procedure of selective assembly is proposed when a product is composed of two mating components. The major qualify characteristic of the product is the clearance between the two components. The components are divided into several classes prior to assembly. The component characteristics are assumed to be independently and normally distributed with equal variance. The procedure is designed so that the proportions of both components in their corresponding classes are the same. A cost model is developed based on a quadratic loss function and methods of obtaining the optimal class limits as well as the optimal number of classes are provided. Formulas for obtaining the proportion of rejection and the unavailability of mating components are also provided. The proposed model is compared with the equal width and the equal area partitioning methods using a numerical example.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.1-11
• /
• 1999

This paper introduces orthogonally multiplexed modulation and demodulation methods based on Wavelet Packet Bases and particularly describes Wavelet Packet Modulation (WPM) techniques that provide the designer of transmission signal set in time-frequency domain with tree structural information which can be adapted to given channel characterristics. Multi-dimensional signaling methods are also contrasted to common and different characteristics of conventional QAM. multi-tone modulation methods. The paper addresses the mothod how to find a best tree structure that has more adaptivity to impulse and narrowband tone pulse noises using a tunning algorithm which arbitrarily partitions the time-frequency space and makes a suitable orthogonal signaling waveforms. Simulation results exhibits a favorable performance over existing mod/demod methods specially for narrowband tone pulse and impulse interferences.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.68-77
• /
• 2006

In accommodating the asymmetric traffic for future wireless multimedia services, the dynamic time division duplexing (D-TDD) scheme is considered as one of the key solutions. With the D-TDD mode, however, the inter-BS and inter-MS interference is inevitable during the cross time slot (CTS) period, and this interference seriously degrades the system performance. To mitigate such interference, we propose a region and time partitioning D-TDD architecture for OFDM systems. Each time slot in the CTS period is split into several minislots, and then each cell is divided into as many regions as the number of minislots per time slot. We then assign the minislots only to the users in its predefined corresponding region. On top of such architecture which inherently separates the interfering entities farther from each other, we design a robust time slot allocation scheme so that the inter-cell interference can be minimized. By the computer simulation, it has been verified that the proposed scheme outperforms the conventional time slot allocation methods in both the outage probability and the bandwidth efficiency.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.9
• /
• pp.335-344
• /
• 2018

The power model is needed to handle the power consumption of mobile AMOLED display at the software level. However, the existing studies to generate the power model have required the experimental environment and equipment for the power measurement activity. In addition, the combination of RGB values used for modeling was imprudent and small, so it was difficult to reflect the mutual influence between the RGB values into the model. To solve these problems, we propose an RGB color space partitioning method, which is used to prudently sample the combinations of the RGB values based on the color or the power. We also propose a process for generating a mapping table composed of . We analyzed the characteristics of the samples generated according to the proposed partitioning methods, taking into account the color and the power, and generated the mapping table for the AMOLED display. Furthermore, we confirmed the reusability of the mapping table by utilizing one mapping table multiple times in evaluating different power models. These mapping tables are provided to researchers and can be used to generate and evaluate power models without power measurement activities.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2009

In this paper, a new adaptive vertex clustering using a KD-tree is presented for 3D mesh partitioning. A vertex clustering is used to divide a huge 3D mesh into several partitions for various mesh processing. An octree-based clustering and K-means clustering are currently leading techniques. However, the octree-based methods practice uniform space divisions and so each partitioned mesh has non-uniformly distributed number of vertices and the difference in its size. The K-means clustering produces uniformly partitioned meshes but takes much time due to many repetitions and optimizations. Therefore, we propose to use a KD-tree to efficiently partition meshes with uniform number of vertices. The bounding box region of the given mesh is adaptively subdivided according to the number of vertices included and dynamically determined axis. As a result, the partitioned meshes have a property of compactness with uniformly distributed vertices.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1256-1265
• /
• 2003

Content Delivery Network(CDN) is a mechanism to deliver multimedia content to end users on behalf of web content providers. Provider's content is distributed from content server to a set of delivery platforms located at Internet Service Providers(ISPs) through the CDN in order to realize better performance and availability than the system of centralized provider's servers. Existing work on CDN has primarily focused on techniques for efficiently multicasting the content from content server to the delivery platforms or to end users. Multimedia contents usually require broader bandwidth and accordingly WDM broadcast network has been highly recommended for the infrastructure network of CDN. In this paper, we propose methods for partitioning a multicast group into smaller subgroups using the previous status of receivers. Through the computer simulation, we show that proposed algorithm are useful to reduce the average receiver's waiting time and the number of transmissions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.3
• /
• pp.263-269
• /
• 2003

This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3D) irreversible integer wavelet transform. We offer an application of the Set Partitioning in Hierarchical Trees(SPIHT) algorithm〔l-3〕to medical images, using a 3-D wavelet decomposition and a 3-D spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method, where careful scaling and truncations keep the integer precision small and the transform unitary. As the compression rate increases, the boundaries between adjacent coding units become increasingly visible. Unlike video, the volume image is examined under static condition, and must not exhibit such boundary artifacts. In order to eliminate them, we utilize overlapping at axial boundaries between adjacent coding units. We have tested our encoder on medical images using different integer filters. Results show that our algorithm with certain filters performs as well. The improvement is visibly manifested as fewer ringing artifacts and noticeably better reconstruction of low contrast.