• The Journal of Engineering Geology
• /
• v.20 no.2
• /
• pp.147-153
• /
• 2010

Cut-off wall with a low permeability can be constructed to prevent groundwater seepage in spillway tunnel areas. Three spillway tunnels are constructed in Im-ha multipurpose dam region and three types of cut-off walls with a variety of directions and scales are designed. As a result of MODFLOW modeling to assess the effect of cut-off wall for three types, groundwater inflows to the tunnels range from 64.26 $m^3/day$ to 65.49 $m^3/day$ and also they through a cut-off wall section from a reservoir do from 44.08 $m^3/day$ to 45.31 $m^3/day$ and it does not show any significant difference among them. Therefore, a construction process and an environmental conservation rather than the effectiveness of cut-off wall need to be considered to select the best cut-off wall in this region.

• Journal of the Korean GEO-environmental Society
• /
• v.17 no.8
• /
• pp.29-37
• /
• 2016

In order to prevent leakage of contaminants in offshore landfill, vertical barrier should be installed. Vertical barrier should be installed at designed depth of seabed to prevent the horizontal transport of contaminant in the subsurface. In this study, the seepage and contaminant transport in the subsurface according to embedded depth of vertical barrier were analyzed by using 2-D finite element analysis program SEEP/W and 3-D finite difference analysis program Visual Modflow. Numerical modelling results show that seepage flux and contaminant transport in seabed was greatly reduced when vertical barrier was installed at certain depth of low permeable layer. Therefore, the determination of minimum embedded depth for preventing contaminant leakage is helpful to design the economical vertical barrier.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.719-722
• /
• 2011

본 연구에서는 이동최소제곱 차분법을 2차원 동적고체문제를 해석하기 위하여 확장시켰으며 Newmark ${\beta}$ 방법을 통해 explicit와 implicit 시간적분법을 모두 적용하여 그 차이를 비교하였다. 이동최소제곱 차분법은 Taylor 다항식을 이용하여 미분계산을 근사화 함으로써 내부 및 경계에서도 강형식을 그대로 이용할 수 있다. 그래서 계산이 빠르고 수치적분이 필요하지 않아 무요소법의 장점을 잘 살릴 수 있고 해석차수를 손쉽게 조정할 수 있어 cubic 등의 고차 근사계산이 간편하다. 두 가지 수치예제를 통하여 동적해석에 대한 이동최소제곱 차분법의 적용성과 안정성을 검증하였다.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.294-297
• /
• 1988

THIS PAPER IS PROPOSED A NOVEL FLUX OBSERVER BASED ON GOPINATH REDUCED ORDER OBSERVER FOR VECTOR CONTROL OF INDUCTION MOTOR. WE SUGGEST RESULT OF SIMULATION ON THE PAPER. WE WILL CONSTRUCT FLUX VECTOR FEEDBACK CONTROL TYPE FOR INDUCTION MOTOR USING FULX OBSERVER.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2004.05b
• /
• pp.719-723
• /
• 2004

본 연구에서는 일 최고, 최소치 유출량 계열을 확충하기 위해 ARIMA(p,d,q) 모형을 이용하였으며, 분석 자료의 경향성 유무를 파악하기 위해 Mann-Kendal 비모수적 검정을 실시하였다. 분석 결과, 최고 최소 유출량 자료 모두 경향성이 없는 것으로 분석되었다. ARIMA(p,d,q) 모형의 최적 차수를 결정하기 위해 ACF, PACF, AIC, 그리고 SBC(Schwarz Bayesian Criterion) 검사를 실시하였으며 이를 통해 최적의 ARMA 모형을 결정하였다. 일 최대치 자료의 경우 추계학적 경향 보다는 무작위적 특성을 보였으며, 일 최소치 자료계열 경우, ARMA(1,0) 모형이 최적 모형으로 선정되었다.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.130.2-130.2
• /
• 2012

태양의 활동영역에서 관측할 수 있는 흑점은 주로 흑점군으로 관측되며, 태양폭발현상의 발생을 예보하기 위한 중요한 관측 대상 중 하나이다. 현재 태양 폭발을 예보하는 모델들은 McIntosh 흑점군 분류법을 사용하며 통계적 모델과 기계학습 모델로 나누어진다. 컴퓨터는 흑점군의 형태학적 특성을 연속적인 값으로 계산하지만 흑점군의 형태적 다양성으로 인해 McIntosh 분류를 잘못 분류할 수도 있다. 이러한 이유로 컴퓨터가 계산한 흑점군의 형태학적인 특성을 예보에 직접 적용하는 것이 필요하다. 우리는 흑점군의 형태학적인 특성(개수, 면적, 면적비 등)과 함께 모든 흑점을 정점(Vertex)으로 하고 그 사이를 연결하는 간선(Edge)으로 하는 간선의 거리 합이 최소인 최소신장트리(Minimum spanning tree : MST)를 작성하였다. 이 최소신장트리를 사용하여 흑점군을 검출하고 가장 면적이 큰 정점을 중심으로 트리의 깊이(Depth)와 차수(Degree)를 계산하였다. 이 방법을 2003년 SOHO/MDI의 태양 가시광 영상에 적용하여 구한 흑점군의 내부 흑점수와 면적은 NOAA에서 산출한 값들과 90%, 99%의 좋은 상관관계를 가졌다. 우리는 이 연구를 통해 흑점군의 형태학적인 특성과 더불어 예보에 직접적으로 활용할 수 있는 방법을 논의하고자 한다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.5 s.335
• /
• pp.23-30
• /
• 2005

In the construction of an extension field, there is a connection between the polynomial multiplication method and the degree of polynomial. The existing methods, KO and MSK methods, efficiently reduce the complexity of coefficient-multiplication. However, when we construct the multiplication of an extension field using KO and MSK methods, the polynomials are padded with necessary number of zero coefficients in general. In this paper, we propose basic properties of KO and MSK methods and algorithm that can reduce coefficient-multiplications. The proposed algorithm is more reducible than the original KO and MSK methods. This characteristic makes the employment of this multiplier particularly suitable for applications characterized by specific space constrains, such as those based on smart cards, token hardware, mobile phone or other devices.

• 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 Korean Journal of Applied Statistics
• /
• v.32 no.6
• /
• pp.909-922
• /
• 2019

In this paper, we study the adaptive least absolute shrinkage and selection operator (LASSO) for the unstable autoregressive (AR) model. To identify the existence of the unit root, we apply the adaptive LASSO to the augmented Dickey-Fuller regression model, not the original AR model. We illustrate our method with simulations and a real data analysis. Simulation results show that the adaptive LASSO obtained by minimizing the Bayesian information criterion selects the order of the autoregressive model as well as the degree of differencing with high accuracy.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.1
• /
• pp.85-91
• /
• 2008

When a large sparse matrix is calculated for a horizontal geodetic network adjustment, it needs to go through the process of matrix reordering for the efficiency of time and space. In this study, several reordering methods for sparse matrix were tested, using Sparse Matrix Manipulation System(SMMS) program, total processing time and Fill-in number produced in factorization process were measured and compared. As a result, Minimum Degree(MD) and Mutiple Minimum Degree(MMD), which are based on Minimum Degree are better than Gibbs-Poole-Stockmeyer(GPS) and Reverse Cuthill-Mckee(RCM), which are based on Minimum Bandwidth. However, the method of the best efficiency can be changed dependent on distribution of non-zero elements in a matrix. This finding could be applied to heighten the efficiency of time and storage space for national datum readjustment and other large geodetic network adjustment.