• Journal of the Korea Society of Computer and Information
• /
• v.25 no.8
• /
• pp.9-21
• /
• 2020

With the proliferation of RDF knowledge graphs(KGs), there arose a need of a standardized schema representation of the graph model for effective data interchangeability and interoperability. The need resulted in the development of SHACL specification to describe and validate RDF graph's structure by W3C. Relational databases(RDBs) are one of major sources for acquiring structured knowledge. The standard for automatic generation of RDF KGs from RDBs is R2RML, which is also developed by W3C. Since R2RML is designed to generate only RDF data graphs from RDBs, additional manual tasks are required to create the schemas for the graphs. In this paper we propose an approach to automatically generate SHACL schemas for RDF KGs populated by R2RML mappings. The key of our approach is that the SHACL shemas are built only from R2RML documents. We describe an implementation of our appraoch. Then, we show the validity of our approach with R2RML test cases designed by W3C.

• The Journal of Engineering Research
• /
• v.2 no.1
• /
• pp.23-30
• /
• 1997

For a effective management and easy tool integration of CAD database, Hierarchy interface System(HIS) was designed and GROCO(Graph Representation fOr Complex Objects) Model was presented in another my paper[10]. Hierarchy Interface System which is composed of two subsystems of a configurator and a converter is designed for the interface between a conventional database management system and CAD tools. In this paper, Version Management System is presented for supporting effective operations of HIS using GROCO model. Version Management System supports efficiently CAD database charaters having a hierarchical structure of composite objects. In Version Management System, A design evolves in discrete states through mutation and derivation for going phases of design giving rise to multiple versions. Operations and rules are provided transition between their different states. and for controlling update propagation and preventing version proliferation. Version Modeling Graph is proposed for dealing with versioning at the instance and type levels.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.95-102
• /
• 2013

In metabolomics, metabolic pathway is represented by well-displayed graph. Metabolic pathways, especially, have a complex binding structure, which makes the graphical representation hard to visualize. There is a problem that edge crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 2-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in upper layer. Then the remaining subgraphs except meaningful components are drawn in lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. This algorithm is the basis of flexible analysis for metabolic pathways.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.77-90
• /
• 2014

In the past composers used to make music with classical instruments such as piano, violin, guitar, flute, drums, and other well-known tools. With the advent of digital technology many software programs were developed which allow musicians to compose tunes using personal computers. Many file formats were introduced such as NIFF, SMDL and MIDI but none besides MIDI has been successful. Recently MusicXML has emerged as a de-facto standard for the computer representation of music. This paper presents a brief description of the structure of the MusicXML format and describes the development of a music score editor based on MusicXML. We implemented a MusicXML-based score editing software using C# language and a feasibility test showed the efficiency of our proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.71-79
• /
• 2013

Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.805-808
• /
• 2004

본 논문에서는 두 단백질의 구조적 유사성을 기반으로 한 단백질 비교를 위해서 전처리 기법으로서의 주성분분석기법을 소개한다. 기존의 백본 및 알파탄소 간의 거리행렬(distance matrix), 2차 구조 비교기법, 구역(segment)단위의 비교 기법과 같은 단백질 비교 기법들은 위치이동(translation)와 회전(rotation)에 불변한(invariant) 차이를 구하기 위하여 거리행렬을 이용하였다. 그리고, 난 다음 이들의 최적화 과정을 거쳤다. 그러나, 본 논문에서 제시하는 전처리 기법으로서의 주성분분석기법은 단백질 구조를 전체적인 구조 관점에서 위치를 정렬시킨 후에 단백질 간의 구조를 비교하는 방식이다. 단백질의 구조의 방향성(Orientation)을 맞춘 다음에는 다양한 단백질 표현으로 구를 비교할 수 있다. 본 논문에서는 두 단백질의 구조의 유사성을 측정하기 위한 간결한 단백질 표현(representation)으로 3 차원 에지 히스토그램을 사용하였다. 이 기법은 방향성을 정렬하기 위하여 기존의 방법에서 사용되었던 반복적인 거리계산을 통한 최적화하는 과정을 없앰으로써 단백질 구조 비교 시간을 단축할 수 있는 새로운 단백질 구조 비교 패러다임을 가능하게 한다. 따라서, 이 패러다임을 통하여 적절한 단백질 구조 방향성 정렬과 단백질 구조 표현을 이용한 단백질 구조 비교 검색 시스템은 많은 양의 단백질 구조 정보로부터 원하는 형태의 단백질 구조를 빠른 시간에 검색할 수 있는 장점을 가질 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.9
• /
• pp.73-79
• /
• 2023

This paper describes a level of detail (LOD) based bending spring structure and damping technique that can reliably represent strain-based dynamics (SBD) on a triangular mesh. SBD models elastic energy using strain instead of energy based on the edge length of a triangular mesh. However, when a large external force occurs, the process of calculating the elastic energy based on edges results in a degenerate triangle, which stretches in the wrong direction because it calculates an unstable strain. In this paper, we introduce an LOD-based bending spring generation and energy calculation method that can efficiently handle this problem. As a result, the technique proposed in this paper can reliably and efficiently handle SBD based on bending springs, which can provide a stable representation of cloth simulation.

• Journal of Korean Society of Forest Science
• /
• v.88 no.3
• /
• pp.389-399
• /
• 1999

This study was conducted to develop an application software, SIDAS3D(Stand Inventory Data Analysis System for 3 Dimensional Representation), of which the purpose of development is to make it easier to analyze and display the 3D spatial structure of a forest stand, based on the data such as tree position, species, DBH, height, clear length of individual trees, and crown width. This program has a statistical analysis function for stand attributes per hectare and displays simple graphs of stand statistics such as the distribution of diameters, heights, and volumes. It also has two additional functions, of which one is to display the 3D image of stand structure and the other is to display the image of crown projection. In addition, this program provides an imaginary treatment simulation function, which can visually confirm the suitability of silvicultural treatments on computers. To test the precision and reliability of SIDAS3D, data obtained by the precision forest inventory method were used. Statistical analysis ability of SIDAS3D was compared with that of SAS. And its representational ability was compared with that of TreeDraw. According to the verification, SIDAS3D was superior to SAS and TreeDraw in both the data processing time and the interpretative ability of results. It was concluded that SIDAS3D could be used to help users efficiently make decisions for appropriate silvicultural treatments and rational management plans because it has analysis functions providing various valuable information.

• Journal of Forest and Environmental Science
• /
• v.33 no.3
• /
• pp.202-225
• /
• 2017

Non Timber Forest Products (NTFPs) has gained a lot of significance over the years as a means of income generation. Forests are playing a vital role in the supply of these products, however, due to their continuous extraction, the population of many species might have depleted. Very little information is known about community structure and population status of NTFPs. No specific studies have been made to find out the occurrence, availability of species and population status in the forests, supplying the resources. The present study has been carried out in community forests of the naturally occurring NTFPs in the temperate forest of the Ziro valley of Arunachal Pradesh. The main aim is to determine community structure, species composition and population status of NTFPs. Three forest stands viz., Nyilii, Dura and Gyachi were selected which are used by the Apatani tribe for extraction of the NTFPs. For evaluation of species composition and community characteristics, the sampling of the vegetation was done using the quadrat method. A total 137 species representing 68 families and 116 genera were recorded. Herbs represent the maximum diversity with 71 species followed by 35 shrub species and 31 tree species. The families Asteraceae and Rosaceaeae exhibited maximum representation followed by Urticaceae. The species under Fagaceae, Lauraceae, Rosaceae and Rutaceae were found to be important NTFP yielding species. Highest species richness was recorded in Nyilii having 124 species, while lowest in Dura with 102 species. Density of tree, shrub and herb ranged between 376 to $456\;individuals\;ha^{-1}$, 2848 to $3696\;individuals\;ha^{-1}$ and 31.44 to $36.64\;individuals\;m^{-2}$, respectively. The total basal area was found to be highest ($51.64m^2\;ha^{-1}$) in Dura followed by Nyilii ($25.32m^2\;ha^{-1}$) and lowest in Gyachi ($22.82m^2\;ha^{-1}$). In all the three study stands the species diversity indices showed the trend, herbs > shrubs > trees while the evenness index showed the trend as shrubs > herbs > trees. The overall species similarity index was highest (82.35%) between Dura and Gyachi. About 80% of the total recorded species showed clumped distribution while, no regular distribution was shown by any species. The three selected stands harbor about 50 important NTFP yielding species which are being used commonly by the Apatani people in their day to day life. Among the three study sites, overall diversity of NTFP was found highest in the Nyilii stand while the density of population was found better in Dura and Gyachi stands. The population of many species was found to be low due to continue harvesting without any sustainable management by the communities. All the selected forest stands have the potentiality to grow the high value NTFP yielding species and if managed properly, they can support the livelihood and economy of the local communities.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.282-292
• /
• 2003

This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.