• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.9 no.3
• /
• pp.65-73
• /
• 1989

Continuum formulations for the expressions of dynamic energy release rates and computational methods for dynamic stress intensity factors are developed for the analysis of dynamic fracture problems subjected to stress wave loading. Explicit volume integral expressions for instantaneous dynamic energy release rates are derived by modeling virtual crack extensions with the dynamic Eulerian-Lagrangian kinematic description. In the finite element applications a finite region around a crack-tip is modeled by using quarter-point singular isoparametric elements, and the volume integrals are evaluated for each crack-tip element during virtual crack extensions while the singularity is maintained. It is shown that the use of the present method is more reliable and accurate for the dynamic fracture analysis than that of other path-independent integral methods when the effects of stress waves are significant.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.585-596
• /
• 2007

XML data generally consists of a hierarchical tree-structure which is reflected in mechanisms to store and retrieve XML data. Therefore, when storing XML data in the database, the hierarchical relationships among the XML elements are taken into consideration during the restructuring and storing of the XML data. Also, in order to support the search queries from the user, a mechanism is needed to compute the hierarchical relationship between the element structures specified by the query. The structural join operation is one solution to this problem, and is an efficient computation method for hierarchical relationships in an in database based on the node numbering scheme. However, in order to process a tree structured XML query which contains a complex nested hierarchical relationship it still needs to carry out multiple structural joins and results in another problem of having a high query execution cost. Therefore, in this paper we provide a preprocessing mechanism for effectively reducing the cost of multiple nested structural joins by applying the concept of equivalence classes and suggest a query path reduction algorithm to shorten the path query which consists of a regular expression. The mechanism is especially devised to reduce path queries containing branch nodes. The experimental results show that the proposed algorithm can reduce the time requited for processing the path queries to 1/3 of the original execution time.

• Tunnel and Underground Space
• /
• v.27 no.1
• /
• pp.39-49
• /
• 2017

The factor of safety (FOS) is commonly used as an index to quantitatively state the degree of safety of various rock structures. Therefore it is important to understand the definition and characteristics of the adopted FOS because the calculated FOS may be different according to the definition of FOS even if it is estimated under the same stress condition. In this study, four local factors of safety based on maximum shear stress, maximum shear strength, stress invariants, and maximum principal stress were defined using the Mohr-Coulomb and Hoek-Brown failure criteria. Then, the variation characteristics of each FOS along five stress paths were investigated. It is shown that the local FOS based on the shear strength, which is widely used in the stability analysis of rock structures, results in a higher FOS value than those based on the maximum principal stress and the stress invariants. This result implies that the local FOS based on the maximum shear stress or the stress invariants is more necessary than the local FOS based on the shear strength when the conservative rock mechanics design is required. In addition, it is shown that the maximum principal stresses at failure may reveal a large difference depending on the stress path.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.1
• /
• pp.161-171
• /
• 1993

The aim of this study is to provide the stress-strain behavior of hardening geological materials such as rock or concrete on three dimensional spaces by using Desai model based on plastic theory. To validate proposed model, truly triaxial tests with high pressure under variety of stress paths in which three principal stresses were controlled independently using concrete materials were performed. The main results are summerized as follows: 1. Various stress paths for hardening materials used are satisfactorily explained by performing the truly triaxial test with high pressure. This is very important to investigate constitutive equations for materials like rock or concrete. 2. Since the proposed yield function is continuous, it avoids the singularity point at the intersection of two function in the previous models, thus, reducing the difficulties for computer implementation. 3. Analytic predictions for yielding behavior on $J_1-{\sqrt{J_{2D}}}$ octahedral and triaxial plane, as well as volumetric strain and stress-strain behavior agree well with experimental results.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.540-552
• /
• 2004

We propose XIR-Linear, a novel method for processing partial match queries on large-scale heterogeneous XML documents using information retrieval (IR) techniques. XPath queries are written in path expressions on a tree structure representing an XML document. An XPath query in its major form is a partial match query. The objective of XIR-Linear is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Linear has its basis on the schema-level methods using relational tables and drastically improves their efficiency and scalability using an inverted index technique. The method indexes the labels in label paths as key words in texts, and allows for finding the label paths that match the queries far more efficiently than string match used in conventional methods. We demonstrate the efficiency and scalability of XIR-Linear by comparing it with XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Linear is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions as the number of XML documents increases.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.293-304
• /
• 2004

Recently, caching for the database-backed web applications has received much attention. The results of frequent queries could be cached for repeated reuse or for efficient processing of the relevant queries. Since the emergence of XML as a standard for data exchange on the web, today's web applications are to retrieve information from the remote XML sources across the network, and thus it is desirable to maintain the XML query results in the cache for the web applications. In this paper, we describe implementation of an XML query processing system that supports cache-answerability of XML queries, and evaluate its performance. XML path expression, which is one of the core features of XML query languages including XQuery, XPath, and XQL was considered as the XML query. Their result is maintained as an XML materialized view in the XML cache. The algorithms to rewrite the given XML path expression using its relevant materialized view proposed in [13] were implemented with RDBMS as XML store. The major issues of implementation are described in detail. The results of performance experiments conducted with the implemented system showed effectiveness of cache-answerability of XML queries. Comparison with previous research in terms of performance is also Provided.

• Journal of Internet Computing and Services
• /
• v.3 no.1
• /
• pp.41-49
• /
• 2002

Ohba has suggested the Colored Thread Algorithm to prevent looped path when LSP is to be setup. M immediate node sends thread information such as color, hop count. ill, to downs1ream node via LDP message for the set-up of LSP. Afterward, decides that the looped path is formed when it receives a message with a same colored thread that was sent to downs1ream node, and it searches another path. If the message reaches to the egress node, then acknowledged message is sent to upstream node as reverse direction to the ingress node to set up loop-free path. For the algorithm, Ohva has defined three thread states as Null, Colored, Transparent. In this paper, the state of thread is extended to 5 states such as Extending, Merging, Stalling, Null, and Transparent. By the way, related FSM and TCB was redefined to make clear the ambiguity of thread states which causes faulty actions and to remove overhead. And, to improve performance, it limits to generate a thread in the state of Stalling.

• Journal of Korea Game Society
• /
• v.4 no.1
• /
• pp.58-66
• /
• 2004

This paper uses counterexamples for solving reachability games. An objective. of the game we consider here is to find out a minimal path from an initial state to the goal state. We represent initial states and game rules as finite state model and the goal state as temporal logic formula. Then, model checking is used to determine whether the model satisfies the formula. In case the model does not satisfy the formula, model checking generates a counterexample that shows how to reach the goal state from an initial state. In this way, we solve many of small-sized Push Push games. However, we cannot handle larger-sized games due to the state explosion problem. To mitigate the problem, abstraction is used to reduce the state space to be che cked. As a result, unsolved games are solved with the abstraction technique we propose inthis paper.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.145-156
• /
• 2003

Most of the content-based image retrieval systems focuses on similarity-based retrieval of natural picture images by utilizing color. shape, and texture features. For the neuroscience image databases, we found that retrieving similar images based on global average features is meaningless to pathological researchers. To realize the practical content-based retrieval on images in neuroscience databases, it is essential to represent internal contents or semantics of images in detail. In this paper, we present how to represent image contents and their related concepts to support more useful retrieval on such images. We also describe the operational semantics to support these advanced retrievals by using object-oriented message path expressions. Our schemes are flexible and extensible, enabling users to incrementally add more semantics on image contents for more enhanced content searching.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.876-880
• /
• 2009

A control flow graph(CFG) is an essential data structure for program analyses based on graph theory or control-/data- flow analyses. Esterel is an imperative synchronous language and its synchronous parallelism makes it difficult to construct a CFG of an Esterel program. In this work, we present a method to construct over-approximated CFGs for Esterel. Our method is very intuitive and generated CFGs include not only exposed paths but also invisible ones. Though the CFGs may contain some inexecutable paths due to complex combinations of parallelism and exception handling, they are very useful for other program analyses.