• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.5
• /
• pp.359-368
• /
• 2013

Mashup is a web application that combines several different sources to create new services using Open APIs(Application Program Interfaces). Although the mashup has become very popular over the last few years, there are several challenging issues when combining a large number of APIs into the mashup, especially when composite APIs are manually integrated by mashup developers. This paper proposes a novel algorithm for automatic Open API composition. The proposed algorithm consists of constructing an operation connecting graph and searching composition candidates. We construct an operation connecting graph which is based on the semantic similarity between the inputs and the outputs of Open APIs. We generate directed acyclic graphs (DAGs) that can produce the output satisfying the desired goal. In order to produce the DAGs efficiently, we rapidly filter out APIs that are not useful for the composition. The algorithm is evaluated using a collection of REST and SOAP APIs extracted from ProgrammableWeb.com.

• Journal of Korean Society of Archives and Records Management
• /
• v.21 no.3
• /
• pp.61-78
• /
• 2021

Records on Japanese "Comfort Women" have been individually managed by private sectors or institutions, and some are provided as digital archives on the Internet. However, records of digital archives differ in the composition and representation of metadata by individual institutions. Meanwhile, there is a lack of a consistent structure to describe the relationships between and among these records, leading to their fragmentation and disconnectedness. This paper proposes a knowledge model for interlinking the digital archival resources and builds a knowledge graph by integrating the records from distributed digital archives. It derives common elements by analyzing metadata from the diverse digital archives and expresses them in standard vocabularies to semantically describe multiple entities and relationships of the digital archival resources. In particular, the study includes the refinement of collected data to search and thread dispersed records and the enrichment of external data to provide significant contextual information of records. An evaluation of the knowledge graph is performed via a query measuring the (dis)connectivity between the distributed records. As a result, the knowledge graph is capable of interlinking and retrieving fragmented records, providing substantial contextual information on the records with external data enrichment, and searching accurately to match the user's intentions through semantic-based queries.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.418-420
• /
• 2015

The SNOMED CT browser is a system for searching and browsing of a huge volume of medical terminologies included in SNOMED CT. Previous browsers provide a simple list-up of search results while they are similar from each other. It leads to a serious confusion in selecting an appropriate term among them. This paper presents a novel browser system which provides a comparative search of search results. To do this, the proposed system includes a terminology search module, a topology search module, and a sub-graph generation module for the results.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.38 no.8
• /
• pp.658-666
• /
• 1989

In this paper, an efficient algorithm for estimation volume and surface area and a reconstruction algorithm for 3-dimensional graphics are presented.In order to improve computing efficiency, the graph theory is utilized and the algorithm to obtain proper contour points is developed by considering several tolerances. Search for the contour points is limited by the change of curvature of cross sectional contour to provide efficiency in searching the minimum cost path. In computer simulation of these algorithms, the results show that, for the tolerance values of 1.001 and 1.002, the execution time reduced to 66%-80% and the error for the measured value is less than 3%. The reconstructed 3-dimensional images from the cross sections can be analyzed in many directions using the graphic scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.353-355
• /
• 2015

SNOMED CT browser is a search browser which searches and browses terminologies include in SNOMED CT. These terminologies shows a structural form using a variety of relationships. However, previous browsers merely lists up substring-matched search results, rather than using structural characteristics. This paper proposes and implements a browser system which shows a sub-graph of search results enabling structural search of the results. The implementation includes searching of terminologies based on substring-matching, tree-based graphical organization of the search results, and history of concept views.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.2
• /
• pp.177-185
• /
• 2005

This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.331-333
• /
• 2002

웹그래프는 웹문서 간의 하이퍼링크를 각 웹문서의 핵심어간의 링크관계로 추상화하대 이 관계를 이용하여 핵심어의 개념 그래프를 구축하고 질의의 확장이나 영역지식을 제공하는 개념 기반 검색이 가능한 검색 시스템이다 본 논문에서는 웹그래프에서 가능했던 질의어에 대한 한 단계의 질의 확장에 그치지 않고. 최초의 질의어와 이후 확장어들에 대한 문맥을 유지하대 추가적인 다단계의 확장이 가능하도록 하는 방법을 계시한다. 검색 시스템 사용자는 최초 질의어가 속하는 해당 분야에 대한 지식이 부족한 경우, 문맥을 유지한 확장을 통하여 자신이 찾고자 하는 바를 명확히 해 나가며 세부 질의를 구축할 수 있고 해당 분야에 대한 지식을 얻는 것이 가능하다

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.7
• /
• pp.104-114
• /
• 1995

In this paper, an intermediate representation HSFG(Hanyang Sequential Flow GRaph) and a new scheduling algorithm for the control-dominated ASIC design is presented. The HSFG represents control flow, data dependency and such constraints as resource constraints and timing constraints. The scheduling algorithm minimizes the total operating time by reducing the number of the constraints as maximal as possible, searching a few paths among all the paths produced by conditional branches. The constraints are substitute by subgraphs, and then the number of subgraphs (that is the number kof the constraints) is minimized by using the inclusion and overlap relation among subgraphs. The proposed algorithm has achieved the better results than the previous ones on the benchmark data.

• Journal of the Korean Society for Library and Information Science
• /
• v.21
• /
• pp.225-248
• /
• 1991

The paper suggests newly conceptualized information retrieval system on the notion of citation analysis. The paper also criticizes the traditional information retrieval techniques using Boolean logic. The underlying assumption of this paper is that any pair of papers cited by one paper could be strongly related each other in meaning (Co-citation Analysis). And also any two papers to share same references could be similar each other (Bibliographic Coupling), By using graph algorithm, the networks of two kinds of the papers (the citing group, the cited group) is made in the fields of the genetics and the information and library science. The results say that the maps or networks for cited and citing groups can be useful when applied to the paper set made by the broad searching by subjects or keywords.

• Journal of Information Technology Services
• /
• v.7 no.4
• /
• pp.199-208
• /
• 2008

Tagging represents one of the Web 2.0 technology, and has an appropriate mechanism for the classification of dynamically changing Web informations. This technique is capable of searching the Web informations using the user specified tags, but still it has a limitation of providing only the limited informations to the tags. Therefore, in order to search the related informations easily, we need to extend this technique further to search not only the desired informations through the designated tags and also the related informations. In this paper, we first have designed and developed an algorithm that can get a desired tag cluster, which is capable of collecting the searched tags along with the related tags. We first performed a test to compare the difference between the user collected tag data through RSS and the reduced data. The second test focused on the accuracy of extracted related tags that depends on the similarity functions, such as the Pearson Correlation and Euclidean. Finally, we showed the final results visually using the graph algorithm.