• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.5C
• /
• pp.351-358
• /
• 2006

The purpose of this study is to recommend the simulation method and procedure of behaviors of CFRD(Concrete Faced Rockfill Dam) concrete face slab with impoundment by centrifuge tests, to examine the effects of the flexural rigidity of the concrete face slab on the face slab deformation from the centrifuge tests, and to evaluate the effects of the stiffness of face supporting zone on the displacement and moment of face slab by numerical analysis which is verified by the centrifuge tests. In this study, the centrifuge tests on the two model dams with the concrete face slab of different flexural rigidity were carried out. Also, the centrifuge tests were simulated by numerical analysis of which input material properties were obtained by the triaxial tests on the model materials. The validity of numerical analysis was evaluated by comparison between the results of centrifuge tests and numerical simulation. The deformation pattern of the concrete face slab was examined with the various stiffness of the face supporting zone by numerical analysis. From the results of centrifuge tests, the effects of face slab thickness on the deformation of face slab were negligible. From the results of centrifuge tests and numerical analysis, it was found that the amplitude of the maximum displacement of face slab and the position where the maximum displacement was mobilized with impoundment were affected by the stiffness of face supporting zone rather than the flexural rigidity of concrete face slab.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.63-70
• /
• 2015

In the absence of a polynomial time algorithm capable of obtaining the exact solutions to it, the domatic number problem (DNP) of dominating set (DS) has been regarded as NP-complete. This paper suggests polynomial-time complexity algorithm about DNP. In this paper, I select a vertex $v_i$ of the maximum degree ${\Delta}(G)$ as an element of a dominating set $D_i,i=1,2,{\cdots},k$, compute $D_{i+1}$ from a simplified graph of $V_{i+1}=V_i{\backslash}D_i$, and verify that $D_i$ is indeed a dominating set through $V{\backslash}D_i=N_G(D_i)$. When applied to 15 various graphs, the proposed algorithm has succeeded in bringing about exact solutions with polynomial-time complexity O(kn). Therefore, the proposed domatic number algorithm shows that the domatic number problem is in fact a P-problem.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1199-1213
• /
• 2011

Slurry type shield would be very effective for the tunnelling in a sandy ground, but low slurry pressure could cause a tunnel face failure or a ground settlement in front of the tunnel face. Thus, the stability of tunnel face could be maintained by applying an excess slurry pressure that is larger than the active earth pressure. However, the slurry pressure should increase properly because an excessively high slurry pressure could cause the slurry flow out or the passive failure of the frontal ground. It is possible to apply the high slurry pressure without passive failure if a horizontal impermeable layer is located in the ground in front of the tunnel face, but its location, size, and effects are not clearly known yet. In this research, two-dimensional model tests were carried out in order to find out the effect of a horizontal impermeable layer for the slurry shield tunnelling in a saturated sandy ground. As results, larger slurry pressure could be applied to increase the stability of the tunnel face when the impermeable layer was located in the ground above the crown in front of the tunnel face. The most effective length of the impermeable grouting layer was 1.0~1.5D, and the location was 1.0D above the crown level. The safety factor could be suggested as the ratio of the maximum slurry pressure to the active earth pressure at the tunnel face. It could also be suggested that the slurry pressure in the magnitude of 3.5~4.0 times larger than the active earth pressure at the initial tunnel face could be applied if the impermeable layer was constructed at the optimal location.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.77-85
• /
• 1994

In this study an adaptive algorithm with optimum convergence factor for steepest descent method is proposed, which controls automatically the filter order to take the appropriate level. So far, fixed order filters have been used when adaptive filter is employed according to the priori knowledge or experience in various adaptive signal processing applications. But, it is so difficult to know the filter order needed in real implementations that high order filters have to be performed. As a result, redundant calculations are increased in the case of high order filters. The proposed variable length optimum convergence factor (VLOCF) algorithm takes the appropriated filter order within the given one so that the redundant calculation is decreased to get the enhancement of convergence speed and smaller convergence error during the steady state. The proposed algorithm is evaluated to prove the validity by computer simulation for system Identification.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.193-199
• /
• 2019

In this paper I propose an algorithm of linear time complexity for NP-complete Maximum Independent Set (MIS) problem. Based on the basic property of the MIS, which forbids mutually adjoining vertices, the proposed algorithm derives the solution by repeatedly selecting vertices in the ascending order of their degree, given that the degree remains constant when vertices ${\nu}$ of the minimum degree ${\delta}(G)$ are selected and incidental edges deleted in a graph of n vertices. When applied to 22 graphs, the proposed algorithm could obtain the MIS visually yet effortlessly. The proposed linear MIS algorithm of time complexity O(n) always executes ${\alpha}(G)$ times, the cardinality of the MIS, and thus could be applied as a general algorithm to the MIS problem.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.194-194
• /
• 2023

세류침식은 급경사 나지사면에서 증가하는 지표흐름에 의해 빈번하게 발생하고, 과도한 토사유출로 인해 홍수 및 토사재해 위험 증가와 수질오염 등의 문제를 야기한다. 본 연구는 개발지역의 마사토를 활용하여 1.2 m × 5.5 m 규모의 3개 중규모 플롯에서 세류발달 특성, 유출 및 토사유출량을 파악하고자 강우와 유입수 모의실험을 수행하였다. 경사 조건 15°와 20°에서 유입수 유무에 따른 4회의 반복실험이 진행되었으며 마사토의 평균입경은 0.89 mm이다. 강우강도 범위는 90~140 mm/hr이며, 유입수 유량은 합리식으로 계산하였으며 100~130 ml/sec이다. 하천 차수분석방법인 Horton방법을 사용하여 세류별 차수를 나누었다. 세류절개는 유입수가 없는 경우 실험 시작 약 1분 후에 발생하였고, 최대 2차수까지 세류가 발달하였으며, 유입수가 있는 경우 약 30초 후 발생하였고, 최대 3차수까지 세류가 발달하였다. 세류발달에 대한 수리학적 특성을 파악하기 위하여 염료 추적방법에 의한 동영상 이미지 분석결과 유속은 0.06~0.43 m/s의 범위를 보였다. 유입수와 강우가 함께 공급되는 경우 강우모의 공급수량에 비해 1.32~1.69배 증가했고, 이에 따라 지표유출수는 1.13~3.93배로 증가폭의 범위가 넓었다. 세류발달에 의한 토사유출량은 유입수 유무에 따라 6.7~32.3배로 증가하였다. 결론적으로 강우와 유입수가 상호작용하는 경우 강우에 의한 박리현상보다 유입수에 의한 측벽붕괴 활동이 활발하게 진행되었고 이는 세류 발달 과정에서 지배적으로 이루어졌기 때문으로 판단된다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.303-305
• /
• 2015

본 논문에서는 나카가미-m 페이딩 채널 환경을 가진 무선 중계 네트워크에서 reactive 누적분포함수(cumulative distribution function) 기반 중계기 선택 기법을 제안한다. 제안된 기법은 수신 신호대잡음비(signal-to-noise ratio)의 누적분포함수 값에 따라 중계기를 선택한다. 본 논문에서는 제안한 기법의 불능 확률(outage probability)과 다이버시티 차수(diversity order)를 분석한다. 제안된 기법이 얻을 수 있는 다이버시티 차수는 중계기의 개수와 페이딩 파라미터에 의해 결정되며 최대 다이버시티(full diversity)를 얻음을 볼 수 있다. 그리고 모의 실험에서는 분석된 불능 확률 및 다이버시티 차수가 정확하게 일치하는 것을 확인한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.183-191
• /
• 2011

This paper suggests emergency medical service vehicle (ambulance) algorithm when the emergency patient occurs in order to be sufficient the maximum permission time T of arrival about all sectors in one city that is divided in the various areas. This problem cannot be solved in polynomial times. One can obtains the solution using the integer programming. In this paper we suggest vertex set (or dominating set) algorithm and easily decide the location of ambulances. The core of the algorithm decides the location of ambulance is to the maximum degree vertex among the neighborhood of minimum degree vertex. For the 33 sectors Ostin city in Texas, we apply $3{\leq}T{\leq}20$ minutes. The traditional set cover algorithm with integer programming cannot obtains the solution in several T in 18 cases. But, this algorithm obtains solution for all of the 18 cases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.1-6
• /
• 2022

This paper deals with the maximum cardinality matching(MCM) problem. The augmenting path technique is well known in MCM. MCM is obtained by $O({\sqrt{n}}m)$ time complexity augmenting path algorithm for the general graph, and O(m log n) algorithm for the bipartite graph. On the other hand, this paper suggests O(n) linear time algorithm. The proposed algorithm based on the basic principle of as possible as largest selected inter-vertex edges in order to obtain the MCM. This paper simply selects edge {u,𝜐} that the minimum degree vertex u and minimum degree vertex 𝜐 in N_G(u) 𝜈(G)=k times iteration. For various general and bipartite graphs experimental data, this algorithm can be get the 𝜈(G) exactly.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.246-247
• /
• 2014

케이블 방송망에서 최대 10Gbps 테이터 전송을 위해 최근 북미에서 표준화된 DOCSIS 3.1(Data over Cable Service Interface Specifications Version 3.1)에서는 고차 혼합 변조(Mixed Modulation) 방식을 제시하였다. DOCSIS 3.1 은 하향 데이터 전송을 위해 최대 192MHz 의 대역에서 4K 또는 8K 다중 직교 반송파를 사용한다. 특히 채널 오류 정정을 위한 채널 부호화 방법으로 유럽의 차세대 케이블 방송 표준인 DVB-C2(Digital Video Broadcasting - Cable Version 2)에 정의된 BCH(Bose, Chaudhuri, and Hocquenghem)와 LDPC(Low Density Parity Check) 연접부호를 사용한다. 단, DOCSIS 3.1 에서는 DVB-C2 와 달리 부호율 8/9 의 Short Mode 부호만을 사용하며 최대 16384-QAM 까지 사용한다. 하나의 부호율을 사용하기 때문에 QAM 차수에 따른 요구 SNR 의 차가 크게 된다. 주어진 채널 상황에서 최적의 전송용량을 얻기 위해 QAM 차수에 따른 요구 SNR 의 차를 줄일 수 있는 방법으로 혼합 변조가 도입되었으며, 본 논문에서는 혼합 변조에 따른 수신 성능을 제시한다.