• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.179-184
• /
• 2007

The problem of selecting base station location in the design of mobile communication system has been basically regarded as a problem of assigning maximum users in the cell to the minimum base stations while maintaining minimum SIR. and it is NP hard. The objective function of warehouse location problem, which has been used by many researchers, is not proper function in the base station location problem in CDMA mobile communication, The optimal and approximate solutions have been presented by using proposed object function and algorithms of exact solution, and the simulation results have been assessed and analyzed. The optimal and approximate solutions are found by using mixed integer programming instead of meta-heuristic search methods.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.19 no.3
• /
• pp.205-212
• /
• 2007

Parabolic approximation wave models based on $Pad{\acute{e}}$ approximants are analyzed in order to calculate wave transformation. In this study a $Pad{\acute{e}}(2,2)$ parabolic approximation model is developed to increase the accuracy of computation in comparison with the existing models. Numerical studies on a constant sloping bed show that the new model proves to allow for much more successful treatment of large angles of incidence than is possible using the previously available models.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.24 no.5
• /
• pp.543-551
• /
• 2011

The paper deals with the comparative study of design optimization based on various approximation techniques in strength design of riser support structure installed on floating production storage and offloading unit(FPSO) using offshore operation loading conditions. The design optimization problem is formulated such that structural member sizing variables are determined by minimizing the weight of riser support structure subject to the constraints of structural strength in terms of loading conditions. The approximation techniques used in the comparative study are response surface method based sequential approximate optimization(RBSAO), Kriging based sequential approximate optimization(KBSAO), and the enhanced moving least squares method(MLSM) based approximate optimization such as CF(constraint feasible)-MLSM and Post-MLSM. Commercial process integration and design optimization(PIDO) tools are employed for the applications of RBSAO and KBSAO. The enhanced MLSM based approximate optimization techniques are newly developed to ensure the constraint feasibility. In the context of numerical performances such as design solution and computational cost, the solution results from approximate techniques based design optimization are compared to actual non-approximate design optimization.

• The Korean Journal of Applied Statistics
• /
• v.22 no.1
• /
• pp.171-179
• /
• 2009

In this paper we studied the effective approximations to the distribution of the sum of products of normal variables. Based on the saddlepoint approximations to the quadratic forms, the suggested approximations are very accurate and easy to use. Applications to the FSK (Frequency Shift Keying) communication are also considered.

• Journal of the korean Society of Automotive Engineers
• /
• v.5 no.3
• /
• pp.56-63
• /
• 1983

강성체로된 견인물체가 탄성무한경면으로 지지된 점탄성층 위를 미끄러져 갈 때 접촉구간에서의 압력분포와 마찰 특성을 고찰하였다. 즉, 접촉구간에서의 강성체의 모양과 압력분포에 관한 적분 방정식을 구하고, 점탄성층의 두께가 접촉구간에 비하여 충분히 두꺼울 때 압력분포와 마찰계 수의 근사해를 구하였다. 압력분포의 모양은 점탄성층의 물성을 표시하는 지수값, 즉 .alpha.<1/2, .alpha.=1/2, .alpha.>1/2에 따라서 크게 다르다. 한편, 수치해석에 의하면 마찰 계수에 대한 근 사해는 강성체의 미끄럼 속도, 점탄성 층의 두께, 탄성체의 영율 (E$_{o}$ )과 점탄성층의 시효 성탄성계수 (E$_{v}$ )의 차, 즉 E$_{o}$ /E$_{v}$ 에 따라 변화함을 알 수 있다. 즉, 탄성체가 점탄성층에 비하여 딱딱하면 할수록, 또 강성체 속도가 느리면 느릴수록 마찰계수는 작아진다. 그리고 불성의 지수(.alpha.)가 커지면 커질수록 근사해의 수렵 속도는 느려지게 되고 지 수(.alpha.)가 1에 가까워지면 점탄성층의 탄성효과는 점성효과에 비하여 거의 무시할 수 있으며 근사해는 의미가 없어지게 된다.

• Journal of the KSME
• /
• v.20 no.4
• /
• pp.296-302
• /
• 1980

이상에서 potential energy의 극소조건을 각종경우에 적용하여 재료역학의 해 또는 변형의 근사 해를 응용 예들을 통하여 구해 보았다. 이 해법은 을 받은 부재, 보(beam) 또는 순수 비틀림을 받는 엔형봉재의 경우, 부정정 문제에서 그 지지점들에서의 반력요소를 생각할 필요가 없기 때 문에 재료 역학적인 해법보다 더 간편하게 구해지고 있는 것을 볼 수가 있다. 또 보의 처짐 곡 선이 길이의 중앙면에 대하여 좌우 대칭형일 때에, 중앙단면에서의 최대처짐을 구하는데 삼각 함수의 근사처짐 곡선을 설정하므로써 실제 엄밀해에 가까운 근사값이 간단하게 구해질 수 있는 것을 보였다. 이 극소에너지 정리는 엔형단면이 아닌 각종 단면봉재의 비틀림 문제에서도 비틀림 응력함수를 도입하고, 경제조전을 만족하는 근사공력 함수방정식을 가정함으로써 간단하게 그 근사해를 구하는 데까지 직장할 수가 있다.

• Journal for History of Mathematics
• /
• v.18 no.3
• /
• pp.107-117
• /
• 2005

In this paper, we introduce linear approximate Henstock integral equations that is slightly different from linear Henstock integral equations, and we also offer an example which shows that some integral equation has a solution in the sense of the approximate Henstock integral but does not have any solutions in the sense of the Henstock integral. Furthermore, we investigate the existence and uniqueness of solution of the approximate Henstock integral equation.

• The Korean Journal of Applied Statistics
• /
• v.29 no.4
• /
• pp.571-579
• /
• 2016

Most of studies related to the distributions of quadratic forms are conducted under the assumption of multivariate normal distribution. In this paper, we suggested an approximation to the distribution of quadratic forms based on multivariate skew-normal distribution as alternatives for multivariate normal distribution. Saddlepoint approximations are considered and the accuracy of the approximations are verified through simulation studies.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.182-184
• /
• 2018

본 논문에서는 HDR 영상 신호의 고속 광전변환을 위한 파라미터 룩업 테이블 기반 구간 선형 근사 방법을 제안한다. 제안하는 방법은 고속화하기 위한 광전변환함수의 입력 값의 범위를 다수개의 구간으로 나누고 각 구간마다 별도의 선형 근사함수를 구하여 광전변환함수를 근사하고 각 구간별로 필요한 선형 근사함수의 파라미터를 룩업 테이블에 미리 저장하고 사용함으로써 보다 빠른 근사 값 계산이 가능하다. 제안한 방법의 성능 평가를 위해 MPEG 에서 제공하는 참조 소프트웨어인 HDRTools 를 기반으로 실험을 수행했고 이를 통해 참조 소프트웨어에 구현되어 있는 기존의 고속화 방법과 비교하여 더 적은 연산 수를 가지며 평균 24% 빠른 처리속도와 약 0.05dB 의 평균 PSNR 손실을 보임을 확인하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.16-21
• /
• 2002

Repetitive strings have been studied in such diverse fields as molecular biology data compression etc. Some important regularities that have been studied are perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P(｜P｜=m) and T(｜T｜=n) we propose and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and $O(mn^2)$ time of finding a string which is an approximate cover of T is minimum distance is NP-complete.