• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.53-56
• /
• 2007

Symmerge is a stable minimum storage algorithm for merging that needs $O(mlog\frac{n}{m})$ element comparisons, where m and n are the sizes of the input sequences with m ${\leqq}$ n. According to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The objective of this paper is to consider the relationship between m and n for the spanning case with the recursion level m-1.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.272-277
• /
• 2008

Symmerge is a stable minimum storage merging algorithm that needs $O(m{\log}{\frac{n}{m}})$ element comparisons, where in and n are the sizes of the input sequences with $m{\leq}n$. Hence, according to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The Symmerge algorithm is based on the standard recursive technique of "divide and conquer". The objective of this paper is to consider the relationship between m and n for the degenerated case where the recursion depth reaches m-1.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.455-462
• /
• 2010

We investigate the worst case complexity regarding the number of comparisons for a simple and stable merging algorithm. The complexity analysis shows that the algorithm performs O(mlog(n/m)) comparisons for two sequences of sizes m and n $m{\leq}n$. So, according to the lower bound for merging $\Omega$(mlog(n/m)), the algorithm is asymptotically optimal regarding the number of comparisons. For proving the worst case complexity we divide the domain of all inputs into two disjoint cases. For either of these cases we will extract a special subcase and prove the asymptotic optimality for these two subcases. Using this knowledge for special cases we will prove the optimality for all remaining cases. By using this approach we give a transparent solution for the hardly tractable problem of delivering a clean complexity analysis for the algorithm.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.154-154
• /
• 2019

Characterization of reliable field-scale root-zone soil moisture (RZSM) variability contribute to effective hydro-meterological monitoring. Although a promising cosmic-ray neutron probe (CRNP) holds the pontential for field-scale RZSM measurement, it is often restricted at deeper depths due to the non-unique sensitivity of CRNP-measured fast neutron signal to other hydrogen pools. In this study, a merging framework relied on coupling cosmic-ray soil moisture with a representative additional RZSM, was introduced to scale shallower CRNP effective depth to represent root-zone layer. We tested our proposed framework over a densely vegetated region in South Korea covering a network of one CRNP and nine in-situ point measurements. In particular, cosmic-ray soil moisture and ancillary RZSM retrieved from the most time stable location were considered as input datasets; whereas the remaining point locations were used to generate a reference RZSM product. The errors between these two input datasets and the reference were forecasted by a linear autoregressive model. A linear combination of forecasts was then employed to compute a suitable weight for merging two input products from the predicted errors. The performance of merging framework was evaluated against reference RZSM in comparison to the two original products and a commonly used exponential filter technique. The results of this study showed that merging framework outperformed other products, demonstrating its robustness in improving field-scale RZSM. Moreover, a strong relationship between the quality of input data and the performance merging framework in light of CRNP effective depth variation has been also underlined via the merging framework.

• 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 Korean Society of Transportation
• /
• v.27 no.4
• /
• pp.115-126
• /
• 2009

The lane-change behavior usually consists of discretionary lane-change and mandatory lane-change types. For the first type, drivers change lanes selectively to maintain their own driving condition and the second type is the case that the drivers must change the current lane, which can occur in recurrent congestion sections like merging and weaving sections. The mandatory lane-change behavior have a great effect on the operation condition of freeway. In this paper, we first generate data such as traffic volumes, speeds, densities, and the number of lane-change within the merging and weaving sections using the data of individual vehicle collected from time-lapse aerial photography. And then, the data is divided into the stable and congested flow by analyzing the speed variation pattern of individual vehicles. In addition, the number of lane-changing from ramp to mainline within every 30-meter interval is investigated before and after traffic congestion at study sites and the distribution of lane-changing at each 30-meter point is analyzed to identify the variation of lane-changing ratio depending on the stable and congested flows. To recognize the effect of mainline flow influenced by ramp flow, this study also analyzes the characteristics of the lane-changing distributions within the lanes of mainline. The purpose of this paper is to present the basic theory to be used in developing a lane-changing model at the merging and weaving sections on freeways.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.20-30
• /
• 1994

The lossless bounded real(LBR) two-pair cascade structure is one of the exiting low-sensitivity digital filter structures such as wave digital filters(WDFs) orthogonal filters. They are known to have the same structures which are composed of canonic building blocks interconnected to each other. The LBR two-pair cascade filters amount to describing in a unified manner the existing canonic low-sensitivity filters in terms of transfer matrices and chain matrices. However the existing structures have somewhat degraded low-sensitivity performance because they include dependent parameters within their structures. In this paper we propose a filter structure called “two-type-interlaced(TTI) structure.” eliminating such problem completely. This structures can be viewed as the WDFs of analog ladder circuits. As ladder circuits are obtained by cascading Brune sections and merging neighboring inductors or capacitors. so TTI structures at e obtained by cascading Type 3 LBR two-pairs and merging neighboring Type 1 LBR two-pairs. Next, a test procedure called “LBR test” is also presented in this paper. which determines whether of not the quantized TTI structure is stable . If it is unstable we can fine-tune the quantized parameters to make the overall structure stable. Therefore we can solve the dependent parameter problem completely with TTI structure along with LBR test. test.

• Journal of computational fluids engineering
• /
• v.13 no.4
• /
• pp.126-134
• /
• 2008

We developed a three dimensional Navier-Stokes code based on the level set method to simulate two phase flows with high density ratio. The Navier-Stokes equations with consideration of the surface tension effects are solved by using SIMPLE algorithm on a non-staggered grid. The present code is validated by simulating two test problems. First one is to simulate a rising bubble inside a cube. The thickness of the interface of the bubble is shown to affect the pressure distribution around the interface. As the thickness decreases, the pressure field around the interface becomes more oscillatory. As the bubble rises, a ring vortex is shown to form around the interface and the bubble eventually develops into an ellipsoidal shape. Merge of two bubbles inside a container is secondly tested to show the robustness of the present code for two phase flow simulation. Numerical results show stable and reliable behavior during the process of merging of two bubbles. The velocity and pressure fields around the interface of bubbles are shown oscillation free during the merging of two bubbles.

• The Journal of Natural Sciences
• /
• v.6 no.1
• /
• pp.79-87
• /
• 1993

In the map of period-doubling bifurcation, stable fixed points bifurcate to $2^n$ fixed points, and in the chaotic region, the chaotic bands merge to 1/$2^n$ bands. In a typical map, the chaotic bands expand to a broad chaotic band during the merging process, so called crisis. In this paper, interior crises appearing during the merging process will be discussed by using our map and will be analyzed the characteristics of the phenomenon by obtaining the Lyapunov Exponents.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.469-480
• /
• 1997

For moving image coding, the variable size of region coding based on local motion is more efficient than fixed size of region coding. It can be applied well to complex motions and is more stable for wide motions because images are segmented according to local motions. In this paper, new image coding method using the segmentation of motion vectors is proposed. First, motion vector field is smoothed by filtering and segmented by smoothed motion vectors. The region growing method is used for decomposition of regions, and merging of regions is decided by motion vector and prediction errors of the region. Edge of regions is excluded because of the correlation of image, and neighbor motion vectors are used evaluation of current block and construction of region. The results of computer simulation show the proposed method is superior than the existing methods in aspect of coding efficiency.