• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.90-94
• /
• 2006

The research about social network for analyzing human relationship has been steadily worked due to the importance in the social science field. It is also important that analyzing the relationship between researchers in the academic and research fields. Especially, the network by joint research or citation between researchers is useful to evaluating projects or making policy on academic and research fields. This paper describes a method that generates two kinds of researcher networks showing co-authorship and citation relationship between researchers based on national R&D reference information ontology. We infer pair of researchers in co-authorship or citation relationship by SPARQL query from the ontology which is composed of research outcomes and their participating researchers in RDF triples. By postprocessing, we construct researcher network which links researchers in co-authorship and citation relationship.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.383-391
• /
• 2017

As we enter a new era of Big Data, the amount of semantic data has rapidly increased. In order to derive meaningful information from this large semantic data, studies that utilize the SWRL(Semantic Web Rule Language) are being actively conducted. SWRL rules are based on data extracted from a user's empirical knowledge. However, conventional reasoning systems developed on single machines cannot process large scale data. Similarly, multi-node based reasoning systems have performance degradation problems due to network shuffling. Therefore, this paper overcomes the limitations of existing systems and proposes more efficient distributed inference methods. It also introduces data partitioning strategies to minimize network shuffling. In addition, it describes a method for optimizing the incremental reasoning process through data selection and determining the rule order. In order to evaluate the proposed methods, the experiments were conducted using WiseKB consisting of 200 million triples with 83 user defined rules and the overall reasoning task was completed in 32.7 minutes. Also, the experiment results using LUBM bench datasets showed that our approach could perform reasoning twice as fast as MapReduce based reasoning systems.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1045-1061
• /
• 2017

This paper suggests a method to expand linkages in a Linked Open Data(LOD) cloud that is a practical consequence of a semantic web. LOD cloud, contrary to the first expectation, has not been used actively because of the lack of linkages. Current method for establishing links by applying to explicit links and attaching the links to LODs have restrictions on reflecting target LODs' changes in a timely manner and maintaining them periodically. Instead of attaching them, this paper suggests that each LOD should prepare a link policy and publish it together with the LOD. The link policy specifies target LODs, predicate pairs, and similarity degrees to decide on the establishment of links. We have implemented a system that performs in-depth searching through LODs using their link policies. We have published APIs of the system to Github. Results of the experiment on the in-depth searching system with similarity degrees of 1.0 ~ 0.8 and depth level of 4 provides searching results that include 91% ~ 98% of the trustworthy links and about 170% of triples expanded.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.2
• /
• pp.16-22
• /
• 2004

The paper presents the effects of output-coupling power and small signal gain of selenium vapour multiline laser by discharge of either to $^4$He or $^3$He. The purity of the He gas was improved with a special He-fille.. The result shows that compared with those of $^4$He, the output-coupling power and small-signal gain of $^3$He increase in the most of the lines. Especially, the small-signal gain of $^3$He for the strong lines (497.6 nm, 499.3 nm, 506.9 nm, 517.6 nm, 522.8 nm, 530.5 nm) lies about 30% higher than that of $^4$He, and the output-coupling power from doubles to triples.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.476-485
• /
• 2006

The Resource Description Framework(RDF), which emerged with the semantic web, is settling down as a standard for representing information about the resources in the World Wide Web Hence, a lot of research on storing and query processing RDF documents has been done and several RDF storage systems, such as Sesame and Jena, have been developed. But the research on updating RDF documents is still insufficient. When a RDF document is changed, data in the RDF triple store also needs to be updated. However, current RDF triple stores don't support incremental update. So updating can be peformed only by deleting the old version and then storing the new document. This updating method is very inefficient because RDF documents are steadily updated. Furthermore, it makes worse when several RDF documents are stored in the same database. In this paper, we propose an incremental update algorithm on RDF, documents in triple stores. We use a text matching technique for two versions of a RDF document and compensate for the text matching result to find the right target triples to be updated. We show that our approach efficiently update RDF documents through experiments with real-life RDF datasets.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.1
• /
• pp.1-10
• /
• 2015

This paper offers some long term perspective on what has been happening to some baseball statistics for Korean professional baseball. The data used are league summaries by year over the period 1982-2013. For the baseball statistics, statistically significant positive correlations (p < 0.01) were found for doubles (2B), runs batted in (RBI), bases on balls (BB), strike outs (SO), grounded into double play (GIDP), hit by pitch (HBP), on base percentage (OBP), OPS, earned run average (ERA), wild pitches (WP) and walks plus hits divided by innings pitched (WHIP) increased with year. There was a statistically significant decreasing trend in the correlations for triples (3B), caught stealing (CS), errors (E), completed games (CG), shutouts (SHO) and balks (BK) with year (trend p < 0.01). The ARIMA model of Box-Jenkins is applied to find a model to forecast future baseball measures. Univariate time series results suggest that simple lag-1 models fit some baseball measures quite well. In conclusion, the single most important change in Korean professional baseball is the overall incidence of completed games (CG) downward. Also the decrease of strike outs (SO) is very remarkable.

• Journal of KIISE:Software and Applications
• /
• v.35 no.7
• /
• pp.431-441
• /
• 2008

The academic information analysis service is including automatic recommendation of reviewers and analysis of researchers' accomplishments. The service of recommendation of reviewers should be processed in a transparent, fair and accountable way. When selecting reviewers, the following information must be considered: subject of project, reviewer's maj or, expertness of reviewer, relationship between applicant and reviewer. The analysis service of researchers' accomplishments is providing statistic information of researcher, institution and location based on accomplishments including book, article, patent, report and work of art. In order to support these services, we designed ontology for academic information, converted legacy data to RDF triples, expanded knowledge appropriate to services using OntoFrame. OntoFrame is service framework which includes ontology, reasoning engine, triple store. In our study, we propose the design methodology of ontology and service system for academic information based on OntoFrame. And then we explain the components of service system, processing steps of automatic recommendation of reviewers and analysis of researchers' accomplishments.

• Journal of KIISE
• /
• v.45 no.3
• /
• pp.224-233
• /
• 2018

Recently, there are many of studies on SWRL reasoning engine based on user-defined rules in a distributed environment using a large-scale ontology. Unlike the schema based axiom rules, efficient inference orders cannot be defined in SWRL rules. There is also a large volumet of network shuffled data produced by unnecessary iterative processes. To solve these problems, in this study, we propose a method that uses Map-Reduce algorithm and distributed in-memory framework to deduce multiple rules simultaneously and minimizes the volume data shuffling occurring between distributed machines in the cluster. For the experiment, we use WiseKB ontology composed of 200 million triples and 36 user-defined rules. We found that the proposed reasoner makes inferences in 16 minutes and is 2.7 times faster than previous reasoning systems that used LUBM benchmark dataset.

• The Journal of the Korea Contents Association
• /
• v.15 no.12
• /
• pp.24-34
• /
• 2015

With the development of the semantic web, a large amount of data being produced nowadays is in RDF format. RDF is represented by a triple. An RDF database consisting of triples requires the high cost of join query processing. Materialized view is known as a scheme to reduce the query processing cost by accessing materialized views without accessing the database. It is physically stored the results or the intermediate results of the query processing in a storage area. In this paper, we propose a materialized view selection scheme by using decision tree to solve such a problem. The decision tree considers the size and maintenance costs of the materialized view as well as the profit of query response times. It is shown through performance evaluation that the proposed scheme increases the number of materialized views in the limited storage space and decreases the update rates of the materialized views.

• Journal for History of Mathematics
• /
• v.24 no.1
• /
• pp.15-29
• /
• 2011

This study was carrying out research on the geometry of Sulbas${\={u}}$tras as parts of looking for historical roots of oriental mathematics, The Sulbas${\={u}}$tras(rope's rules), a collection of Hindu religious documents, was written between Vedic period(BC 1500~600). The geometry of Sulbas${\={u}}$tras in ancient India was studied to construct or design for sacrificial rite and fire altars. The Sulbas${\={u}}$tras contains not only geometrical contents such as simple statement of plane figures, geometrical constructions for combination and transformation of areas, but also algebraic contents such as Pythagoras theorem and Pythagorean triples, irrational number, simultaneous indeterminate equation and so on. This paper examined the key features of the geometry of Sulbas${\={u}}$tras and the geometry of Sulbas${\={u}}$tras for the construction of the sacrificial rite and the fire altars. Also, in this study we compared geometry developments in ancient India with one of the other ancient civilizations.