• Title/Summary/Keyword: incremental construction algorithm

Search Result 17, Processing Time 0.026 seconds

The elastoplastic formulation of polygonal element method based on triangular finite meshes

  • Cai, Yong-Chang;Zhu, He-Hua;Guo, Sheng-Yong
    • Structural Engineering and Mechanics
    • /
    • v.30 no.1
    • /
    • pp.119-129
    • /
    • 2008
  • A small strain and elastoplastic formulation of Polygonal Element Method (PEM) is developed for efficient analysis of elastoplastic solids. In this work, the polygonal elements are constructed based on traditional triangular finite meshes. The construction method of polygonal mesh can directly utilize the sophisticated triangularization algorithm and reduce the difficulty in generating polygonal elements. The Wachspress rational finite element basis function is used to construct the approximations of polygonal elements. The incremental variational form and a von Mises type model are used for non-linear elastoplastic analysis. Several small strain elastoplastic numerical examples are presented to verify the advantages and the accuracy of the numerical formulation.

Uncertainty Analysis in Hydrologic and Climate Change Impact Assessment in Streamflow of Upper Awash River Basin

  • Birhanu, Dereje;Kim, Hyeonjun;Jang, Cheolhee;Park, Sanghyun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.327-327
    • /
    • 2019
  • The study will quantify the total uncertainties in streamflow and precipitation projections for Upper Awash River Basin located in central Ethiopia. Three hydrological models (GR4J, CAT, and HBV) will be used to simulate the streamflow considering two emission scenarios, six high-resolution GCMs, and two downscaling methods. The readily available hydrometeorological data will be applied as an input to the three hydrological models and the potential evapotranspiration will be estimated using the Penman-Monteith Method. The SCE-UA algorithm implemented in PEST will be used to calibrate the three hydrological models. The total uncertainty including the incremental uncertainty at each stage (emission scenarios and model) will be presented after assessing a total of 24 (=$2{\times}6{\times}2$) high-resolution precipitation projections and 72 (=$2{\times}6{\times}2{\times}3$) streamflow projections for the study basin. Finally, the primary causes that generate uncertainties in future climate change impact assessments will be identified and a conclusion will be made based on the finding of the study.

  • PDF

IRFP-tree: Intersection Rule Based FP-tree (IRFP-tree(Intersection Rule Based FP-tree): 메모리 효율성을 향상시키기 위해 교집합 규칙 기반의 패러다임을 적용한 FP-tree)

  • Lee, Jung-Hun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.3
    • /
    • pp.155-164
    • /
    • 2016
  • For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

An Economic Assessment of Large-scale Battery Energy Storage Systems in the Energy-Shift Application to Korea Power System (장주기 대용량 전력저장장치의 부하이전에 대한 실계통 적용 경제성 평가 연구)

  • Park, Jong-Bae;Park, Yong-Gi;Roh, Jae-Hyung;Chang, Byung-Hoon;Toon, Yong-Beum
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.3
    • /
    • pp.384-392
    • /
    • 2015
  • This paper presents an economic assessment of large-scale Li-ion battery energy storage systems applied to Korean power system. There are many applications of the battery energy storage systems (BESSs) and they can provide various benefits to power systems. We consider BESSs to the energy time-shift application to Korean power system and evaluate the benefits from the application of BESS in the social perspective. The mixed integer programming (MIP) algorithm is used to resolve the optimal operation schedule of the BESS. The social benefits can include the savings of the fuel cost from generating units, deferral effects of the generation capacity, delay of transmission and distribution infra construction, and incremental CO2 emission cost impacts, etc. The economic evaluation of the BESS is separately applied into Korean power systems of the Main-land and Jeju island to reflect the differences of the load and generation patterns.

Calibration of a Network Link Travel Cost Function with the Harmony Search Algorithm (화음탐색법을 이용한 교통망 링크 통행비용함수 정산기법 개발)

  • Kim, Hyun Myung;Hwang, Yong Hwan;Yang, In Chul
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.5
    • /
    • pp.71-82
    • /
    • 2012
  • Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.

A Metrics-Based Approach to the Reorganization of Class Hierarchy Structures (클래스계층구조의 품질평가척도를 기반으로 하는 재구성기법)

  • Hwang, Sun-Hyung;Yang, Hea-Sool;Hwang, Young-Sub
    • The KIPS Transactions:PartD
    • /
    • v.10D no.5
    • /
    • pp.859-872
    • /
    • 2003
  • Class hierarchies often constitute the backbone of object-oriented software. Their quality is therefore quite crucial. Building class hierarchies with good qualify is a very important and common tasks on the object oriented software development, but such hierarchies are not so easy to build. Moreover, the class hierarchy structure under construction is frequently restructured and refined until it becomes suitable for the requirement on the iterative and incremental development lifecycle. Therefore, there has been renewal of interest in all methodologies and tools to assist the object oriented developers in this task. In this paper, we define a set of quantitative metrics which provide a wav of capturing features of a rough estimation of complexity of class hierarchy structure. In addition to, we suggest a set of algorithms that transform a original class hierarchy structure into reorganized one based on the proposed metrics for class hierarchy structure. Furthermore, we also prove that each algorithm is "object-preserving". That is, we prove that the set of objects are never changed before and after applying the algorithm on a class hierarchy. The technique presented in this paper can be used as a guidelines of the construction, restructuring and refinement of class hierarchies. Moreover, the proposed set of algorithms based on metrics can be helpful for developers as an useful instrument for the object-oriented software development.velopment.

Implicit Numerical Integration of Two-surface Plasticity Model for Coarse-grained Soils (Implicit 수치적분 방법을 이용한 조립토에 관한 구성방정식의 수행)

  • Choi, Chang-Ho
    • Journal of the Korean Geotechnical Society
    • /
    • v.22 no.9
    • /
    • pp.45-59
    • /
    • 2006
  • The successful performance of any numerical geotechnical simulation depends on the accuracy and efficiency of the numerical implementation of constitutive model used to simulate the stress-strain (constitutive) response of the soil. The corner stone of the numerical implementation of constitutive models is the numerical integration of the incremental form of soil-plasticity constitutive equations over a discrete sequence of time steps. In this paper a well known two-surface soil plasticity model is implemented using a generalized implicit return mapping algorithm to arbitrary convex yield surfaces referred to as the Closest-Point-Projection method (CPPM). The two-surface model describes the nonlinear behavior of coarse-grained materials by incorporating a bounding surface concept together with isotropic and kinematic hardening as well as fabric formulation to account for the effect of fabric formation on the unloading response. In the course of investigating the performance of the CPPM integration method, it is proven that the algorithm is an accurate, robust, and efficient integration technique useful in finite element contexts. It is also shown that the algorithm produces a consistent tangent operator $\frac{d\sigma}{d\varepsilon}$ during the iterative process with quadratic convergence rate of the global iteration process.