• Structural Monitoring and Maintenance
• /
• v.10 no.3
• /
• pp.243-260
• /
• 2023

Indonesia has had seismic codes for earthquake-resistant structures designs since 1970 and has been updated five times to the latest in 2019. In updating the Indonesian seismic codes, seismic hazard maps for design also update, and there are changes to the Peak Ground Acceleration (PGA). Indonesian seismic design uses the concept of building performance levels consisting of Immediate occupancy (IO), Life Safety (LS), and Collapse Prevention (CP). Related to this performance level, cases still found that buildings were damaged more than their performance targets after the earthquake. Based on the above issues, this study aims to analyze the performance of base isolation design on existing target buildings and analyze the seismic fragility for a case study in Indonesia. The target building is a prototype design 8-story medium-rise residential building using the reinforced concrete moment frame structure. Seismic fragility analysis uses Incremental Dynamic Analysis (IDA) with Nonlinear Time History Analysis (NLTHA) and eleven selected ground motions based on soil classification, magnitude, fault distance, and earthquake source mechanism. The comparison result of IDA shows a trend of significant performance improvement, with the same performance level target and risk category, the base isolation structure can be used at 1.46-3.20 times higher PGA than the fixed base structure. Then the fragility analysis results show that the fixed base structure has a safety margin of 30% and a base isolation structure of 62.5% from the PGA design. This result is useful for assessing existing buildings or considering a new building's performance.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.101.2-101.2
• /
• 2013

We present a new computational fluid dynamic (CFD) simulation code. The code employs the moving and polyhedral unstructured mesh scheme, which is known as a superior approach to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for surfaces of every Voronoi cell to update the hydrodynamic states as well as to move former generated meshes. For the second-order accuracy, the MUSCL-Hancock scheme is implemented. To increase efficiency for generating Voronoi tessellation we also develop the incremental expanding method, by which the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We will discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.

• The Bulletin of The Korean Astronomical Society
• /
• v.39 no.2
• /
• pp.65.2-65.2
• /
• 2014

We present a new hydrodynamic simulation code based on the Voronoi tessellation for estimating the density precisely. The code employs both of Lagrangian and Eulerian description by adopting the movable mesh scheme, which is superior to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for all surfaces of each Voronoi cell so as to update the hydrodynamic states as well as to move current meshes. Besides, the IEM (incremental expanding method) is devised to compute the Voronoi tessellation to desired degree of speed, thereby the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2003.10a
• /
• pp.75-78
• /
• 2003

In order to describe the Bauschinger and transient behavior of orthotropic fiber-reinforced composites, a combined isotropic-kinematic hardening law based on the non-linear kinematic hardening rule was considered here, in particular, based on the Chaboche type law. In this modified constitutive law, the anisotropic evolution of the back-stress was properly accounted for. Also, to represent the orthotropy of composite materials, Hill's 1948 quadratic yield function and the orthotropic elasticity constitutive equations were utilized. Furthermore, the numerical formulation to update the stresses was also developed based on the incremental deformation theory for the boundary value problems. Numerical examples confirmed that the new law based on the anisotropic evolution of the back-stress complies well with the constitutive behavior of highly anisotropic materials such as fiber-reinforced composites.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.4
• /
• pp.17-24
• /
• 2003

본 논문에서는 주어진 경로를 따라 이동하는 관측점으로부터 다면체 모델의 윤곽선을 계산하기 위한 최적 알고리즘 (optimal algorithm)으로서 점증적 갱신 알고리즘 (incremental update algorithm)을 제안한다. 전처리 과정에서는, 윤곽선을 계산할 프레임(frame)의 갯수가 f라 할 때 각 프레임 j, 0 $\leq$ j < f,에 대해 그 전 프레임 j - 1 에서 이미 구한 윤곽선에 추가되거나 제거되어야 할 에지의 리스트를 계산한다. 이것은 모델의 각 에지가 윤곽선에 포함되기 시작하는 프레임과 윤곽선으로부터 제거되는 프레임의 범위를 계산함으로써 수행된다. 점증적 갱신 알고리즘은 전처리 과정에서 구성한 에지 리스트를 이용하여 f 프레임의 윤곽선을 효율적이고 안정적으로 추출할 수 있으며, 각 프레임마다 전 프레임의 윤곽선 에지 리스트와 여기에 추가 또는 제거되어야 할 에지의 리스트만을 검색하므로 시간 복잡도(time complexity)의 측면에서 최적 알고리즘이다.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2003.05a
• /
• pp.163-167
• /
• 2003

A novel method for 3-dimensional dynamic analysis of marine slender structure gas been developed by using Euler parameters. The Euler parameter rotation, which is being widely used in aerospace vehicle dynamics and multi-body dynamics, has been applied to elastic structure analysis. Large deformation of flexible slender structures is described by means of Euler parameters. Euler parameter method is implemented effectively in incremental-iterative algorithm for 3D dynamic analysis. The normalization constraint of Euler parameters is efficiently satisfied by means of a sequential updating method.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.5 s.170
• /
• pp.45-54
• /
• 2005

The purpose of this research is to find a simple and accurate NURBS interpolator for CNC systems such as robot, CMM and CNC machine tools. This paper presents a new design of NURBS interpolator for CNC system. The proposed algorithm used the recursive characteristics of NURBS equation, the previous incremental value and chord length for the sake of a constant chord length. Simulation study was conducted to see the performance of the proposed interpolator with reference-word and reference-pulse method. Consequently, an accurate and simple NURBS interpolator was possible for modem CNC systems.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.477-486
• /
• 1995

This paper describes and constructs object-oriented analysis models using Galois-lattices that we are always studying in discrete mathematics, shows fundamental approaches to maintain the models, analyzes the construction of object-oriented analysis models through good examples. Also, we define several properties of Galois-lattices that have binary relations between class objects, propose the incremental updating algorithms that can update the Galois-lattice whenever new classes are added. This proposal shows that in case of adding new class nodes the results from simulations can implement in constant time and have linearly the incremental structures in worst cases, and in that the growth rate of lattices is proportioned to class nodes in time complexity. This results can achieve the high understandability of object-oriented analysis models and the high traceability of maintenance models. Furthermore it is possible to make more efficient performances of class reusability in advantages of object-oriented systems and support truly the class hierarchical maintenances.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.551-562
• /
• 2006

XML query caching for XML database-backed Web applications began to be investigated recently. Despite its practical significance, efficiency of the storage schemes for cached query results has not been addressed. In this paper, we deal with the storage schemes for XML query cache. A fundamental problem that needs to be considered in designing an efficient storage structure for XML query cache is that there exist performance tradeoffs between the two major types of operations on a cached query result. The two are (1) retrieving the whole of it to return the query result and (2) updating just a small portion of it for its incremental refresh against the updates done to its source. We propose eight different storage schemes for XML query cache, which are categorized into three groups: (1) the schemes based on the plain text file, (2) the schemes based on the persistent DOM (PDOM) file, and (3) a scheme employing an RDBMS. We implemented all of them, and compared their performance with each other. We also compared our proposal with a storage scheme based on a current state-of-the-art XML storage scheme, showing that ours is more efficient.