• Journal of Korean Library and Information Science Society
• /
• v.43 no.3
• /
• pp.143-163
• /
• 2012

In order to convert a thesaurus described by a person to ontology, the first step is to translate the thesaurus to the ontology by using SKOS, which is suitable for conversion to ontology and was chose an international standard by W3C. SKOS is suitable for converting thesaurus or subject headings or classification system to ontology, but we need a web language to describe an ontology as RDF/XML. RDF/XML is so difficult to read and write that we can need RDFa embedded in HTML document or Turtle, which is more easily describable and readable. Along with description using SKOS, this research has experimentally constructed the ontology by using ontology construction program $Prot{\acute{e}}g{\acute{e}}$ 4.2. In addition to basic concept relationships of thesaurus like equivalent relationship, hierarchical relationships, association relationships transitive hierarchical relationships are included suggested by SKOS in this research.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.17-30
• /
• 2000

In this paper, we propose an efficient algorithm to produce 3-D surface model from a set of range data, based on NURBS (Non-Uniform Rational B-Splines) surface fitting technique. It is assumed that the range data is initially unorganized and scattered 3-D points, while their connectivity is also unknown. The proposed algorithm consists of three steps: initial model approximation, hierarchical representation, and construction of the NURBS patch network. The mitral model is approximated by polyhedral and triangular model using K-means clustering technique Then, the initial model is represented by hierarchically decomposed tree structure. Based on this, $G^1$ continuous NURBS patch network is constructed efficiently. The computational complexity as well as the modeling error is much reduced by means of hierarchical decomposition and precise approximation of the NURBS control mesh Experimental results show that the initial model as well as the NURBS patch network are constructed automatically, while the modeling error is observed to be negligible.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.1
• /
• pp.33-38
• /
• 2006

In this paper, we propose implementation of 3D fashion show animation based on web which needs a construction of 3D fashion shopping mall. The 3D model made by 3D MAX program was exported XML type and displayed on web using ActiveX of D3D library. For the purpose of fashion show animation of 3D model in various clothes which selected by customer of shopping mall, we design the parts of standard clothes with hierarchical structure and assemble them. Next, we are mapping the various textures to them and animate 3D model in similar clothes which selected by customer on web.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1733-1748
• /
• 1997

In this paper, we propose the classification scheme and retrieval mechanism which can apply to many application domains in order to construct the software reuse library. Classification scheme which is the core of the accessibility in the reusability, is defined by the hierarchical structure using the agglomerative clusters. Agglomerative cluster means the group of the reuse component by the functional relationships. Functional relationships are measured by the HACM which is the representation method about software components to calculate the similarities among the classes in the particular domain. And clustering informations are added to the library structure which determines the functionality and accuracy of the retrieval system. And the system stores the classification results such as the index information with the weights, the similarity matrix, the hierarchical structure. Therefore users can retrieve the software component using the query which is the natural language. The thesis is studied to focus on the findability of software components in the reuse library. As a result, the part of the construction process of the reuse library was automated, and we can construct the object-oriented reuse library with the extendibility and relationship about the reuse components. Also the our process is visualized through the browse hierarchy of the retrieval environment, and the retrieval system is integrated to the reuse system CARS 2.1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.333-340
• /
• 2007

In multi agent systems, various inter agent communication models have been proposed, and, especially, there are several group communication schemes proposed so far, where some schemes guarantees transparent communication among the agents. However, in mobile agent environments, we require new group communication schemes that consider topology changes caused by mobile agent migrations. Also, these group communication schemes should be secure in order for them to be practical. In this paper, we propose a secure group communication scheme using the hierarchical overlay ring structure of mobile agents. The proposed scheme uses the ring channel in order to cope adaptively with the change of ring topology. The ring channel has basic information for construction of the ring and is managed only by the mobile agent platforms. Therefore, each mobile agent need not directly handle the ring channel and it can perform group communication without any consideration on the change of the ring topology.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.34 no.9
• /
• pp.3-10
• /
• 2018

While computer environments have been dramatically developed in recent years, as the building structures become larger, the structural analysis models are also becoming more complex. So there is still a need to model one shear wall with one finite element. From the viewpoint of the concept of FEA, if one shear wall is modeled by one finite element, the result of analysis is not likely accurate. Shear wall may be modelled with various finite elements. Among them, considering the displacement compatibility condition with the beam element connected to the shear wall, plane stress element with in-plane rotational stiffness is preferred. Therefore, in order to analyze one shear wall with one finite element accurately, it is necessary to evaluate finite elements developed for the shear wall analysis and to develop various plane stress elements with rotational stiffness continuously. According to the above mentioned need, in this study, the theory about a plane stress element using hierarchical interpolation equation is reviewed and stiffness matrix is derived. And then, a computer program using this theory is developed. Developed computer program is used for numerical experiments to evaluate the analysis results using commercial programs such as SAP2000, ETABS, PERFORM-3D and MIDAS. Finally, the deflection equation of a cantilever beam with narrow rectangular section and bent by an end load P is derived according to the elasticity theory, and it is used to for comparison with theoretical solution.

• Journal of the Korea Institute of Building Construction
• /
• v.10 no.1
• /
• pp.111-120
• /
• 2010

The public construction industry in Korea involves a variety of stakeholders, encompassing multiple layers of contractual relationships that crisscross between the State as project client and the contractors, as well as subcontractors. In such a hierarchical landscape, managerial crises of contractors involving bankruptcy or insolvency can result in unexpected damages for both clients and subcontractors. Accordingly, the applicable legal framework requires project clients to act as patrons in relation to making payments to subcontractors, and stipulates provisions pertaining to direct payments to subcontractors in order to promote the balanced development of the national economy in terms of the public interest by protecting small and medium-sized businesses working as subcontractors for large businesses. However, the relevant legal documents provide for different payment criteria and procedures from document to document, and leave room for variations in the interpretation and construction of applicable provisions, which leads to disputes and discrepancies in court rulings. For this reason, it is necessary not only to compare and analyze statutory provisions pertaining to direct payment to subcontractors, but also to review issues of contention in actual cases. This study aims to analyze issues in cases involving payment to subcontractors from the perspective of the project client overseeing and supervising the construction business. The conclusions from such an analysis will help to effectively resolve subsequent cases of a similar nature by suggesting a strategy to improve the relevant statutory provisions pertaining to direct payment to subcontractors.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.2
• /
• pp.108-118
• /
• 2014

On the optimization design problem using surrogate model, it requires considerable number of sampling points to construct a surrogate model which retains the accuracy. As an alternative to reduce construction cost of the surrogate model, Variable-Fidelity Modeling(VFM) technique, where correct high fidelity model based on the low fidelity surrogate model is introduced. In this study, hierarchical kriging model for variable-fidelity surrogate modeling is used and an optimization framework with multi-objective genetic algorithm(MOGA) is presented. To prove the feasibility of this framework, airfoil design optimization process is performed for the transonic region. The parameters of PARSEC are used to design variables and the optimization process is performed in case of varying number of grid and varying fidelity. The results showed that pareto front of all variable-fidelity models are similar with its single-level of fidelity model and calculation time is considerably reduced. Based on computational results, it is shown that VFM is a more efficient way and has an accuracy as high as that single-level of fidelity model optimization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.