• The Journal of Society for e-Business Studies
• /
• v.26 no.3
• /
• pp.67-80
• /
• 2021

The node embedding technique for learning graph representation plays an important role in obtaining good quality results in graph mining. Until now, representative node embedding techniques have been studied for homogeneous graphs, and thus it is difficult to learn knowledge graphs with unique meanings for each edge. To resolve this problem, the conventional Triple2Vec technique builds an embedding model by learning a triple graph having a node pair and an edge of the knowledge graph as one node. However, the Triple2 Vec embedding model has limitations in improving performance because it calculates the relationship between triple nodes as a simple measure. Therefore, this paper proposes a feature extraction technique based on a graph convolutional neural network to improve the Triple2Vec embedding model. The proposed method extracts the neighborliness vector of the triple graph and learns the relationship between neighboring nodes for each node in the triple graph. We proves that the embedding model applying the proposed method is superior to the existing Triple2Vec model through category classification experiments using DBLP, DBpedia, and IMDB datasets.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1243-1253
• /
• 2008

In this paper, we construct one-factorizations of given complete graphs of even order. These constructions partition the edges of the complete graph into one-factors and triples. Our new constructions of one-factors and triples can be applied to a recursive construction of Steiner triple systems for all possible orders ${\geq}$15.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.952-954
• /
• 2004

We've developed a Boolean circuit that finds a maximum matching in a convex bipartite graph. This circuit is designed in BC language that was created by K. Park and H. Park(1). The depth of the circuit is O(log$^2$nㆍlog b) and the size is O(bn$^3$). Our circuit gets a triple representation of a convex bipartite graph as its input and produces the maximum matching for its output. We developed some Boolean circuit design techniques that can be used for building other Boolean circuits.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.2
• /
• pp.133-142
• /
• 2004

In this article, the constitutive relations of three types of piezoelectric benders, which are a unimorph bender, a bimorph bender and a triple-layer bender, are derived based on the beam theory under the quasi-static equilibrium condition. The relation coefficients are described as the geometry and material properties of the benders. More general constitutive relations involving fixed-free, fixed-roll, and fixed-simply supported boundary conditions under the inconsistent length condition between the piezoelectric layer and the nonpiezoelectric one are discussed. The complicated constitutive relations can be easily calculated and checked by using the symbolic function in ‘Mathematica’. The relation coefficients for the benders are plotted in three dimensional graph using the developed program.

• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.12
• /
• pp.4863-4867
• /
• 2015

Background: Triple negative breast cancer (TNBC), characterized as estrogen receptor (ER), progesterone receptor (PR) and human epidermal growth factor receptor 2 Her2 negative and accounting for 10-17% of all breast carcinomas, is only partially responsive to chemotherapy and suffers from a lack of clinically established targeted therapies. The aim of the current study was to evaluate the patterns of treatment and clinicopathology figures in Kurdish patients with triple-negative breast cancer, and to compare these to other reports. Materials and Methods: Between 2001 and 2014, 950 breast cancer patients were referred to our clinic. There were 74 female patients with TNBC, including 70 patients was invasive ductal carcinoma entered into our study. ER and PR positivity was defined as positive immunohistochemical staining in more than 10% of tumor cells. Immunohistochemistry assay with anti-HER2 antibodies was used to identify HER negative (0 and 1+) or positive (2+ and 3+). HER2 gene amplification was determined by fluorescent in situ hybridization (FISH). Overall survival (OS) was plotted with GraphPad Prism 5 Software using Kaplan-Meier and log-rank tests for comparison of results. Results: The mean age in the first diagnosis for 70 patients with triple TNBC and invasive ductal carcinoma was 49.6 years that range of age was 27-82 years. All of the patients were female. Of 70 patients, 23 patients had metastasis. Thirty-two patients (45.7%) were treated with tamoxifen and 39 (55.7%) with radiotherapy. Three-year, 5-year and 10-year OS rates for all patients were 82%, 72% and 64%, respectively. Conclusions: The OS in our West Iran TNBC patients is less than reported elsewhere. However, treatment with combination of tamoxifen plus radiation increases the OS and reduces the mortality rate.

• Journal of Convergence for Information Technology
• /
• v.10 no.1
• /
• pp.139-148
• /
• 2020

As the internet and computer technology are developed, there is a need for service of traditional culture that can effectively search and create culture, history, and tradition-related materials in online contents. In this paper, we developed an RDF-based ontology retrieval service platform and verified usability and validity. This platform is divided into triple search, keyword search, network graph search, story search and management, curation management module. Based on this, the search results can be visualized based on the relationship between data, network graph search and story search can be used to easily understand the relationship between the keywords. An platform evaluation was conducted for verification, and it was evaluated that an intelligent search that can easily identify the relationship between information and shorten the analysis and search time than the existing search function.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.112-124
• /
• 2008

RDF and OWL are the primary base technologies for implementing Semantic Web. Recently, many researches related with them, or applying them into the other application domains, have been introduced. However, relatively little work has been done for securing the RDF and OWL data. In this article, we briefly introduce an RDF triple based model for specifying RDF access authorization related with RDF security. Next, to efficiently find the authorization conflict by RDF inference, we introduce a method using prime number graph labeling in detail. The problem of authorization conflict by RDF inference is that although the lower concept is permitted to be accessed, it can be inaccessible due to the disapproval for the upper concept. Because by the RDF inference, the lower concept can be interpreted into the upper concept. Some experimental results show that the proposed method using the prime number graph labeling has better performance than the existing simple method for the detection of the authorization conflict.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.998-1009
• /
• 2015

In recent years, there has been a growing interest in RDFS Inference to build a rich knowledge base. However, it is difficult to improve the inference performance with large data by using a single machine. Therefore, researchers are investigating the development of a RDFS inference engine for a distributed computing environment. However, the existing inference engines cannot process data in real-time, are difficult to implement, and are vulnerable to repetitive tasks. In order to overcome these problems, we propose a method to construct an in-memory distributed inference engine that uses a parallel graph structure. In general, the ontology based on a triple structure possesses a graph structure. Thus, it is intuitive to design a graph structure-based inference engine. Moreover, the RDFS inference rule can be implemented by utilizing the operator of the graph structure, and we can thus design the inference engine according to the graph structure, and not the structure of the data table. In this study, we evaluate the proposed inference engine by using the LUBM1000 and LUBM3000 data to test the speed of the inference. The results of our experiment indicate that the proposed in-memory distributed inference engine achieved a performance of about 10 times faster than an in-storage inference engine.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.422-433
• /
• 2009

As an effort to secure Semantic Web, in this paper, we introduce an RDF access authorization model based on an ontology hierarchy and an RDF triple pattern. In addition, we apply the authorization model to RDF query validation for approved access authorizations. A subscribed SPARQL or RQL query, which has RDF triple patterns, can be denied or granted according to the corresponding access authorizations which have an RDF triple pattern. In order to efficiently perform the query validation process, we first analyze some primary authorization conflict conditions under RDF subsumption inference, and then we introduce an efficient query validation algorithm using the conflict conditions and Dewey graph labeling technique. Through experiments, we also show that the proposed validation algorithm provides a reasonable validation time and when data and authorizations increase it has scalability.

• Journal of the Korean Institute of Gas
• /
• v.25 no.3
• /
• pp.9-15
• /
• 2021

In this paper, a study on the construction of a knowledge base based on natural language processing and the design of a chemical substance estimation system for the development of a knowledge service for a real-time sensor information fusion detection system and symptoms of contact with chemical substances in industrial sites. The information on 499 chemical substances contact symptoms from the Wireless Information System for Emergency Responders(WISER) program provided by the National Institutes of Health(NIH) in the United States was used as a reference. AllegroGraph 7.0.1 was used, input triples are Cas No., Synonyms, Symptom, SMILES, InChl, and Formula. As a result of establishing the knowledge base, it was confirmed that 39 symptoms based on ammonia (CAS No: 7664-41-7) were the same as those of the WISER program. Through this, a method of establishing was proposed knowledge base for the symptom extraction process of the chemical substance estimation system.