• Title/Summary/Keyword: API 조합

Search Result 54, Processing Time 0.031 seconds

Web API Discovery and Composition Techniques (Web API 발견 및 조합 기법)

  • Lee, Yong-Ju
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.960-963
    • /
    • 2014
  • 최근 매쉬업에 대한 관심도가 매우 높아짐에 따라 수많은 Web API들이 생성되고 있다. 이런 Web API들을 매쉬업 속으로 결합할 때 여러 가지 이슈들이 존재한다. 특히, 수많은 API들이 매쉬업 개발자에 의해 수동으로 조합될 때 이는 더욱 심각해진다. 본 논문에서는 Web API 발견 및 조합을 위한 하나의 새로운 기법을 제안한다. 제안된 발견 기법은 질의를 만족시키지 못하는 API들을 재빨리 필터링 시키는 전략을 수립한다. API 조합 기법은 발견 기법을 확장/발전시켜 Web API 입출력 사이의 시맨틱 유사도를 기반으로 하고, 원하는 목표를 만족하는 출력을 산출할 수 있는 사이클 없는 방향성 그래프(DAG)를 생성한다. 또한, Web API 발견 및 조합을 효율적으로 생성하기 위해 본 논문에서는 Web API 발견 및 조합 시스템을 구현한다.

Stream-based API composition for stable API Gateway (안정적인 API 게이트웨이를 위한 스트림 기반 API 조합)

  • Dong-il Cho
    • Journal of Internet Computing and Services
    • /
    • v.25 no.1
    • /
    • pp.1-8
    • /
    • 2024
  • In the API gateway, API composition is an essential function that can reduce the number of client calls and prevent over-fetching and under-fetching. API composition that operate with IMJ (In-Memory Join) consume a lot of resources, putting a burden on the performance of the API gateway. In this paper, to improve the problem of IMJ-style API composition, we propose SAPIC (Stream-based API Composition), which delivers the data to be composed to the client by streaming. SAPIC calls each MSA API that makes up the client response data and immediately streams the received response data to the client, reducing the resource consumption of the API gateway and providing faster response time compared to IMJ. As a result of a comparison experiment with GraphQL, a representative API combination technology, SAPIC recorded a maximum CPU occupancy rate of approximately 21 to 70 % lower, a maximum heap usage rate of approximately 16 to 74 % lower, and a throughput rate that was 1 to 2.3 times higher than GraphQL.

Semantic-based Automatic Open API Composition Algorithm for Easier-to-use Mashups (Easier-to-use 매쉬업을 위한 시맨틱 기반 자동 Open API 조합 알고리즘)

  • Lee, Yong Ju
    • 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.

A Survey of Mashup Capable Services' Retrieval Methods for OpenAPI using Semantic Technology (시맨틱 기술을 활용한 OpenAPI 조합 가능 서비스 검색에 관한 연구)

  • Choi, Young-Ho;Cha, Seung-Jun;Lee, Kyu-Chul
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.1234-1237
    • /
    • 2011
  • 본 논문은 시맨틱 기술을 활용한 OpenAPI 조합가능 서비스 검색 기법 개발을 위해 관련 연구들을 분석하여 적용방안을 도출하였다. OpenAPI 조합가능 서비스 검색이란 선택된 서비스의 출력과 매칭이 되는 입력을 가진 서비스나 선택된 서비스의 입력과 매칭되는 출력을 가진 서비스를 찾는 것이다. 본 논문에서는 기존의 키워드 기반의 조합 가능 서비스 검색 기법의 한계를 시맨틱 기술을 활용하여 해결하기 위한 관련연구로 SAWSDL-MX2와 LOG4SWS.KOM에 관한 논문들을 분석했다. SAWSDL-MX2에서는 세가지 매칭 기법과 이에 따른 유사도 분석 기법을 제시하였고, LOG4SWS.KOM에서는 두가지 매칭 기법과 이에 따른 유사도 분석 방법을 제시하였다. 관련 연구들에서 분석된 내용을 바탕으로 OpenAPI 조합 가능 서비스에 대한 매칭 기법의 정의, 유사도 분석 기법의 정의가 추후 진행되어야 한다.

A Semantic-Based Mashup Development Tool Supporting Various Open API Types (다양한 Open API 타입들을 지원하는 시맨틱 기반 매쉬업 개발 툴)

  • Lee, Yong-Ju
    • Journal of Internet Computing and Services
    • /
    • v.13 no.3
    • /
    • pp.115-126
    • /
    • 2012
  • Mashups have become very popular over the last few years, and their use also varies for IT convergency services. In spite of their popularity, there are several challenging issues when combining Open APIs into mashups, First, since portal sites may have a large number of APIs available for mashups, manually searching and finding compatible APIs can be a tedious and time-consuming task. Second, none of the existing portal sites provides a way to leverage semantic techniques that have been developed to assist users in locating and integrating APIs like those seen in traditional SOAP-based web services. Third, although suitable APIs have been discovered, the integration of these APIs is required for in-depth programming knowledge. To solve these issues, we first show that existing techniques and algorithms used for finding and matching SOAP-based web services can be reused, with only minor changes. Next, we show how the characteristics of APIs can be syntactically defined and semantically described, and how to use the syntactic and semantic descriptions to aid the easy discovery and composition of Open APIs. Finally, we propose a goal-directed interactive approach for the dynamic composition of APIs, where the final mashup is gradually generated by a forward chaining of APIs. At each step, a new API is added to the composition.

Malware API Classification Technology Using LSTM Deep Learning Algorithm (LSTM 딥러닝 알고리즘을 활용한 악성코드 API 분류 기술 연구)

  • Kim, Jinha;Park, Wonhyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.259-261
    • /
    • 2022
  • Recently, malicious code is not a single technique, but several techniques are combined and merged, and only important parts are extracted. As new malicious codes are created and transformed, attack patterns are gradually diversified and attack targets are also diversifying. In particular, the number of damage cases caused by malicious actions in corporate security is increasing over time. However, even if attackers combine several malicious codes, the APIs for each type of malicious code are repeatedly used and there is a high possibility that the patterns and names of the APIs are similar. For this reason, this paper proposes a classification technique that finds patterns of APIs frequently used in malicious code, calculates the meaning and similarity of APIs, and determines the level of risk.

  • PDF

A study on extraction of optimized API sequence length and combination for efficient malware classification (효율적인 악성코드 분류를 위한 최적의 API 시퀀스 길이 및 조합 도출에 관한 연구)

  • Choi, Ji-Yeon;Kim, HeeSeok;Kim, Kyu-Il;Park, Hark-Soo;Song, Jung-Suk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.5
    • /
    • pp.897-909
    • /
    • 2014
  • With the development of the Internet, the number of cyber threats is continuously increasing and their techniques are also evolving for the purpose of attacking our crucial systems. Since attackers are able to easily make exploit codes, i.e., malware, using dedicated generation tools, the number of malware is rapidly increasing. However, it is not easy to analyze all of malware due to an extremely large number of malware. Because of this, many researchers have proposed the malware classification methods that aim to identify unforeseen malware from the well-known malware. The existing malware classification methods used malicious information obtained from the static and the dynamic malware analysis as the criterion of calculating the similarity between malwares. Also, most of them used API functions and their sequences that are divided into a certain length. Thus, the accuracy of the malware classification heavily depends on the length of divided API sequences. In this paper, we propose an extraction method of optimized API sequence length and combination that can be used for improving the performance of the malware classification.

Semantic Service Composition Based on Semantic Broker (시맨틱 브로커 기반 시맨틱 서비스 조합)

  • Jung, Hanmin;Lee, Mi-Kyoung;You, Beom-Jong
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.283-288
    • /
    • 2009
  • Semantic service can be defined as the service providing search API or reasoning API based on ontology and Web Services. It performs a pre-defined task by exploiting URI, classes, and properties. This study introduces a semantic service composition method based on a semantic broker referring ontology and management information of semantic services stored in a semantic service manager with requirements of the user. The requirements consist of input instances, an output class, a visualization type, semantic service names, and property names. This composition method provides dynamically generated semantic service pipelines including composit semantic services. The user can execute the pipelines provided by the semantic broker to find a meaningful semantic pipeline. After all, this study contributes to develop a system supporting human service planners who want to find composit semantic services among distributed semantic services.

  • PDF

Open API Similarity Searcing Method for Mashups (매쉬업을 위한 Open API 유사성 탐색 방법)

  • Lee, Yong-Ju
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.1279-1282
    • /
    • 2012
  • 매쉬업은 공개된 Open API들을 이용하여 두 가지 이상의 서로 다른 자원을 섞어서 완전히 새로운 가치의 서비스를 만드는 것이다. 그렇지만, Open API 포털 사이트들은 매쉬업에서 사용 가능한 수많은 API들을 제공하고 있는데 이들에 대한 조합 가능한 API 들을 탐색하고 발견하는 것은 매우 힘들고 많은 시간이 소비되는 작업이다. 본 논문에서는 다양한 Open API 타입들에 대한 API 유사성 탐색 방법을 지원하기 위해 계층적 결합 클러스터링 알고리즘과 계층관계 형태소 분석 기법을 제안한다. 본 논문에서 제안된 방법은 programmableWeb과 xmethods.net 사이트로부터 168개의 REST API와 50개의 SOAP API를 다운로드 받아 실험 분석을 수행하였으며 우리의 접근방법이 기존의 키워드 검색 방법과 Woogle 방법 보다 성능이 우수함을 보인다.

Implementation of Learning Puzzle Game by using Combination of Korean Alphabet (한글 자음과 모음결합을 이용한 학습용 퍼즐게임 구현)

  • Jo, Jae-Young;Kim, Yoon-Ho
    • Journal of Digital Contents Society
    • /
    • v.7 no.4
    • /
    • pp.257-261
    • /
    • 2006
  • In this paper, learning oriented puzzle game which based on combination of consonant and vowel of Korean alphabet is implemented. Firstly, consonants and vowels of Korean alphabet are classified separately, and then reconstructed a word in real time. Word combinator is utilized by API based edit window and, in order to effective retrieve, initial combined syllable consonant based method is involved. Implemented Korean puzzle game can be used for improving the words learning capability for children.

  • PDF