• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.12
• /
• pp.1014-1022
• /
• 2002

An objective of Automated Highway Systems (AHS) is to increase the safety and throughput of the existing highway infrastructure by introducing traffic automation. AHS is an example of a large scale, multiagent complex dynamical system and is ideally suited for a hierarchical hybrid controller. We discuss a design issue of efficient hybrid controllers for the platoon maneuvers on AHS. For the modeling of a hybrid system including the merge and split operations, a safety distance policy is introduced for the merge and split operations. After that, the platoon system will be modeled by a hybrid system In addition, a hybrid controller for the proposed merge and split operation models is presented. Finally, the performance of the proposed hybrid control scheme is demonstrated via scenarios for platoon maneuvers.

• 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.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.25 no.3
• /
• pp.44-50
• /
• 2017

This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1313-1319
• /
• 2000

MPLS에서 ATM의 스위칭 기능은 인터넷 백본망에 대해 효율적인 전송을 제공할 것이다. 특히, VC merging은 다수의 IP 경로와 한 VC 레이블간의 대응을 가능케 함으로써 망의 확장 시에도 유연하게 대처 할 수 있다. 이미 VC merge 관련 메커니즘들이 제안되어 있으나 단지 best-effort 트래픽에 대해서만 가능하며 다중 클래스 트래픽에 대해 각 QoS를 충족시키는 구체적인 방안은 제시되어 있지 않다. 따라서, 본 논문에서는 각 클래스의 VC merge시, 동적 대역폭 할당을 적용해 merge된 트래픽의 QoS를 만족시키는 메커니즘 및 ATM-LSR의 구조를 제안한다. 아울러, 시뮬레이션을 통해 제안된 동적 VC 대역폭 할당 방안에 대한 성능 평가를 수행하였다.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.05a
• /
• pp.93-96
• /
• 2008

This study was performed for merge characteristic of Hybrid Rocket with multi-port. PE(Poly Ethylene) is fuel with 4 and 5 port grain and GOX(Gas Oxygen) is oxidizer. This study according to number of ports The multi-port grain merge with other grains during a combustion, then Hybrid Rocket performance is changed by change of a combustion area.

• Speech Sciences
• /
• v.5 no.2
• /
• pp.41-55
• /
• 1999

This paper aims to acoustically analyze the merger of back vowels in North Korean dialects which I believe, are here investigated for the first time since 1945. North Korean back vowels are distinctive from South Korean back vowels because they merge mainly on the back vowel space, while front vowels merge mainly in Seoul standard language and other South Korean dialects. In this paper the future of the vowel systems caused by the merger of the vowels in Korean dialects will also be investigated. North Korean dialects examined include dialects of the Pyungan, the Hamkyung, and the Hwanghae Provinces. North Korean back vowels are distinctive from South Korean back vowels because they merge mainly on the back vowel space, while front vowels merge mainly in Seoul standard language and other South Korean dialects.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.502-511
• /
• 2005

In this paper, we propose a hybrid analysis method(HAM) based on gray-intensity information from natural scene images. The HAM is composed of GIA(Gray-intensity Information Analysis) and SMA(Split/Merge Analysis). Our experimental results show that the proposed approach is superior to conventional methods both in simple and complex images.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.2
• /
• pp.89-95
• /
• 2002

VRML data, which is mainly structural element, is frequently used for modeling and visualizing 3D objects. Although there can be variations, it is a usual practice to represent 3D shapes in VRML format. Ever since the advent of Internet, there have been strong needs to transfer shape data through Internet. Because of this need, it is necessary to transform a data file in VRML or similar format into a more convenient form to transfer through the network. In a VRML file, a model is sometimes divided into a set of triangle meshes due to several practical reasons. However, this causes various demerits for the fast transmission. Therefore, it is more efficient to merge the mesh sets into one mesh set for the transmission. In this paper, we present the problems in the merge process and the techniques to handle the situation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.541-544
• /
• 2001

본 논문에서는 ATM 기반 MPLS망에서 라우터의 레이블 공간을 효율적으로 사용하여 망의 확장성을 높이기 위한 방안인 레이블 통합 기능과 차등서비스를 지원하기 위하여 우선 순위 제어 알고리즘을 적용한 스위치 구조를 제안하고 이를 구현한다. 차등서비스(Differentiated Service)를 제공함에 있어서 레이블 통합 기능을 수행할 수 있는 적합한 구조를 제안하며, 망 폭주 발생 가능성이 있을 시 EPD(Early Packet Discard) 알고리즘을 통한 적응적 폭주 제어를 행함으로써 네트워크 자원의 낭비를 막고, VC-merge와 Non VC-merge 기법을 시뮬레이션을 통해 각각 비교 분석하였다. 또한 고속의 Switching을 위해 Input Queueing 방식과 Pipeline구조의 scheduler을 적용하였으며 제안한 스위치를 VHDL 모델링을 통하여 설계하고, 삼성 0.5um SOG 공정으로 칩을 제작한다.