• Title/Summary/Keyword: Approximate Computing

Search Result 141, Processing Time 0.026 seconds

Structural analysis and optimization of large cooling tower subjected to wind loads based on the iteration of pressure

  • Li, Gang;Cao, Wen-Bin
    • Structural Engineering and Mechanics
    • /
    • v.46 no.5
    • /
    • pp.735-753
    • /
    • 2013
  • The wind load is always the dominant load of cooling tower due to its large size, complex geometry and thin-wall structure. At present, when computing the wind-induced response of the large-scale cooling tower, the wind pressure distribution is obtained based on code regulations, wind tunnel test or computational fluid dynamic (CFD) analysis, and then is imposed on the tower structure. However, such method fails to consider the change of the wind load with the deformation of cooling tower, which may result in error of the wind load. In this paper, the analysis of the large cooling tower based on the iterative method for wind pressure is studied, in which the advantages of CFD and finite element method (FEM) are combined in order to improve the accuracy. The comparative study of the results obtained from the code regulations and iterative method is conducted. The results show that with the increase of the mean wind speed, the difference between the methods becomes bigger. On the other hand, based on the design of experiment (DOE), an approximate model is built for the optimal design of the large-scale cooling tower by a two-level optimization strategy, which makes use of code-based design method and the proposed iterative method. The results of the numerical example demonstrate the feasibility and efficiency of the proposed method.

Integrated Navigation Design Using a Gimbaled Vision/LiDAR System with an Approximate Ground Description Model

  • Yun, Sukchang;Lee, Young Jae;Kim, Chang Joo;Sung, Sangkyung
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.14 no.4
    • /
    • pp.369-378
    • /
    • 2013
  • This paper presents a vision/LiDAR integrated navigation system that provides accurate relative navigation performance on a general ground surface, in GNSS-denied environments. The considered ground surface during flight is approximated as a piecewise continuous model, with flat and slope surface profiles. In its implementation, the presented system consists of a strapdown IMU, and an aided sensor block, consisting of a vision sensor and a LiDAR on a stabilized gimbal platform. Thus, two-dimensional optical flow vectors from the vision sensor, and range information from LiDAR to ground are used to overcome the performance limit of the tactical grade inertial navigation solution without GNSS signal. In filter realization, the INS error model is employed, with measurement vectors containing two-dimensional velocity errors, and one differenced altitude in the navigation frame. In computing the altitude difference, the ground slope angle is estimated in a novel way, through two bisectional LiDAR signals, with a practical assumption representing a general ground profile. Finally, the overall integrated system is implemented, based on the extended Kalman filter framework, and the performance is demonstrated through a simulation study, with an aircraft flight trajectory scenario.

Multi-Dimensional Vector Approximation Tree with Dynamic Bit Allocation (동적 비트 할당을 통한 다차원 벡터 근사 트리)

  • 복경수;허정필;유재수
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.3
    • /
    • pp.81-90
    • /
    • 2004
  • Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.

  • PDF

New Inference for a Multiclass Gaussian Process Classification Model using a Variational Bayesian EM Algorithm and Laplace Approximation

  • Cho, Wanhyun;Kim, Sangkyoon;Park, Soonyoung
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.4
    • /
    • pp.202-208
    • /
    • 2015
  • In this study, we propose a new inference algorithm for a multiclass Gaussian process classification model using a variational EM framework and the Laplace approximation (LA) technique. This is performed in two steps, called expectation and maximization. First, in the expectation step (E-step), using Bayes' theorem and the LA technique, we derive the approximate posterior distribution of the latent function, indicating the possibility that each observation belongs to a certain class in the Gaussian process classification model. In the maximization step, we compute the maximum likelihood estimators for hyper-parameters of a covariance matrix necessary to define the prior distribution of the latent function by using the posterior distribution derived in the E-step. These steps iteratively repeat until a convergence condition is satisfied. Moreover, we conducted the experiments by using synthetic data and Iris data in order to verify the performance of the proposed algorithm. Experimental results reveal that the proposed algorithm shows good performance on these datasets.

Dynamically Adaptive Finite Element Mesh Generation Schemes

  • Yoon, Chong-Yul;Park, Joon-Seok
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.23 no.6
    • /
    • pp.659-665
    • /
    • 2010
  • The finite element method(FEM) is proven to be an effective approximate method of structural analysis if proper element types and meshes are chosen, and recently, the method is often applied to solve complex dynamic and nonlinear problems. A properly chosen element type and mesh yields reliable results for dynamic finite element structural analysis. However, dynamic behavior of a structure may include unpredictably large strains in some parts of the structure, and using the initial mesh throughout the duration of a dynamic analysis may include some elements to go through strains beyond the elements' reliable limits. Thus, the finite element mesh for a dynamic analysis must be dynamically adaptive, and considering the rapid process of analysis in real time, the dynamically adaptive finite element mesh generating schemes must be computationally efficient. In this paper, a computationally efficient dynamically adaptive finite element mesh generation scheme for dynamic analyses of structures is described. The concept of representative strain value is used for error estimates and the refinements of meshes use combinations of the h-method(node movement) and the r-method(element division). The shape coefficient for element mesh is used to correct overly distorted elements. The validity of the scheme is shown through a cantilever beam example under a concentrated load with varying values. The example shows reasonable accuracy and efficient computing time. Furthermore, the study shows the potential for the scheme's effective use in complex structural dynamic problems such as those under seismic or erratic wind loads.

Measurement of the Electrode Reduction Velocities and Studies on the Simplified Measurements of the Reaction Constant used D.M.E. (Polarography에 의한 反應速度側定과 簡易速度式에 대한 硏究)

  • Hwang, Jung-Euy;Kim, Jae-Hang
    • Journal of the Korean Chemical Society
    • /
    • v.10 no.4
    • /
    • pp.175-180
    • /
    • 1966
  • The electrode reduction velocity constants of Calcium, Nickel and Manganese (Zinc) ions in various supporting electrolyte solutions and temperatures were measured by polarography. The rate constants of those ions calculated by Delahay's graphimetric method and Koutecky's method were matched in 50% of experimental error. This error would be accountable because of the application of thier approximate method. But there are magnificent differences between those values and Randles and Sentioomerton's. We, also, have attempted to deduce the simplified relation between velocity constant and electrocappilary characteristics, computing the velocity constant simply and rapidly, on which Kambara, lshii and Imai, Adachi had studied and established thier related equations using parameter x, y and z, for some limited range of x. And we have extended the equation to the wider range of y value than they did for the above mentioned ions.

  • PDF

An Implicit Numerical Method for Two-Dimensional Tidal Computation (음해법에 의한 2차원 조류유동 계산법)

  • Sun-Young Kim;Mu-Seok Song
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.35 no.1
    • /
    • pp.1-14
    • /
    • 1998
  • A two-dimensional numerical model for tidal currents based on the depth averaged equation is developed. The mode1 employs a rectangular grid system for its simplicity in the application of complicate coastal shore lines. To raise computing efficiency, implicit approximate factorization scheme is implemented in solving governing equations. An upwind-differencing is used to discretize convective terms, which provides a numerical dissipation automatically and suppresses any oscillations caused by nonlinear instabilities. Some numerical tests are made against the analytic solutions of a linearized shallow water equation to validate the developed numerical scheme, and comparisons of the model prediction with the analytic solution are satisfactory. As a real application, the tidal currents are computed on the Inchon area where the tidal currents are important for the design of new canal which is under construction.

  • PDF

Study on the Reduced System Based on the Sub-Domain Method (영역분할 기법에 기초한 축소시스템 구축에 관한 연구)

  • Kim, Hyun-Gi;Cho, Maeng-Hyo;Kim, Hyuk;Choi, Hyoung-Gil;Choi, Jae-Rack
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.9 s.252
    • /
    • pp.1062-1069
    • /
    • 2006
  • Reduction schemes approximate the lower eigenvalues that represent the global behavior of the structures. But, they are not efficient to be applied to large-scaled problems because these schemes require considerable amount of computing time in constructing reduced one from the original large-scaled systems. In addition, the selection of the primary degrees of freedom might be localized to cause the excessive emphasis of the lower mode or lost of the important modes. In the present study, a new reduction method combined with the subdomain method is proposed. For the construction of the final reduced system the system of each domain subdivided into primary, slave and interface degrees of freedom. It is remarkably efficient and accurate comparable to full-scale system. Numerical examples demonstrate that the proposed method saves computational cost effectively and provides a reduced system which predicts accurate eigen-pairs of global system.

The Measurement of the Volume and Surface Area of an Object based on Polyhedral Method (다면체기법에 의한 입체의 최적 체적 및 표면적 측정)

  • Woo, Kwang-Bang;Chin, Young-Min;Park, Sang-On
    • Proceedings of the KIEE Conference
    • /
    • 1987.07a
    • /
    • pp.311-315
    • /
    • 1987
  • In this paper an efficient algorithm to estimate the volume and surface area and the reconstruction algorithm for 3-dimensional graphics are presented. The graph theory is used to estimate the optimal quantitative factors. To improve the computing efficiency, the algorithm to get proper contour points is performed by applying several tolerances. The search and the given arc cost is limited according to the change of curvature of the cross-sectional contour. For mathematical model, these algorithms for volume estimation based on polyhedral approximation are applied to the selected optimal surface. The results show that the values of the volume and surface area for tolerances 1.0005, 1.001 and 1.002 approximate to values for tolerances 1.000 resulting in small errors. The reconstructed three-dimensional images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increasing.

  • PDF

Trivariate B-spline Approximation of Spherical Solid Objects

  • Kim, Junho;Yoon, Seung-Hyun;Lee, Yunjin
    • Journal of Information Processing Systems
    • /
    • v.10 no.1
    • /
    • pp.23-35
    • /
    • 2014
  • Recently, novel application areas in digital geometry processing, such as simulation, dynamics, and medical surgery simulations, have necessitated the representation of not only the surface data but also the interior volume data of a given 3D object. In this paper, we present an efficient framework for the shape approximations of spherical solid objects based on trivariate B-splines. To do this, we first constructed a smooth correspondence between a given object and a unit solid cube by computing their harmonic mapping. We set the unit solid cube as a rectilinear parametric domain for trivariate B-splines and utilized the mapping to approximate the given object with B-splines in a coarse-to-fine manner. Specifically, our framework provides user-controllability of shape approximations, based on the control of the boundary condition of the harmonic parameterization and the level of B-spline fitting. Experimental results showed that our method is efficient enough to compute trivariate B-splines for several models, each of whose topology is identical to a solid sphere.