• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• 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.

• 한국지능시스템학회논문지
• /
• 제18권2호
• /
• pp.272-277
• /
• 2008

[ $m{\leq}n$ ]을 만족하는 m과 n을 두 입력수열이라고 했을 때 Symmerge는 비교횟수와 관련해 복잡도 $O(m{\log}{\frac{n}{m}})$를 필요로 하는 stable minimum storage 머징 알고리즘이다. 그러므로 비교횟수와 관련된 머징의 점근적 하계 ${\Omega}(m{\log}{\frac{n}{m}})$에 의해 Symmerge 알고리즘은 최적 알고리즘에 해당함을 알 수 있다. Symmerge는 두 입력수열의 분할 (partition)과 로테이션 (rotation)을 통해 얻어지는 수열들에 알고리즘의 재귀적 콜 (recursive call)이 적용되는 divide 와 conquer 기술을 이용한다. 이로 인해 수열들이 반복해서 분할과 로테이션 되는데 특히 재귀의 깊이가 m-1 가 되는 경우에 있어서 두 입력수열의 길이의 관계를 알아보고자 한다.

• 한국지능시스템학회논문지
• /
• 제20권4호
• /
• pp.455-462
• /
• 2010

단순하고 스테이블한 머징알고리즘의 비교횟수와 관련된 worst case 복잡도를 분석한다. 복잡도 분석을 통해 소개되는 알고리즘이 m 과 n, $m{\leq}n$ 사이즈의 두 수열에 대해 O(mlog(n/m))의 비교횟수를 요구하는 사실을 증명한다. 그래서 병합에 있어서의 하계가 $\Omega$(mlog(n/m))이라는 사실로부터 우리의 알고리즘이 비교횟수와 관련해 점근적 최적 알고리즘에 해당함 을 추론가능하다. worst case 복잡도 증명을 위해 모든 입력수열로 구성된 정의구역을 두개의 서로소인 집합으로 나눈다. 그런 후 서로소인 각각의 집합으로 부터 특수한 subcase를 구별한 후 이들 subcase 각각에 대해 점근적 최적성을 증명한다. 이 증명을 바탕으로 나머지 모든 경우에 대한 최적성 또한 추론 또는 증명 가능함을 소개한다. 이로써 우리는 복잡도 분석이 까다로운 알고리즘에 대해 투명한 하나의 해를 제시한다.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2019년도 학술발표회
• /
• 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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• 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.

• 대한교통학회지
• /
• 제27권4호
• /
• pp.115-126
• /
• 2009

일반적으로 차로변경 형태는 선택적 차로변경과 강제적 차로변경 등의 두 가지 형태로 구분된다. 선택적 차로변경은 운전자가 원하는 운전상태를 유지하기 위해 선택적으로 차로를 변경하는 경우이며 강제적 차로변경은 운전자가 현재 차로에서 반드시 차로를 변경해야 하는 경우로 합류부 또는 분류부와 같은 반복정체 구간에서 발생하므로 연속류 도로의 교통상태에 매우 큰 영향을 미치게 된다. 본 연구에서는 먼저 고속도로의 대표적인 반복정체 구간인 합류부와 엇갈림 구간에서 수집한 항공사진 개별차량 자료를 사용하여 교통량, 속도, 밀도 데이터와 차로변경 데이터를 생성하였다. 개별차량 속도 변화추이를 이용하여 각 분석구간에서 안정류와 정체류를 구분하였으며 30m 간격으로 분석구간을 구분하여 교통혼잡전과 후의 차로변경 횟수와 차로변경 지점의 변화를 차로변경 분포를 통하여 비교분석 하였고 정체 교통류를 대상으로 차로 변경 분포를 이용하여 본선차로간 전이과정에 대한 분석을 수행하였다. 본 연구는 본선 차로간의 차로변경 분포와 본선과 연결로간의 차로변경 행태가 고속도로의 교통류 흐름에 따라 변화하는 영향을 분석하여 고속도로 반복정체구간의 차로변경 모형을 개발하는데 기초이론 제시를 목적으로 수행되었다.

• 전자공학회논문지B
• /
• 제31B권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.

• 한국전산유체공학회지
• /
• 제13권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.

• 자연과학논문집
• /
• 제6권1호
• /
• pp.79-87
• /
• 1993

주기배가 갈래질 본뜨기에서 안정 주기의 궤도는 $2^n$으로 그 주기가 갈래질 하고 또 혼돈에 이르면 그 혼돈 띠는 1/$2^n$로 수렴하여 넓은 영역의 혼돈이 생긴다. 이때 순환식에 따라서 혼돈 띠 (Chaotic Band)의 수렴과정에서 이 혼돈띠들이 갑자기 넓은 영역의 하나의 혼돈띠로 바뀌는 고비현상이 생기기도 하는데 여기서는 우리가 만든 순환식에서 생기는 이러한 내부고비현상 (Interioi Crisis)을 살피고 이 현상의 특성을 Lyapunov Exponent를 얻어 분석하고자 한다.

• 한국통신학회논문지
• /
• 제22권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.