• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.484-492
• /
• 2016

The High efficiency video coding (HEVC) is the newest video coding standard that achieves coding efficiency higher than previous video coding standards such as H.264/AVC. In intra prediction, the prediction units (PUs) are derived from a large coding unit (LCU) which is partitioned into smaller coding units (CUs) sizing from 8x8 to 64x64 in a quad-tree structure. As they are divided until having the minimum depth, Optimum CU splitting is selected in RDO (Rate Distortion Optimization) process. In this process, HEVC demands high computational complexity. In this paper, to reduce the complexity of HEVC, we propose a fast CU mode decision (FCDD) for intra prediction by using FAST (Features from Accelerated Segment Test) corner detection. The proposed method reduces computational complexity with 53.73% of the computational time for the intra prediction while coding performance degradation with 0.7% BDBR is small compared to conventional HEVC.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.1
• /
• pp.91-103
• /
• 2006

Given a bill of materials (BOM) tree T labeled by the breadth first search (BFS) order from node 0 to node n and a general network ${\Im}=(V,A)$, where V={1,2,...,m} is the set of production facilities and A is the set of arcs representing transportation links between any of two facilities, we assume that each node of T stands for not only a component. but also a production stage which is a possible stocking point and operates under a periodic review base-stock policy, We also assume that the random demand which can be achieved by a suitable service level only occurs at the root node 0 of T and has a normal distribution $N({\mu},{\sigma}^2)$. Then our integrated model of facility location problems and safety stock optimization problem (FLP&SSOP) is to identify both the facility locations at which partitioned subtrees of T are produced and the optimal assignment of safety stocks so that the sum of production cost, inventory holding cost, and transportation cost is minimized while meeting the pre-specified service level for the final product. In this paper, we first formulate (FLP&SSOP) as a nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables. We then show that the linear programming relaxation of the reformulated model has an integrality property which guarantees that it can be optimally solved by a column generation method.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.11-18
• /
• 2005

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by $62.2\%$ than those of DDMAP. And reduced the number of CLBs by $17.6\%$ than those of TEMPLA.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.96-106
• /
• 2009

Extending the scale of the distributed processing in a single Ethernet cluster is physically restricted by maximum ports per switch. This paper presents an implementation of MPI-based multicluster consisting of multiple Ethernet switches for extending the scale of distributed processing, and a asymptotical analysis for communication overhead through execution-time analysis model. To determine an optimum task partitioning, we analyzed the processing time for various partitioning schemes, and AAP(accumulator array partitioning) scheme was finally chosen to minimize the overall communication overhead. The scope of data partitioned in AAP was modified to fit for incremented nodes, and suitable load balancing algorithm was implemented. We tried to alleviate the communication overhead through exploiting the pipelined broadcast and flat-tree based result gathering, and overlapping of the communication and the computation time. We used the linear pipeline broadcast to reduce the communication overhead in intercluster which is interconnected by a single link. Experimental results shows nearly linear speedup by the proposed parallel distributed GHT implemented on MPI-based Ethernet multicluster with four 100Mbps Ethernet switches and up to 128 nodes of Pentium PC.

• Journal of Internet Computing and Services
• /
• v.19 no.5
• /
• pp.89-96
• /
• 2018

In online communities, a large number of participants can exchange their opinion using replies without time and space restrictions. While the online space provides quick and free communication, it also easily triggers unnecessary quarrels and conflicts. The network established on the discussion participants is an important cue to analyze the confrontation and predict serious disputes. In this paper, we present a quantitative measure for polarity observed on the discussion network built from reply exchanges in online communities. The proposed method uses the comment exchange information to establish the user interaction network graph, computes its maximum spanning tree, and then performs vertex coloring to assign two colors to each node in order to divide the discussion participants into two subsets. Using the proportion of the comment exchanges across the partitioned user subsets, we compute the polarity measure, and quantify how discussion participants are bipolarized. Using experimental results, we demonstrate the effectiveness of our method for detecting polarization and show participants of a specific discussion subject tend to be divided into two camps when they debate.

• Journal of Broadcast Engineering
• /
• v.17 no.3
• /
• pp.503-518
• /
• 2012

In this paper, we propose a complexity-based parallelization method of the sample adaptive offset (SAO) algorithm which is one of HEVC in-loop filters. The SAO algorithm can be regarded as region-based process and the regions are obtained and represented with a quad-tree scheme. A offset to minimize a reconstruction error is sent for each partitioned region. The SAO of the HEVC can be parallelized in data-level. However, because the sizes and complexities of the SAO regions are not regular, workload imbalance occurs with multi-core platform. In this paper, we propose a LCU-based SAO algorithm and a complexity prediction algorithm for each LCU. With the proposed complexity-based LCU processing, we found that the proposed algorithm is faster than the sequential implementation by a factor of 2.38 times. In addition, the proposed algorithm is faster than regular parallel implementation SAO by 21%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.141-146
• /
• 2016

HEVC/H.265 is the latest joint video coding standard proposed by ITU-T SG 16 WP and ISO/IEC JTC 1/SC29/WG 11. In H.265, pictures are divided into a sequence of coding tree units(CTUs), and the CTU further is partitioned into multiple CUs to adapt to various local characteristics. Its coding efficiency is approximately two times high compared to previous standard H.264/AVC. However according to the size of extended CU(coding unit) and transform block, the hardware size of PMR(prediction/mode decision/reconstruction) block within video encoder is about 4 times larger than previous standard. In this study, we propose a new less complex hardware architecture of PMR block which has the most high complexity within encoder without any noticeable PSNR loss. Using this simplified block, we can shrink the overall size the H.265 encoder. For FHD image, it operates at clocking frequency of 300 MHz and frame rate of 60 fps. And also for the test image, the Bjøntegaard Delta (BD) bit rate increase about average 30 % in PMR prediction block, and the total estimated gate count of PMR block is around 1.8 M.

• Journal of Life Science
• /
• v.25 no.11
• /
• pp.1298-1303
• /
• 2015

Machilus thunbergii (Lauraceae) is an evergreen tree cultivated in Korea and Japan. M. thunbergii has long been used as a traditional medicine in Korea, China, and Japan to treat various diseases, including edema, abdominal pain, and abdominal distension. In this study, dried stem bark of M. thunbergii extracted in methanol and extract was partitioned into n-hexane, CHCl₃, and BuOH. The CHCl₃-soluble extracts chromatographed on silica gel column using a CHCl₃/acetone and n-hexane/EtOAc mixture to afford Compound 1 and 2. Two dibenzylbutane lignans, macelignan (1) and meso-dihydroguaiaretic acid (2), were isolated from the CHCl₃-soluble extract of M. thunbergii stem bark. The structures of 1 and 2 were determined by ¹H- and ¹³C-NMR spectroscopic data analyses and a comparison with literature data. The tyrosinase inhibitory activity of the isolated compounds was evaluated. Among these compounds, Compound 2 strongly inhibited the monophenolase (IC₅₀=10.2 μM) activity of tyrosinase. A kinetic analysis showed that Compound 2 was a competitive inhibitor. The apparent inhibition constant (K_i) for Compound 2 binding to free enzyme was 4.8 μM. Based on these results, it can be concluded that meso-dihydroguaiaretic acid (2) is a potential candidate for the treatment of melanin biosynthesis-related skin diseases.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1270-1281
• /
• 1999

피라미드 기법 1 은 d-차원의 공간을 2d개의 피라미드들로 분할하는 특별한 공간 분할 방식을 이용하여 고차원 데이타를 효율적으로 색인할 수 있는 새로운 색인 방법으로 제안되었다. 피라미드 기법은 고차원 사각형 형태의 영역 질의에는 효율적이나, 유사성 검색에 많이 사용되는 고차원 구형태의 영역 질의에는 비효율적인 면이 존재한다. 본 논문에서는 고차원 데이타를 많이 사용하는 유사성 검색에 효율적인 새로운 색인 기법으로 구형 피라미드 기법을 제안한다. 구형 피라미드 기법은 먼저 d-차원의 공간을 2d개의 구형 피라미드로 분할하고, 각 단일 구형 피라미드를 다시 구형태의 조각으로 분할하는 특별한 공간 분할 방법에 기반하고 있다. 이러한 공간 분할 방식은 피라미드 기법과 마찬가지로 d-차원 공간을 1-차원 공간으로 변환할 수 있다. 따라서, 변환된 1-차원 데이타를 다루기 위하여 B+-트리를 사용할 수 있다. 본 논문에서는 이렇게 분할된 공간에서 고차원 구형태의 영역 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 마지막으로, 인위적 데이타와 실제 데이타를 사용한 다양한 실험을 통하여 구형 피라미드 기법이 구형태의 영역 질의를 처리하는데 있어서 기존의 피라미드 기법보다 효율적임을 보인다.Abstract The Pyramid-Technique 1 was proposed as a new indexing method for high- dimensional data spaces using a special partitioning strategy that divides d-dimensional space into 2d pyramids. It is efficient for hypercube range query, but is not efficient for hypersphere range query which is frequently used in similarity search. In this paper, we propose the Spherical Pyramid-Technique, an efficient indexing method for similarity search in high-dimensional space. The Spherical Pyramid-Technique is based on a special partitioning strategy, which is to divide the d-dimensional data space first into 2d spherical pyramids, and then cut the single spherical pyramid into several spherical slices. This partition provides a transformation of d-dimensional space into 1-dimensional space as the Pyramid-Technique does. Thus, we are able to use a B+-tree to manage the transformed 1-dimensional data. We also propose the algorithm of processing hypersphere range query on the space partitioned by this partitioning strategy. Finally, we show that the Spherical Pyramid-Technique clearly outperforms the Pyramid-Technique in processing hypersphere range queries through various experiments using synthetic and real data.

• Animal Bioscience
• /
• v.36 no.7
• /
• pp.991-1002
• /
• 2023

Objective: This study aimed to elucidate the underlying gene regions responsible for productive, phenotypic or adaptive traits in different ecological types of Tibetan sheep and the discovery of important genes encoding valuable traits. Methods: We used whole-genome resequencing to explore the genetic relationships, phylogenetic tree, and population genetic structure analysis. In addition, we identified 28 representative Tibetan sheep single-nucleotide polymorphisms (SNPs) and genomic selective sweep regions with different traits in Tibetan sheep by fixation index (Fst) and the nucleotide diversity (θπ) ratio. Results: The genetic relationships analysis showed that each breed partitioned into its own clades and had close genetic relationships. We also identified many potential breed-specific selective sweep regions, including genes associated with hypoxic adaptability (MTOR, TRHDE, PDK1, PTPN9, TMTC2, SOX9, EPAS1, PDGFD, SOCS3, TGFBR3), coat color (MITF, MC1R, ERCC2, TCF25, ITCH, TYR, RALY, KIT), wool traits (COL4A2, ERC2, NOTCH2, ROCK1, FGF5, SOX9), and horn phenotypes (RXFP2). In particular, a horn-related gene, RXFP2, showed the four most significantly associated SNP loci (g. 29481646 A>G, g. 29469024 T>C, g. 29462010 C>T, g. 29461968 C>T) and haplotypes. Conclusion: This finding demonstrates the potential for genetic markers in future molecular breeding programs to improve selection for horn phenotypes. The results will facilitate the understanding of the genetic basis of production and adaptive unique traits in Chinese indigenous Tibetan sheep taxa and offer a reference for the molecular breeding of Tibetan sheep.