• Journal of Korean Association for Spatial Structures
• /
• v.15 no.3
• /
• pp.4-10
• /
• 2015

• Journal of Korean Association for Spatial Structures
• /
• v.2 no.1 s.3
• /
• pp.1-7
• /
• 2002

• Journal of Korean Association for Spatial Structures
• /
• v.17 no.4
• /
• pp.10-15
• /
• 2017

• Magazine of korean Tunnelling and Underground Space Association
• /
• v.17 no.4
• /
• pp.13-23
• /
• 2015

• Journal of Korean Association for Spatial Structures
• /
• v.3 no.4 s.10
• /
• pp.1-10
• /
• 2003

• Journal of Korean Association for Spatial Structures
• /
• v.3 no.4 s.10
• /
• pp.11-17
• /
• 2003

• Journal of Korean Association for Spatial Structures
• /
• v.16 no.3
• /
• pp.31-36
• /
• 2016

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.12 no.3
• /
• pp.257-264
• /
• 2010

This study proposed the aseismic design concept for underground space based on site response analysis and laboratory tests. The results of this study showed that the location of the control points of input motions such as design response spectra and time history of acceleration and the assumption of bedrock properties such as elasticity or rigidity play an important role in aseismic design of underground space. Therefore, the appropriate ground response model among models applying motions such as free surface motion, bedrock motion, or bedrock outcropping motion must be utilized to provide reasonable boundary conditions of underground space under earthquake loading and practical aseismic design.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.438-450
• /
• 2003

Spatial joins find pairs of objects that overlap with each other. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with sizes of objects, it is difficult to develop a formal algorithm without relying on heuristics. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no sites. Thus, spatial join algorithms using these indexes are relatively simple and can be formally developed. However, the disadvantage of transform-space join algorithms is that they cannot be applied to original-space indexes such as the R-tree containing original-space objects. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose a new notion of the transform-space view and present the transform-space view join algorithm(TSVJ). A transform-space view is a virtual transform-space index based on an original-space index. It allows us to interpret on-the-fly a pre-built original-space index as a transform-space index without incurring any overhead and without actually modifying the structure of the original-space index or changing object representation. The experimental result shows that, compared to existing spatial join algorithms that use R-trees in the original space, the TSVJ improves the number of disk accesses by up to 43.1% The most important contribution of this paper is to show that we can use original-space indexes, such as the R-tree, in the transform space by interpreting them through the notion of the transform-space view. We believe that this new notion provides a framework for developing various new spatial query processing algorithms in the transform space.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.35-44
• /
• 2009

This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.