• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.97-113
• /
• 2004

In this paper we shall study moving boundary problems, and we introduce an approach for solving a wide range of them by using calculus of variations and optimization. First, we transform the problem equivalently into an optimal control problem by defining an objective function and artificial control functions. By using measure theory, the new problem is modified into one consisting of the minimization of a linear functional over a set of Radon measures; then we obtain an optimal measure which is then approximated by a finite combination of atomic measures and the problem converted to an infinite-dimensional linear programming. We approximate the infinite linear programming to a finite-dimensional linear programming. Then by using the solution of the latter problem we obtain an approximate solution for moving boundary function on specific time. Furthermore, we show the path of moving boundary from initial state to final state.

• Earthquakes and Structures
• /
• 제6권3호
• /
• pp.251-266
• /
• 2014

Dynamic analyses for a suite of ground of motions were conducted on concrete gravity dam sections to examine the earthquake induced stresses and effective damping. For this purpose, frequency domain methods that rigorously incorporate dam-reservoir-foundation interaction and time domain methods with approximate hydrodynamic foundation interaction effects were employed. The maximum principal tensile stresses and their distribution at the dam base, which are important parameters for concrete dam design, were obtained using the frequency domain approach. Prediction equations were proposed for these stresses and their distribution at the dam base. Comparisons of the stress results obtained using frequency and time domain methods revealed that the dam height and ratio of modulus of elasticity of foundation rock to concrete are significant parameters that may influence earthquake induced stresses. A new effective damping prediction equation was proposed in order to estimate earthquake stresses accurately with the approximate time domain approach.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2003년도 제2차 연례학술대회 발표논문집
• /
• pp.193-199
• /
• 2003

The application of finding occurrences of a pattern that contains gaps includes information retrieval, data mining, and computational biology. As the biological sequences may contain errors, it is important to find not only the exact occurrences of a pattern but also approximate ones. In this paper we present an O(mnk$_{max}$/w) time algorithm for the approximate gapped pattern matching problem, where m is the length of the text, H is the length of the pattern, w is the word size of the target machine, and k$_{max}$ is the greatest error bound for subpatterns.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.125-136
• /
• 2007

The study on query relaxation which provides approximate answers has received attention. In recent years, some arguments have been made that semantic relationships are useful to present the relationships among data values and calculating the semantic distance between two data values can be used as a quantitative measure to express relative distance. The aim of this article is a hierarchical metricized knowledge abstraction (HiMKA) with an emphasis on combining data abstraction hierarchy and distance measure among data values. We propose the operations and the query relaxation algorithm appropriate to the HiMKA. With various experiments and comparison with other method, we show that the HiMKA is very useful for the quantified approximate query answering and our result is to offer a new methodological framework for query relaxation.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 1998년도 봄 학술발표회 논문집(I)
• /
• pp.333-338
• /
• 1998

Deflections due to warping are frequently ignored in design calculation. For thin member, shrinkage deflection results in important and objectionable additions to the dead load deflection. Thus it may be desirable to consider warping effects due to shrinkage for thin member. Some methods for computing shrinkage curvature have been proposed by many researchers. The approximate methods widely used in the recent years are the equivalent tensile force method. Miller's method and Branson's method (an empirical method based on Miller's approach extended to include doubly reinforced beams). These method were somewhat oversimplified and could be too conservative in the case of well cured concrete structure. In this paper, the approximate method for computing shrinkage curvature are reviewed and new approximate method based on the Age-Adjusted Effective Modulus method is proposed.

• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.1021-1035
• /
• 2008

In this paper, we analyze an N-design call center with skill-based routing, in which one pool of agents handles two types of calls and another pool of agents handles only one type of calls. The approximate analysis is motivated by a computational complexity that has been observed in the direct stochastic approach and numerical method for finding performance measures. The workforce staffing policy is very important to the successful management of call centers. So the allocation scheduling of the agents can be considered as the optimization problem of the corresponding queueing system to the call center. We use a decomposition algorithm which divides the state space of the queueing system into the subspaces for the approximate analysis of the N-design call center with two different types of agents. We also represent some numerical examples and show the impact of the system parameters on the performance measures.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2003년도 춘계 학술발표회 논문집
• /
• pp.167-170
• /
• 2003

We develop semiparametric methods for matched case-control studies using regression splines. Three methods are developed: an approximate crossvalidation scheme to estimate the smoothing parameter inherent in regression splines, as well as Monte Carlo Expectation Maximization (MCEM) and Bayesian methods to fit the regression spline model. We compare the approximate cross-validation approach, MCEM and Bayesian approaches using simulation, showing that they appear approximately equally efficient, with the approximate cross-validation method being computationally the most convenient. An example from equine epidemiology that motivated the work is used to demonstrate our approaches.

• 대한기계학회논문집
• /
• 제14권5호
• /
• pp.1155-1165
• /
• 1990

본 연구에서는 롤압력과 롤토크를 예측하는 새로운 방법이 제시된다. 이 방 법은 롤 간극에서의 자세한 변형도속도의 분포를 예측할 수 있으며, 특히 롤압력과 롤 토크의 계산에 필요한 유동응력 분포도 계산할 수 있다. 이 방법을 이용하여 압연조 건과 재료성질이 롤압력, 압하력, 롤토그 등에 미치는 영향을 조사하였다. 또한, 이 방법에 의해서 예측된 결과를 참고문헌과 포항제철의 공정 데이터로부터 발췌한 실험 데이터와 비교하였으며, 유한요소 해석결과와도 비교하였다.

• Structural Engineering and Mechanics
• /
• 제38권5호
• /
• pp.651-674
• /
• 2011

This paper presents a novel method for predicting the failure probability of structural or mechanical systems subjected to random loads and material properties involving multiple design points. The method involves Multicut High Dimensional Model Representation (Multicut-HDMR) technique in conjunction with moving least squares to approximate the original implicit limit state/performance function with an explicit function. Depending on the order chosen sometimes truncated Cut-HDMR expansion is unable to approximate the original implicit limit state/performance function when multiple design points exist on the limit state/performance function or when the problem domain is large. Multicut-HDMR addresses this problem by using multiple reference points to improve accuracy of the approximate limit state/performance function. Numerical examples show the accuracy and efficiency of the proposed approach in estimating the failure probability.

• 한국정보시스템학회지:정보시스템연구
• /
• 제17권3호
• /
• pp.39-58
• /
• 2008

Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.