• Journal of Korea Society of Industrial Information Systems
• /
• v.3 no.1
• /
• pp.258-268
• /
• 1998

This paper presents two sequential advanced split and merge algorithms and a parallel image segmentation algorithm based on them. First, the two advanced methods are obtained from the combination of edge detection and classic split and merge to solve the inherent problems of the classical method. Besides, the parallel image segmentation algorithm on mesh-connected MIMD system considers three types in the merge stage to reduce the communication overhead between processors, such as intraprocessor merge, interprocessor with boundary merge, and interprocessor without boundary merge. Finally , we prove that the proposed algorithms achieve the improved performance by implementing them.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.397-408
• /
• 2003

Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.757-763
• /
• 2006

In this paper, a novel multiple access scheme using SMA(Split and Merge Algorithm) is proposed to reduce the accessdelay of wireless MAC protocols. The key idea of the SMA is to dynamically split and merge the contending terminals depending on their traffic loads for effective control of access to the channels. The SMA divides the collided terminals into several sub-groups if a collision occurs and merges the idle terminals of the split sub-groups into their original group. The merge algorithm can be used to resolve collision and split operation can be used to dynamic group management. The simulation results indicate that our algorithm may provide a higher throughput and a lower collision rate than the existing algorithms, especially under heavy traffic loads.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.392-394
• /
• 2003

There is a well-known simple, stable standard merge algorithm, which uses only linear time but for the price of double space. This extra space consumption has been often remarked as lack of the standard merge sort algorithm that covers a merge process as central operation. In-place merging is a way to overcome this lack and so is a topic with a long tradition of inspection in the area of theoretical computer science. We present an in-place merging algorithm that rear-ranges the elements to be merged by rotation, a special form of block interchanging. Our algorithm is novel, due to its technique of determination of the rotation-areas. Further it has a short and transparent definition. We will give a presentation of our algorithm and prove that it needs in the worst case not more than twice as much comparisons as the standard merge algorithm. Experimental work has shown that our algorithm is efficient and so might be of high practical interest.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.41 no.7
• /
• pp.575-583
• /
• 2017

This paper describes the design and evaluation of a driving mode decision algorithm for automated driving for merge situations on highways. For the development of a highly automated driving control algorithm for merge situations, the driving mode decision is crucial for merging appropriately. There are two driving modes: lane keeping and lane changing (merging). The merge mode decision is determined based on the state of the surrounding vehicles and the remaining length of the merge lane. In the merge mode decision algorithm, merge possibility and the desired merge position are decided to change the lane safely and quickly. A safety driving envelope is defined based on the desired driving mode using the information on the surrounding vehicles' behaviors. To obtain the desired steering angle and longitudinal acceleration for maintaining the subject vehicle in the safe driving envelope, a motion planning controller is designed using model predictive control (MPC), with constraints that are decided considering the vehicle dynamics, safe driving envelope, and actuator limit. The proposed control algorithm has been evaluated via computer simulation studies.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.515-521
• /
• 2015

The SymMerge algorithm is an efficient merging algorithm for input sequences u and v of sizes $\left|u \right|=m$ and $\left|v \right|=n$, $m{\leq}n$. We consider complexity analysis for SymMerge algorithm regarding to the required number of comparisons. The focus of the previous complexity analysis was on finding the values of upper bounds, i.e. showing the asymptotical optimality. In this paper, in a different way from the previous complexity analysis, we show that the overall required number of comparisons for two representative special cases "symmetric case" and "maximum spanning case" can be calculated exactly i.e. the least upper bounds regarding to the required number of comparisons are calculated. Symmerge requires exactly $m\;log\frac{n}{m}+4m-logm-3$ comparisons for symmetric case of sizes $m=2^k,\;n=2^l,l{\geq}k$ of input sequences and exactly $\frac{1}{2}m^2+(m+1)logm-\frac{3}{2}m+2$ comparisons for maximum spanning case of sizes $m=2^k,n=2^m-m$ of input sequences. Additionally we show that the complexity of the Symmerge algorithm regarding to the overall required number of comparisons for these special cases can be defined by recurrence relations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.185-192
• /
• 1998

A new algorithm is proposed in this paper which efficiently performs join in the temporal database. The main idea is to sort the smaller relation and to partition the larger relation, and the proposed algorithm reduces the cost of sorting the larger relation. To show the usefulness of the algorithm, the cost is analyzed with respect to the number of accesses to secondary storage and compared with that of Sort-Merge algorithm. Through the comparisons, we present and verify the conditions under which the proposed algorithm always outperforms the Sort-Merge algorithm. The comparisons show that the proposed algorithm achieves 10∼30% gain under those conditions.

• Journal of Broadcast Engineering
• /
• v.18 no.5
• /
• pp.691-701
• /
• 2013

In this paper, an early termination algorithm for merge process is proposed to reduce the computational complexity in High Efficiency Video Coding (HEVC) encoder. In the HEVC, the same candidate modes from merge candidate list (MCL) are shared to predict a merge or merge SKIP mode. This search process is performed by the number of the obtained candidates for the both of the merge and SKIP modes. This may cause some redundant search operations. To reduce this redundant search operation, we employ the neighboring blocks which have been encoded in prior, to check on the contextual information. In this study, the spatial, temporal and depth neighboring blocks have been considered to compute a correlation information. With this correlation information, an early termination algorithm for merge process is suggested. When all modes of neighboring blocks are SKIP modes, then the merge process performs only SKIP mode. Otherwise, usual merge process of HEVC is performed Through experimental results, the proposed method achieves a time-saving factor of about 21.25% on average with small loss of BD-rate, when comparing to the original HM 10.0 encoder.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.60-67
• /
• 2017

A baggage handling system (BHS) in airport is an unified system for moving the passengers' baggage in designated time. Input baggage from the check-in counter travels to the baggage claim area or cargo handling terminal through this system. In particular, entryway BHS consists of conveyors, X-ray and sorters such as tilt-tray to send the baggage to departing airplane and it could have various problems for handling certain amount of baggage in restricted time such as baggage jamming at certain merge point. This causes systemic error such as delay of the time, omissions of the baggage and even breakdown of the equipment and inefficiency. Also the increasing maximum time of the baggage passing through the BHS could delay the flight schedule and finally decrease the service level. Thus, the algorithm for controlling the flow of the merge is essential to the system. The window reservation algorithm is the one of the most frequently used methods to control the merge configuration. Above all, the reserve location, so called reserve ahead point, that allocates the window is important for the performance of the algorithm. We propose the modified window reservation algorithm and the best reserve locations by changing the reserve ahead point in the induction conveyors. The effect of various reserve ahead points such as the capacity and utility of the system were analyzed and the most effective reserve ahead point combination was found. The total baggage processing time and the utilization of the tilt-tray are properly considered when choosing the optimal Reserve ahead point combination. In the layout of this study, the configuration of four conveyors merged into one tilt-tray is studied and simulation analysis is done by AutoMod(R), 3D simulation software. Through the simulation, the window reservation algorithm is effectively operated with the best combination of reserve ahead point which reduces the maximum baggage travel time.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.343-346
• /
• 2002

관계데이터베이스를 이용한 XML 데이터저장방법에서 데이터가 삽입, 삭제, 갱신될 경우 인덱스를 제정의해야 하는 부담을 줄여주는 인덱스 기법을 제안한다. XML 데이터를 블록과 블록사이에 많아야 하나의 관계가 유지되도록 블록단위로 나누어 각 블록에 대해 Numbering 스킴을 적용하여 인덱스를 정의한다. 또한 정의된 인덱스를 이용하여 XML 질의 처리하기 Parent-Child Block Merge Algorithm과 Ancestor-Descendent Block Merge Algorithm을 제안한다.