• Title/Summary/Keyword: Size computation

Search Result 632, Processing Time 0.021 seconds

A STUDY ON IMPROVED DESIGN OF SMALL SIZE TURBO-COMPRESSOR USING COMPUTATIONAL FLUID ANALYSIS (유동해석을 통한 소형 터보압축기 성능 개선 설계에 관한 연구)

  • Kim, Seung-Min
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2010.05a
    • /
    • pp.142-146
    • /
    • 2010
  • This study presents the design of small size turbo-compressor to increase the performance using computational fluid analysis. A three dimensional computation was conducted changing the main parameters of impeller blade and diffuser shape, respectively, and the design was performed on a basis analysis of result of that. As a result, the Improved shapes show the increase of efficiency in comparison with the existing shape. This study will be used as useful reference data to establish the design concept of the small size turbo-compressor and to improve its performance.

  • PDF

Assessment of speckle image through particle size and image sharpness

  • Qian, Boxing;Liang, Jin;Gong, Chunyuan
    • Smart Structures and Systems
    • /
    • v.24 no.5
    • /
    • pp.659-668
    • /
    • 2019
  • In digital image correlation, speckle image is closely related to the measurement accuracy. A practical global evaluation criterion for speckle image is presented. Firstly, based on the essential factors of the texture image, both the average particle size and image sharpness are used for the assessment of speckle image. The former is calculated by a simplified auto-covariance function and Gaussian fitting, and the latter by focusing function. Secondly, the computation of the average particle size and image sharpness is verified by numerical simulation. The influence of these two evaluation parameters on mean deviation and standard deviation is discussed. Then, a physical model from speckle projection to image acquisition is established. The two evaluation parameters can be mapped to the physical devices, which demonstrate that the proposed evaluation method is reasonable. Finally, the engineering application of the evaluation method is pointed out.

Fast computation method for the voltage-current analysis on the rectangular power-ground plane (직사각형의 전력-접지층에 대한 전압전류 특성해석을 위한 빠른 계산방법)

  • Suh, Young-Suk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.140-145
    • /
    • 2005
  • The existing analytical expression for the voltage between the power and ground plane consist of metal-dielectric-metal board is expressed in the two dimensional infinite series. To reduce the computation time, the two dimensional infinite series is converted to the one dimensional infinite series using the summation formula of Fourier series. We applied these equations to the analysis of voltage between the $9‘{\times}4'$ size power-ground plane. The derived one dimensional infinite series shows the more rapid convergency and the more accurate result than the two dimensional infinite series. This equation can be applied to the power-ground plane analysis which needs a lot of the repeating computation.

Hierarchical Measurement System Design by System Partitioning (계통 분할에 의한 계층적 측정 시스템 설계)

  • 문영현;최상봉;박영문;추진부
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.5
    • /
    • pp.261-271
    • /
    • 1988
  • This paper presents a hierarchical algorithm of the measurement system design by system partitioning. With the increase of system size, the conventional algorithms of the optimal measurement system design confront the problems of excessive memory requirements, long computation time and cumulative computation errors. In order to overcome these problems, a hierarchical approach by system partitioning is proposed with the introduction of equivalent measurements for all the extemal measurements. This approach has the advantage of remarkable reduction in computation time and memory requirements, and guarantees sufficient calculation accuracy in its application to large power systems. The proposed algorithm has been tested for various systems, which shows its applicability to practical power systems.

A SoC design and implementation for JPEG 2000 Floating Point Filter (JPEG 2000 부동소수점 연산용 Filter의 SoC 설계 및 구현)

  • Chang Jong-Kwon
    • The KIPS Transactions:PartA
    • /
    • v.13A no.3 s.100
    • /
    • pp.185-190
    • /
    • 2006
  • JPEG 2000 is used as an alternative to solve the blocking artifact problem with the existing still image compression JPEG algorithm. However, it has shortcomings such as longer floating point computation time and more complexity in the procedure of enhancing the image compression rate and decompression rate. To compensate for these we implemented with hardware the JPEG 2000 algorithm's filter part which requires a lot of floating point computation. This DWT Filter[1] chip is designed on the basis of Daubechies 9/7 filter[6] and is composed of 3-stage pipeline system to optimize the performance and chip size. Our implemented Filter was 7 times faster than software based Filter in the floating point computation.

Remaining life prediction of concrete structural components accounting for tension softening and size effects under fatigue loading

  • Murthy, A. Rama Chandra;Palani, G.S.;Iyer, Nagesh R.
    • Structural Engineering and Mechanics
    • /
    • v.32 no.3
    • /
    • pp.459-475
    • /
    • 2009
  • This paper presents analytical methodologies for remaining life prediction of plain concrete structural components considering tension softening and size effects. Non-linear fracture mechanics principles (NLFM) have been used for crack growth analysis and remaining life prediction. Various tension softening models such as linear, bi-linear, tri-linear, exponential and power curve have been presented with appropriate expressions. Size effect has been accounted for by modifying the Paris law, leading to a size adjusted Paris law, which gives crack length increment per cycle as a power function of the amplitude of a size adjusted stress intensity factor (SIF). Details of tension softening effects and size effect in the computation of SIF and remaining life prediction have been presented. Numerical studies have been conducted on three point bending concrete beams under constant amplitude loading. The predicted remaining life values with the combination of tension softening & size effects are in close agreement with the corresponding experimental values available in the literature for all the tension softening models.

Computation of structural intensity for plates with multiple cutouts

  • Khun, M.S.;Lee, H.P.;Lim, S.P.
    • Structural Engineering and Mechanics
    • /
    • v.16 no.5
    • /
    • pp.627-641
    • /
    • 2003
  • The structural intensity fields of rectangular plates with single cutout and multiple cutouts are studied. The main objective is to examine the effect of the presence of cutouts on the flow pattern of vibrational energy from the source to the sink on a rectangular plate. The computation of the structural intensity is carried out using the finite element method. The magnitude of energy flow is significantly larger at the edges on the plate near the cutout boundary parallel to the energy flow. The effects of cutouts with different shape and size at different positions on structural intensity of a rectangular plate are presented and discussed. A case study on a plate with two cutouts is also presented.

Faster Ate Pairing Computation over Pairing-Friendly Ellipitic Curves Using GLV Decomposition

  • Eom, Soo Kyung;Lee, Eunjeong;Lee, Hyang-Sook
    • ETRI Journal
    • /
    • v.35 no.5
    • /
    • pp.880-888
    • /
    • 2013
  • The preexisting pairings ate, $ate_i$, R-ate, and optimal-ate use q-expansion, where q is the size of the defining field for the elliptic curves. Elliptic curves with small embedding degrees only allow a few of these pairings. In such cases, efficiently computable endomorphisms can be used, as in [11] and [12]. They used the endomorphisms that have characteristic polynomials with very small coefficients, which led to some restrictions in finding various pairing-friendly curves. To construct more pairing-friendly curves, we consider ${\mu}$-expansion using the Gallant-Lambert-Vanstone (GLV) decomposition method, where ${\mu}$ is an arbitrary integer. We illustrate some pairing-friendly curves that provide more efficient pairing from the ${\mu}$-expansion than from the ate pairing. The proposed method can achieve timing results at least 20% faster than the ate pairing.

VARIABLE TIME-STEPPING HYBRID FINITE DIFFERENCE METHODS FOR PRICING BINARY OPTIONS

  • Kim, Hong-Joong;Moon, Kyoung-Sook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.2
    • /
    • pp.413-426
    • /
    • 2011
  • Two types of new methods with variable time steps are proposed in order to valuate binary options efficiently. Type I changes adaptively the size of the time step at each time based on the magnitude of the local error, while Type II combines two uniform meshes. The new methods are hybrid finite difference methods, namely starting the computation with a fully implicit finite difference method for a few time steps for accuracy then performing a ${\theta}$-method during the rest of computation for efficiency. Numerical experiments for standard European vanilla, binary and American options show that both Type I and II variable time step methods are much more efficient than the fully implicit method or hybrid methods with uniform time steps.

An Algorithm for Optimal Allocation of Spare Parts

  • Jee, Man-Won
    • Journal of the military operations research society of Korea
    • /
    • v.9 no.1
    • /
    • pp.29-49
    • /
    • 1983
  • The algorithm developed in this paper utilized kettelle's [1] idea of the undominated allocation sequence and his way of tableau computation to solve the more general spares allocation problem in the system availability optimization. The algorithm is to optimally allocate resources to the independent modules which are connected to be series/parallel/mixed system configurations. It has advantages over the standard dynamic programming algorithm by eliminating the need for backtracking and by solving the allocation problem for any budget size. By careful heuristic inspection the algorithm can be made very efficient for manual calculations because large blocks of cells can be eliminated from computation. A numerical example is provided to illustrate the allocation algorithm.

  • PDF