• Title/Summary/Keyword: approximate method

Search Result 2,017, Processing Time 0.027 seconds

Approximate Solutions for Laminar Film Condensation on a Flat Plate (평판에서 층류 막응축의 근사해)

  • Lee, S.H.;Kweon, J.Y.;Lee, E.S.
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.3 no.4
    • /
    • pp.215-221
    • /
    • 1991
  • Laminar film condensation of a saturated vapor in forced flow over a flat plate is analyzed by using integral method. Laminar condensate film is so thin that the inertia and thermal convection terms in liquid flow can be neglected. Approximate solutions for water are presented and well agreed with the similarity solutions over the wide range of physical parameter, Cp1(Ts-Tw)/Pr.hfg. For the strong condensation case, it is found that magnitude of the interfacial shear stress at the liquid-vapor interphase boundary is approximately equal to the momentum transferred by condensation, i.e., ${\tau}_i{\simeq}\dot{m}(U_O-U_i)$.

  • PDF

Approximate Approach to Calculating the Order Fill Rate under Purchase Dependence (구매종속성이 존재하는 상황에서 주문충족율을 계산하는 근사법에 관한 연구)

  • Park, Changkyu;Seo, Junyong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.2
    • /
    • pp.35-51
    • /
    • 2016
  • This paper proposes a new approximate approach to calculate the order fill rate and the probability of filling an entire customer order immediately from the shelf in a business environment under purchase dependence characterized by customer purchase patterns observed in such areas as marketing, manufacturing systems, and distribution systems. The new approximate approach divides customer orders into item orders and calculates fill rates of all order types to approximate the order fill rate. We develop a greed iterative search algorithm (GISA) based on the Gauss-Seidel method to avoid dimensionality and prevent the solution divergence for larger instances. Through the computational analysis that compares the GISA with the simulation, we demonstrate that the GISA is a dependable algorithm for deriving the stationary joint distribution of on-hand inventories in the type-K pure system. We also present some managerial insights.

AN APPROXIMATE ANALYTICAL SOLUTION OF A NONLINEAR HYDRO-THERMO COUPLED DIFFUSION EQUATION

  • Lee, Jeong-woo;Cho, Won-cheol
    • Water Engineering Research
    • /
    • v.2 no.3
    • /
    • pp.187-196
    • /
    • 2001
  • An approximate analytical solution of a nonlinear hydro-thermo coupled diffusion equation is derived using the dimensionless form of the equation and transformation method. To derive an analytical solution, it is drastically assumed that the product of first order derivatives in the non-dimensionalized governing equation has little influence on the solution of heat and moisture behavior problem. The validity of this drastic assumption is demonstrated. Some numerical simulation is performed to investigate the applicability of a derived approximate analytical solution. The results show a good agreement between analytical and numerical solutions. The proposed solution may provide a useful tool in the verification process of the numerical models. Also, the solution can be used for the analysis of one-dimensional coupled heat and moisture movements in unsaturated porous media.

  • PDF

APPROXIMATE CONFIDENCE LIMITS OF THE RELIABILITY PERFORMANCES FOR A COLD STANDBY SERIES SYSTEM

  • SHI YIMIN;SRI XIAOLIN;XU YONG
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.439-445
    • /
    • 2005
  • This paper is to investigate the approximate confidence limits of the reliability performances (such as failure rate, reliability function and average life) for a cold standby series system. The Bayesian approximate upper confidence limit of failure rate is obtained firstly, and next Bayesian approximate lower confidence limits for reliability function and average life are presented. The expressions for calculating Bayesian lower confidence limits of the reliability function and average life are also obtained, and an illustrative example is examined numerically by means of the Monte-Carlo simulation. Finally, the accuracy of confidence limits is discussed.

Design of Experiment for kriging (크리깅의 실험계획법)

  • Jung, Jae-Joon;Lee, Chang-Seob;Lee, Tae-Hee
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1846-1851
    • /
    • 2003
  • Approximate optimization has become popular in engineering field such as MDO and Crash analysis which is time consuming. To accomplish efficient approximate optimization, accuracy of approximate model is very important. As surrogate model, Kriging have been widely used approximating highly nonlinear system . Because Kriging employs interpolation method, it is adequate for deterministic computer simulation. Because there are no random errors and measurement errors in deterministic computer simulation, instead of classical DOE ,space filling experiment design which fills uniformly design space should be applied. In this work, various space filling designs such as maximin distance design, maximum entropy design are reviewed. And new design improving maximum entropy design is suggested and compared.

  • PDF

A fast approximate fitting for mixture of multivariate skew t-distribution via EM algorithm

  • Kim, Seung-Gu
    • Communications for Statistical Applications and Methods
    • /
    • v.27 no.2
    • /
    • pp.255-268
    • /
    • 2020
  • A mixture of multivariate canonical fundamental skew t-distribution (CFUST) has been of interest in various fields. In particular, interest in the unsupervised learning society is noteworthy. However, fitting the model via EM algorithm suffers from significant processing time. The main cause is due to the calculation of many multivariate t-cdfs (cumulative distribution functions) in E-step. In this article, we provide an approximate, but fast calculation method for the in univariate fashion, which is the product of successively conditional univariate t-cdfs with Taylor's first order approximation. By replacing all multivariate t-cdfs in E-step with the proposed approximate versions, we obtain the admissible results of fitting the model, where it gives 85% reduction time for the 5 dimensional skewness case of the Australian Institution Sport data set. For this approach, discussions about rough properties, advantages and limits are also presented.

APPROXIMATE CONTROLLABILITY FOR SEMILINEAR INTEGRO-DIFFERENTIAL CONTROL EQUATIONS WITH QUASI-HOMOGENEOUS PROPERTIES

  • Kim, Daewook;Jeong, Jin-Mun
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.3
    • /
    • pp.189-207
    • /
    • 2021
  • In this paper, we consider the approximate controllability for a class of semilinear integro-differential functional control equations in which nonlinear terms of given equations satisfy quasi-homogeneous properties. The main method used is to make use of the surjective theorems that is similar to Fredholm alternative in the nonlinear case under restrictive assumptions. The sufficient conditions for the approximate controllability is obtain which is different from previous results on the system operator, controller and nonlinear terms. Finally, a simple example to which our main result can be applied is given.

A Practical Approximate Sub-Sequence Search Method for DNA Sequence Databases (DNA 시퀀스 데이타베이스를 위한 실용적인 유사 서브 시퀀스 검색 기법)

  • Won, Jung-Im;Hong, Sang-Kyoon;Yoon, Jee-Hee;Park, Sang-Hyun;Kim, Sang-Wook
    • Journal of KIISE:Databases
    • /
    • v.34 no.2
    • /
    • pp.119-132
    • /
    • 2007
  • In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.

Evaluation of moment amplification factors for RCMRFs designed based on Iranian national building code

  • Habibi, Alireza;Izadpanah, Mehdi;Rohani, Sina
    • Advances in concrete construction
    • /
    • v.9 no.1
    • /
    • pp.23-31
    • /
    • 2020
  • Geometric nonlinearity can significantly affect load-carrying capacity of slender columns. Dependence of structural stability on columns necessitates the consideration of second-order effects in the design process of columns, appropriately. On the whole, the design codes present a simplified procedure for second order analysis of slender columns. In this approximate method, the end moments of columns resulted from linear analysis (first-order) are multiplied by the recommended moment amplification factors of codes to achieve magnified moments of the second-order analysis. In the other approach, the equilibrium equations are directly solved for the deformed configuration of structure, so the resulting moments and deflections contain the influence of slenderness and increase more rapidly than do loads. The aim of this study is to evaluate the accuracy of moment amplification factors of Iranian national building code whose provisions are similar to the ACI requirement. Herein, finite element method is used to achieve magnified end moments of reinforced concrete moment resisting frames, and the outcomes are compared with the moments acquired based on the proposed approximate method by Iranian national building code. The results show that the approximate method of Iranian code for calculating magnified moments has significant errors for both unbraced and braced columns.

Generating of Pareto frontiers using machine learning (기계학습을 이용한 파레토 프런티어의 생성)

  • Yun, Yeboon;Jung, Nayoung;Yoon, Min
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.3
    • /
    • pp.495-504
    • /
    • 2013
  • Evolutionary algorithms have been applied to multi-objective optimization problems by approximation methods using computational intelligence. Those methods have been improved gradually in order to generate more exactly many approximate Pareto optimal solutions. The paper introduces a new method using support vector machine to find an approximate Pareto frontier in multi-objective optimization problems. Moreover, this paper applies an evolutionary algorithm to the proposed method in order to generate more exactly approximate Pareto frontiers. Then a decision making with two or three objective functions can be easily performed on the basis of visualized Pareto frontiers by the proposed method. Finally, a few examples will be demonstrated for the effectiveness of the proposed method.