• Korean Architects
• /
• s.633
• /
• pp.68-75
• /
• 2022

• Korean Architects
• /
• s.638
• /
• pp.68-73
• /
• 2022

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.354-362
• /
• 2012

Recently, High Efficiency Video Coding (HEVC) is under development jointly by MPEG and ITU-T for the next international video coding standard. Compared to the previous standards, HEVC supports variety of splitting units, such as coding unit (CU), prediction unit (PU), and transform unit (TU). Among them, it has been known that the recursive quadtree structure of CU can improve the coding efficiency while the encoding complexity is increased significantly. In this paper, a simple conditional probability to predict the early termination condition of recursive unit structure is introduced. The proposed conditional probability is estimated based on Bayes' formula from local statistics of rate-distortion costs in encoder. Experimental results show that the proposed method can reduce the total encoding time by about 32% according to the test configuration while the coding efficiency loss is 0.4%-0.5%. In addition, the encoding time can be reduced by 50% with 0.9% coding efficiency loss when the proposed method was used jointly with HM4.0 early CU termination algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.11-25
• /
• 2012

We present the method to infer Context-Free Grammars by applying genetic algorithm to the Binary Third-order Recurrent Neural Networks(BTRNN). BTRNN is a multiple-layered architecture of recurrent neural networks, each of which is corresponding to an input symbol, and is combined with external stack. All parameters of BTRNN are represented as binary numbers and each state transition is performed with any stack operation simultaneously. We apply Genetic Algorithm to BTRNN chromosomes and obtain the optimal BTRNN inferring context-free grammar of positive and negative input patterns. This proposed method infers BTRNN, which includes the number of its states equal to or less than those of existing methods of Discrete Recurrent Neural Networks, with less examples and less learning trials. Also BTRNN is superior to the recent method of chromosomes representing grammars at recognition time complexity because of performing deterministic state transitions and stack operations at parsing process. If the number of non-terminals is p, the number of terminals q, the length of an input string k, and the max number of BTRNN states m, the parallel processing time is O(k) and the sequential processing time is O(km).

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.665-679
• /
• 2002

The fault diameter of a graph G is the maximum of lengths of the shortest paths between all two vertices when there are $\chi$(G) - 1 or less faulty vertices, where $\chi$(G) is connectivity of G. In this paper, we analyze the fault diameter of recursive circulant $G(2^m,2^k)$ with $k{\geq}3$. Let $ dia_{m.k}$ denote the diameter of $G(2^m,2^k)$. We show that if $2{\leq}m,2{\leq}k, the fault diameter of $G(2{\leq}m,2{\leq}k)$ is equal to $2^m-2$, and if m=k+1, it is equal to $2^k-1$. It is also shown that for m>k+1, the fault diameter is equal to di a_$m{\neq}1$(mod 2k); otherwise, it is less than or equal to$dia_{m.k+2}$.

• Elastomers and Composites
• /
• v.46 no.4
• /
• pp.277-283
• /
• 2011

In this study, engineering grade and high intensity reflective sheets were prepared with glass beads and their reflection performance and physical properties were investigated. The reflective sheets prepared by using glass beads are divided into enclosed or encapsulated lens type, depending on whether the glass beads are open in air or not. Because of an extra layer on the glass bead surface, the enclosed lens type reflective sheets show very little change in the properties by bad weather conditions, compared to encapsulated lens type reflective sheets. Optimization of the amount of glass beads on the surface was carried out, which determines the retroreflective properties. Enclosed and encapsulated lens type reflective sheets with various colors were prepared and their coefficients of retroreflection were determined. The encapsulated type reflective sheet with white color shows a coefficient of retroreflection of $210.4cd/1x{\cdot}m^2$, which is higher than the enclosed type ($74cd/1x{\cdot}m^2$). Effect of washing on the reflective property and adhesive power of the reflective sheets was investigated, and it is found that the number of glass beads decreased with washing and the aluminum layer deposited was damaged extensively in the encapsulated lens type reflective sheets.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.107-123
• /
• 2006

We propose the Generalized Binary Second-order Recurrent Neural Networks(GBSRNNf) being equivalent to regular grammars and ?how the implementation of lexical analyzer recognizing the regular languages by using it. All the equivalent representations of regular grammars can be implemented in circuits by using GSBRNN, since it has binary-valued components and shows the structural relationship of a regular grammar. For a regular grammar with the number of symbols m, the number of terminals p, the number of nonterminals q, and the length of input string k, the size of the corresponding GBSRNN is $O(m(p+q)^2)$ and its parallel processing time is O(k) and its sequential processing time, $O(k(p+q)^2)$.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.86-94
• /
• 2004

In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3069-3077
• /
• 1997

This paper is concerned with a new paradigm for parallel evaluation of linear recursion rules which contain transitive dependency in a shared-nothing parallel architecture. For parallel evaluation of rules, we consider a shared-nothing parallel architecture that consists of a set of nodes and a message passing network to these nodes. An evaluation of normalized rules is a computation of the proof theoretic meaning of a collection of rules. We shall here define normalized recursion rules which contain transitive dependency, present an equivalent expression for the rule, propose a paradigm for Parallel evaluation of normalized rule based on the equivalent expression using join, partition, and transitive closure operations, and analyze response-time complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.691-698
• /
• 2003

In this paper, we propose a problem, called one-to-one disjoint path cover problem, whether or not there exist k disjoint paths joining a pair of vertices which pass through all the vertices other than the two exactly once. A graph which for an arbitrary k, has a one-to-one disjoint path cover between an arbitrary pair of vertices has a hamiltonian property stronger than hamiltonian-connectedness. We investigate this problem on recursive circulants and prove that for an arbitrary k $k(1{\leq}k{\leq}m)$$ G(2^m,4)$,$m{\geq}3$, has a one-to-one disjoint path cover consisting of k paths between an arbitrary pair of vortices.