• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.980-982
• /
• 1995

Image coding based on a fractal theory of iterated transformations presents highly compressed image. In this paper, we compress image using the partitioning method which devides image adaptively in horizon and vertical axis. This method can encode image more compactly than the quadtree partitioning method. The maximum range size can be selected as $32{\times}32$ blocks and the minimum size can be $4{\times}4$ blocks. And the domain size is twice as many as the range size.

• Journal of the Korean Society for Railway
• /
• v.7 no.4
• /
• pp.326-331
• /
• 2004

A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.838-844
• /
• 2013

In this paper, we propose a novel spectrum sensing scheme based on sensing time partitioning for cognitive radio systems in high traffic environments. Specifically, we partition a sensing time into K sub-sections, and then, propose a spectrum sensing scheme that determines if a primary user signal is present based on the sensing results on the partitioned sub-sections. From numerical results, it is confirmed that the proposed scheme outperforms the conventional schemes in high traffic environments.

• Journal of electromagnetic engineering and science
• /
• v.15 no.1
• /
• pp.14-19
• /
• 2015

In multicellular wireless networks, intercell interference limits system performance, especially cell edge user performance. One promising approach to solve this problem is the intercell interference coordination (ICIC) scheme. In this paper, we propose a new ICIC scheme based on a resource partitioning approach to enhance cell edge user performance in a wireless multicellular system. The most important feature of the proposed scheme is that the algorithm is performed at each base station in a distributed manner and therefore minimizes the required information exchange between neighboring base stations. The proposed scheme has benefits in a practical environment where the traffic load distribution is not uniform among base stations and the backhaul capacity between the base stations is limited.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.567-578
• /
• 1996

In relational databases the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. N-ary vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. In this paper, a 0-1 integer programming model for solving n-ary vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve it. A preprocessing procedure reducing the number of variables is presented. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.

• Journal of the Korean Society of Safety
• /
• v.13 no.3
• /
• pp.32-44
• /
• 1998

Analysis on the study for the sodium fire mitigation was carried out using the CONTAIN-LMR code. Sodium loop building was partitioned into the many cells, in which the safety venting systems were installed for the purpose of improving the sodium fire safety and minimizing its effect on the sodium loop building. The effects of sodium fire on sodium loop building partitioned into the many cells and not partitioned were investigated. The peak pressure and temperature of each cell accompanied by sodium fire in sodium loop building partitioned were lower than those of sodium loop building not partitioned. In the case of partitioning sodium loop building, the pressures, temperatures and aerosols into cells were transferred through propagation path of CONTAIN-LMR sodium fire model simulated by this study, and the effect of sodium spray fire on sodium loop building was mitigated by partitioning building. In addition, the excessive rise of pressure into cells was prevented by installing the over-pressure exhaust valve and under-pressure exhaust valve on the flow path between cells.

• Journal of the Korean Institute of Navigation
• /
• v.10 no.1
• /
• pp.129-138
• /
• 1986

A matrix partitioning method is proposed for the 2-D motion analysis of floating bodies. For the numerical solution, the boundary of a floating body is approximated with a series of line segments and the governing integral equation is transformed into a system of linear equations. A new solution procedure of resulting linear equation with complex coefficients is formulated and programmed using a matrix partitioning scheme and the Choleski decomposition. From the case study, it is found that the proposed method is efficient in the motion analysis of floating bodies, especially in the calculation of hydrodynamic coefficients. Also, it requires smaller memory size and less computing time compared with conventional methods.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.437-445
• /
• 2000

The reuse partitioning system in microcellular networks are dropped performance of system because of increase hand-off of high-speed terminal. In this paper, we propose hand-off algorithm to improve the performance of reuse partitioning system using microcell according to the ratio of traffic distribution between innercell and outercell from resource management of high-speed and slowspeed terminal. Also, we compare to RPS and evaluate the teletraffic performance analysis of high-speed and slow-speed terminal through computer simulations that we derive the hand-off probability, call dropping probability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.875-877
• /
• 2003

그래프 분할문제에서 대량의 그래프 데이터를 처리하는 것은 계산에서 걸리는 시간보다 파일 입출력을 수행하는 데 걸리는 시간의 비중이 크다. 본 논문은 수행 속도와 분할 성능에 있어서 우수한 그래프 분할 알고리즘 중 하나인 Multilevel Graph Partitioning에 대해 입출력 효율을 높일 수 있도록 확장하는 기법을 제안하고 그 구현에 대해 기술한다. 그래프를 컴퓨터의 가용 메모리를 기준으로 서브 그래프로 나누어 메모리 참조의 지역성이 향상되도록 기존의 Multilevel Graph Partitioning을 확장 하였다. 기존의 방식과 제안된 방식을 테스트 그래프들에 적용하여 그 수행시간을 비교한 결과 그래프 데이터의 크기가 컴퓨터의 주 메모리의 용량에 비해 어느 수준 이상으로 커지면서 제안된 알고리즘이 기존의 방식보다 수행시간에 있어서 좋은 결과를 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.892-894
• /
• 2005

Graph partitioning provides an important tool for data clustering, but is an NP-hard combinatorial optimization problem. Spectral clustering where the clustering is performed by the eigen-decomposition of an affinity matrix [1,2]. This is a popular way of solving the graph partitioning problem. On the other hand, semidefinite relaxation, is an alternative way of relaxing combinatorial optimization. issuing to a convex optimization[4]. In this paper we present a semidefinite programming (SDP) approach to graph equi-partitioning for clustering and then we use eigen-decomposition to obtain an optimal partition set. Therefore, the method is referred to as semidefinite spectral clustering (SSC). Numerical experiments with several artificial and real data sets, demonstrate the useful behavior of our SSC. compared to existing spectral clustering methods.