• Title/Summary/Keyword: discretization

Search Result 693, Processing Time 0.023 seconds

Development of Structure Analysis Program for Jointed Concrete Pavement Applying Load Discretization Algorithm (하중변환 알고리듬을 적용한 줄눈 콘크리트 포장해석 프로그램 개발)

  • Yun, Tae-Young;Kim, Ji-Won;Cho, Yoon-Ho
    • International Journal of Highway Engineering
    • /
    • v.5 no.4 s.18
    • /
    • pp.1-11
    • /
    • 2003
  • Recently, the new pavement design method considering Korean environment and the specification for improving performance of pavement are being developed in Korea. The Jointed Concrete Pavement Program Applying Load Discretization Algorithm (called HEART-JCP) is one of the results of Korea Pavement Research Project in Korea. HEART-JCP program is developed to analyze various loading condition using the load discretization algorithm without mesh refinement. In addition, it can be modified easily into multi-purpose concrete pavement nidyses program because of the modularized structure characteristic of HEART-JCP. The program consists of basic program part and load discretization part. In basic program part, the displacement and stress are computed in the concrete slab, sub-layer, and dowel bar, which are modeled with plate/shell element, spring element and beam element. In load discretization program part, load discretization algorithm that was used for the continuum solid element is modified to analyze the model with plate and shell element. The program can analyze the distributed load, concentrated load, thermal load and body load using load discretization algorithm. From the result of verification and sensitivity study, it was known that the loading position, the magnitude of load, and the thickness of slab were the major factors of concrete pavement behavior as expected. Since the result of the model developed is similar to the results of Westergaard solution and ILLISLAB, the program can be used to estimate the behavior of jointed concrete pavement reasonably.

  • PDF

Effect of Grid, Turbulence Modeling and Discretization on the Solution of CFD (격자, 난류모형 및 이산화 방법이 유동해석 결과에 미치는 영향)

  • Park, Dong-Woo;Yoon, Hyun-Sik
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.20 no.4
    • /
    • pp.419-425
    • /
    • 2014
  • The current work investigated the variation of numerical solutions according to the grid number, the distance of the first grid point off the ship surface, turbulence modeling and discretization. The subject vessel is KVLCC. A commercial code, Gridgen V15 and FLUENT were used the generation of the ship hull surface and spatial system and flow computation. The first part of examination, the effect of solutions were accessed depending on the grid number, turbulence modeling and discretization. The second part was focus on the suitable selection of the distance of the first grid point off the ship surface: $Y_P+$. When grid number and discretization were fixed the same value, the friction resistance showed differences within 1 % but the pressure resistance showed big differences 9 % depending on the turbulence modeling. When $Y_P+$ were set 30 and 50 for the same discretization, friction resistance showed almost same results within 1 % according to the turbulence modeling. However, when $Y_P+$ were fixed 100, friction resistance showed more differences of 3 % compared to $Y_P+$ of 30 and 50. Whereas pressure resistance showed big differences of 10 % regardless of turbulence modeling. When turbulence modeling and discretization were set the same value, friction, pressure and total resistance showed almost same result within 0.3 % depending on the grid number. Lastly, When turbulence modeling and discretization were fixed the same value, the friction resistance showed differences within 5~8 % but the pressure resistance showed small differences depending on the $Y_P+$.

Incremental Generation of A Decision Tree Using Global Discretization For Large Data (대용량 데이터를 위한 전역적 범주화를 이용한 결정 트리의 순차적 생성)

  • Han, Kyong-Sik;Lee, Soo-Won
    • The KIPS Transactions:PartB
    • /
    • v.12B no.4 s.100
    • /
    • pp.487-498
    • /
    • 2005
  • Recently, It has focused on decision tree algorithm that can handle large dataset. However, because most of these algorithms for large datasets process data in a batch mode, if new data is added, they have to rebuild the tree from scratch. h more efficient approach to reducing the cost problem of rebuilding is an approach that builds a tree incrementally. Representative algorithms for incremental tree construction methods are BOAT and ITI and most of these algorithms use a local discretization method to handle the numeric data type. However, because a discretization requires sorted numeric data in situation of processing large data sets, a global discretization method that sorts all data only once is more suitable than a local discretization method that sorts in every node. This paper proposes an incremental tree construction method that efficiently rebuilds a tree using a global discretization method to handle the numeric data type. When new data is added, new categories influenced by the data should be recreated, and then the tree structure should be changed in accordance with category changes. This paper proposes a method that extracts sample points and performs discretiration from these sample points to recreate categories efficiently and uses confidence intervals and a tree restructuring method to adjust tree structure to category changes. In this study, an experiment using people database was made to compare the proposed method with the existing one that uses a local discretization.

Modified Finite Volume Time Domain Method for Efficient Prediction of Radar Cross Section at High Frequencies

  • Chatterjee, Avijit;Myong, Rho-Shin
    • Journal of electromagnetic engineering and science
    • /
    • v.8 no.3
    • /
    • pp.100-109
    • /
    • 2008
  • The finite volume time domain(FVTD) technique faces serious limitations in simulating electromagnetic scattering at high frequencies due to requirements related to discretization. A modified FVTD method is proposed for electrically large, perfectly conducting scatterers by partially incorporating a time-domain physical optics(PO) approximation for the surface current. Dominant specular returns in the modified FVTD method are modeled using a PO approximation of the surface current allowing for a much coarser discretization at high electrical sizes compared to the original FVTD scheme. This coarse discretization can be based on the minimum surface resolution required for a satisfactory numerical evaluation of the PO integral for the scattered far-field. Non-uniform discretization and spatial accuracy can also be used in the context of the modified FVTD method. The modified FVTD method is aimed at simulating electromagnetic scattering from geometries containing long smooth illuminated sections with respect to the incident wave. The computational efficiency of the modified FVTD method for higher electrical sizes are shown by solving two-dimensional test cases involving electromagnetic scattering from a circular cylinder and a symmetric airfoil.

Discretization of Continuous-Valued Attributes for Classification Learning (분류학습을 위한 연속 애트리뷰트의 이산화 방법에 관한 연구)

  • Lee, Chang-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1541-1549
    • /
    • 1997
  • Many classification algorithms require that training examples contain only discrete values. In order to use these algorithms when some attributes have continuous numeric values, the numeric attributes must be converted into discrete ones. This paper describes a new way of discretizing numeric values using information theory. Our method is context-sensitive in the sense that it takes into account the value of the target attribute. The amount of information each interval gives to the target attribute is measured using Hellinger divergence, and the interval boundaries are decided so that each interval contains as equal amount of information as possible. In order to compare our discretization method with some current discretization methods, several popular classification data sets are selected for experiment. We use back propagation algorithm and ID3 as classification tools to compare the accuracy of our discretization method with that of other methods.

  • PDF

Decomposition-based Process Planning far Layered Manufacturing of Functionally Gradient Materials (기능성 경사복합재의 적층조형을 위한 분해기반 공정계획)

  • Shin K.H.;Kim S.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.3
    • /
    • pp.223-233
    • /
    • 2006
  • Layered manufacturing(LM) is emerging as a new technology that enables the fabrication of three dimensional heterogeneous objects such as Multi-materials and Functionally Gradient Materials (FGMs). Among various types of heterogeneous objects, more attention has recently paid on the fabrication of FGMs because of their potentials in engineering applications. The necessary steps for LM fabrication of FGMs include representation and process planning of material information inside an FGM. This paper introduces a new process planning algorithm that takes into account the processing of material information. The detailed tasks are discretization (i.e., decomposition-based approximation of volume fraction), orientation (build direction selection), and adaptive slicing of heterogeneous objects. In particular, this paper focuses on the discretization process that converts all of the material information inside an FGM into material features like geometric features. It is thus possible to choose an optimal build direction among various pre-selected ones by approximately estimating build time. This is because total build time depends on the complexity of features. This discretization process also allows adaptive slicing of heterogeneous objects to minimize surface finish and material composition error. In addition, tool path planning can be simplified into fill pattern generation. Specific examples are shown to illustrate the overall procedure.

Defect Detection in Laser Welding Using Multidimensional Discretization and Event-Codification (Multidimensional Discretization과 Event-Codification 기법을 이용한 레이저 용접 불량 검출)

  • Baek, Su Jeong;Oh, Rocku;Kim, Duck Young
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.32 no.11
    • /
    • pp.989-995
    • /
    • 2015
  • In the literature, various stochastic anomaly detection methods, such as limit checking and PCA-based approaches, have been applied to weld defect detection. However, it is still a challenge to identify meaningful defect patterns from very limited sensor signals of laser welding, characterized by intermittent, discontinuous, very short, and non-stationary random signals. In order to effectively analyze the physical characteristics of laser weld signals: plasma intensity, weld pool temperature, and back reflection, we first transform the raw data of laser weld signals into the form of event logs. This is done by multidimensional discretization and event-codification, after which the event logs are decoded to extract weld defect patterns by $Na{\ddot{i}}ve$ Bayes classifier. The performance of the proposed method is examined in comparison with the commercial solution of PRECITEC's LWM$^{TM}$ and the most recent PCA-based detection method. The results show higher performance of the proposed method in terms of sensitivity (1.00) and specificity (0.98).

Discretization Behaviors of Equivalent Control Based Sliding-Mode Systems

  • Son, Sung-Han;Cho, Byung-Sun;Han, So-Hee;Park, Kang-Bak
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.425-428
    • /
    • 2004
  • In this paper, we study the discretization behaviors of the equivalent control based sliding-mode control (SMC) systems. The investigation is carried out via studying the second order linear system and some interesting dynamic properties are explored. Especially, according to the variation of system parameters, the inherent dynamical behavior of the trajectories within some specified boundaries are studied. From this result, the boundaries of system state using symbolic dynamics approach are first proposed. Simulations are presented to verify the theoretical results.

  • PDF

A discretization method of the three-dimensional poisson's equation with excellent convergence characteristics (우수한 수렴특성을 갖는 3차원 포아송 방정식의 이산화 방법)

  • 김태한;이은구;김철성
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.34D no.8
    • /
    • pp.15-25
    • /
    • 1997
  • The integration method of carier concentrations to redcue the discretization error of th box integratio method used in the discretization of the three-dimensional poisson's equation is presented. The carrier concentration is approximated in the closed form as an exponential function of the linearly varying potential in the element. The presented method is implemented in the three-dimensional poisson's equation solver running under the windows 95. The accuracy and the convergence chaacteristics of the three-dimensional poisson's equation solver are compared with those of DAVINCI for the PN junction diode and the n-MOSFET under the thermal equilibrium and the DC reverse bias. The potential distributions of the simulatied devices from the three-dimensional poisson's equation solver, compared with those of DAVINCI, has a relative error within 2.8%. The average number of iterations needed to obtain the solution of the PN junction diode and the n-MOSFET using the presented method are 11.47 and 11.16 while the those of DAVINCI are 21.73 and 23.0 respectively.

  • PDF