• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.669-682
• /
• 2016

In this paper, we study the cellular structure of the G-edge colored partition algebras, when G is a finite group. Further, we classified all the irreducible representations of these algebras using their cellular structure whenever G is a finite cyclic group. Also we prove that the ${\mathbb{Z}}/r{\mathbb{Z}}$-Edge colored partition algebras are quasi-hereditary over a field of characteristic zero which contains a primitive $r^{th}$ root of unity.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.44-53
• /
• 2011

In this paper, we propose a 3D conversion algorithm of 2D video using depth layer partition method. In the proposed algorithm, we first set frame groups using cut detection algorithm. Each divided frame groups will reduce the possibility of error propagation in the process of motion estimation. Depth image generation is the core technique in 2D/3D conversion algorithm. Therefore, we use two depth map generation algorithms. In the first, segmentation and motion information are used, and in the other, edge directional histogram is used. After applying depth layer partition algorithm which separates objects(foreground) and the background from the original image, the extracted two depth maps are properly merged. Through experiments, we verify that the proposed algorithm generates reliable depth map and good conversion results.

• IE interfaces
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2008

In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.12 no.2
• /
• pp.150-160
• /
• 2000

Turbulent natural convective flow and heat transfer in a square enclosure with horizontal partition are investigated numerically. The enclosure is composed of a lower hot and a upper cold horizontal walls and adiabatic vertical walls. Partitions carried with the upward, downward, and both control plates are attached perpendicularly to the one of the vertical insulated walls, respectively. The low Reynolds number $k-\varepsilon$ model is adopted to calculate the turbulent thermal convection. The governing equations are solved by using the finite element method with Galerkin method. The computations have been carried out by varying the length of partition, the position of control plates, and the Rayleigh number based on the temperature difference between two horizontal walls and the enclosure height for water(Pr=4.95). When the control plates are attached at the edge of partition, the stability of oscillating flow grows wrose with the increase of Rayleigh number and the partition length. The heat transfer rate has been reducer than that of no control plate due to the restraint of control plates with the increase of Rayleigh number.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.435-440
• /
• 2006

Let G be a simple graph with vertex set V(G) and edge set E(G). A subset S of E(G) is called an edge cover of G if the subgraph induced by S is a spanning subgraph of G. The maximum number of edge covers which form a partition of E(G) is called edge covering chromatic number of G, denoted by X'c(G). It is known that for any graph G with minimum degree ${\delta},\;{\delta}-1{\le}X'c(G){\le}{\delta}$. If $X'c(G) ={\delta}$, then G is called a graph of CI class, otherwise G is called a graph of CII class. It is easy to prove that the problem of deciding whether a given graph is of CI class or CII class is NP-complete. In this paper, we consider the classification of nearly bipartite graph and give some sufficient conditions for a nearly bipartite graph to be of CI class.

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

In OFDMA-based cellular system, inter-cell interference (ICI) reduces system capacity by aggravating receiving performance of the users located in edge of the cell. Therefore, to mitigate ICI is very important issue in cellular system. To deal with ICI problem, fractional frequency reuse (FFR) is introduced. FFR is an interference management technique. It separates each cell into inner cell and outer cell. Then, it allocates whole system bandwidth to inner cell and different frequency partition to each sector of outer cell. By doing this, outer cell users can ignore interferences from adjacent cells. So, the receiving performance of the cell edge users can be fairly increased. However, using FFR technique has a fatal side effect. In order to use different frequency partition among three sectors of outer cell, they can use only a third of the whole system bandwidth. Then, the reduction of available bandwidth reduces the system throughput directly. To solve this problem, we propose a new FFR method that allocates partially overlapped frequency partition to each sector of outer cell. And then, we suggest a proper overlapping ratio for practical cellular system.

• Journal of Korea Multimedia Society
• /
• v.19 no.6
• /
• pp.990-1002
• /
• 2016

In this paper, we propose a new compression method for the edge image by analyzing the characteristics and the distribution of pixel values of the edge image. The pixel values of the edge image have the Gaussian distribution around '0', and most of the pixel values are `0`. By these analyses we suggest the Zero-Based codec that expresses all values in a CU by a single bit flag. Also, in order to reduce the computational complexity of the proposed codec, the block partition and the intra-prediction techniques are proposed by using edge information like the number of each edge direction, the distribution and the amplitude of a major edge direction in the CU. Experimental results show that the proposed codec leads to a slighter distortion in Y domain than that of HEVC, but has far faster processing speed up to 53 times while it maintains the similar image quality compared to HEVC.

• Korean Journal of Soil Science and Fertilizer
• /
• v.36 no.4
• /
• pp.200-209
• /
• 2003

Distribution coefficient ($K_d$) is an universal parameter estimating cadmium partition for a soil-water-crop system in agricultural lands. This study was performed to find some factors affecting soil-water partition coefficients for cadmium in some Korean soils. The distribution coefficients ($K_d$) of cadmium for the 15 series of agricultural soils were measured at quasi-steady state in the pH ranges from 2 to 11. The adsorption data of the selected soils showed a linear relationship between log $K_d$ and pH, which was well agreed with theoretically expected results ; $log\;K_d=0.6339pH+0.5532(r^2=0.70^{**})$. Normalization of the partition coefficients were performed in a range of pH 3.5 ~ 8.5 to minimize adverse effects of Al dissolution, cationic competition, and organic matter dissolution. The $K_d$-om, partition coefficients normalized for organic matter, improved this linearity to the pH of soils. The values of $K_d$-om measured from the field samples were significantly correlated with those of $K_d$ predicted from the sorption-edge experimental data ($r^2=0.68^{**}$).

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.57-66
• /
• 2011

In this paper, it is proposed for algorithm to detect human efficiently using a edge symmetry and gradient directional characteristics in realtime by the feature extraction in a single input image. Proposed algorithm is composed of three stages, preprocessing, region partition of human candidates, verification of candidate regions. Here, preprocessing stage is strong the image regardless of the intensity and brightness of surrounding environment, also detects a contour with characteristics of human as considering the shape features size and the condition of human for characteristic of human. And stage for region partition of human candidates has separated the region with edge symmetry for human and size in the detected contour, also divided 1st candidates region with applying the adaboost algorithm. Finally, the candidate region verification stage makes excellent the performance for the false detection by verifying the candidate region using feature vector of a gradient for divided local area and classifier. The results of the simulations, which is applying the proposed algorithm, the processing speed of the proposed algorithms is improved approximately 1.7 times, also, the FNR(False Negative Rate) is confirmed to be better 3% than the conventional algorithm which is a single structure algorithm.