• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.15-18
• /
• 2019

점점 더 많은 어플리케이션이 Serverless 컴퓨팅 기반으로 구현되고 있다. Serverless 서비스 제공자는 가용자원을 확보하기 위하여 요청이 장시간동안 발생하지 않은 서비스 인스턴스를 종료한다. 종료된 인스턴스에 대한 요청은 Cold Start 로 인한 지연시간이 발생하게 된다. 서비스 사용자는 Cold Start 를 방지하기 위해 인스턴스가 종료되지 않도록 주기적으로 의미 없는 요청을 하게 되고, 이는 Serverless 서비스 시스템에 불필요한 오버헤드를 발생시키게 된다. 따라서 이 논문은 이러한 불필요한 오버헤드를 줄이기 위한 전략을 제시하고 그 구현에 관해 설명한다.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.585-592
• /
• 2003

In the spatial database systems, it is necessary to manage spatial objects that have two or more aspatial information with different security levels on the same layer. If we adapt the polyinstantiation concept of relational database system for these spatial objects, it is difficult to process the representation problem of spatial objects and to solve the security problem that is service denial and information flow by access of subject that has a different security level. To address these problems, we propose a polyinstantiation method for security management of spatial objects in this paper. The proposed method manages secure spatial database system efficiently by creating spatial objects according to user's security level through security-level-conversion-step and polyinstantiation-generation-step with multi-level security policy. Also, in case of user who has a different security level requires secure operations, we create polyinstance for spatial object to solve problems of service denial and information flow.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.457-460
• /
• 2005

본 논문에서는 추론규칙을 통한 온톨로지 구축과 이를 이용한 지능형 여행 추천 시스템 적용 방법에 대해 제안하고자 한다. 사용자 프로파일과 질의어 분석을 통한 사용자 성향 분석은 메타데이터 파일로 작성되며, 지능형 여행 추천을 위한 여행 온톨로지 및 Description Logic을 기반으로 생성된 추론 규칙은 정보 저장소에 저장한다. 온톨로지를 이용한 정보 검색은 다양하고 복잡한 조건에서 검색이 가능하였고, 인스턴스 추가시 각 클래스의 재생성 과정 없이 규칙의 설정만으로 쉽게 인스턴스를 추가할 수 있었다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.83-94
• /
• 2016

Recent cloud, big data, there is a problem for the architectural security vulnerability to the server platforms of various fields such as artificial intelligence occurs consistently, but using the virtualization technology. In addition, most secure virtualization technology is known to be dependent on the type is limited and the platform provider. This paper presents a method for mutual authentication for secure data between multiple instances of a shared virtualized environment. The proposed method was designing a security architecture in consideration of the mutual authentication between multiple independent instances, and enhance the safety of a security protocol for sharing data by applying a key chain techniques. Performance analysis results and the existing security architecture demonstrated that protect each virtualized instances of the session and the other way, a compliance effectiveness for each instance of the mutual authentication process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.86-93
• /
• 2008

The construction of ontology defines as complicated semantic relations needs precise and expert skills. For the well defined ontology in real applications, plenty of information of instances for ontology classes is very critical. In this study, crawling algorithm which extracts the fittest topic from the Web overflowing over by a great number of documents has been focused and developed. Proposed crawling algorithm made a progress to gather documents at high speed by extracting topic-specific Link using URL patterns. And topic fitness of Link block text has been represented by fuzzy sets which will improve a precision of the focused crawler.

• Journal of Digital Convergence
• /
• v.16 no.5
• /
• pp.399-406
• /
• 2018

Much research has been done using the KDDCup99 data set to study intrusion detection using artificial intelligence. Previous studies have shown that the performance of the SMO (SVM) algorithm is superior. However, intrusion detection studies of new intrusion types not used in training are insufficient. In this paper, a model was created using the instances of weka's SMO and KDDCup99 training data set, kddcup.data.gz. We tested existing instances(292,300) of the corrected.gz file and new intrusions(18,729). In general, intrusion labels not used in training are not tested, so new intrusion labels were changed to normal. Of the 18,729 new intrusions, 1,827 were classified as intrusions. 1,827 instances classified as new intrusions are buffer_overflow. Three, neptune. 392, portsweep. 164, ipsweep. 9, back. 511, imap. 1, satan. Dogs, 645, nmap. 102.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.965-968
• /
• 2003

본 연구에서는 웹 기반 멀티미디어 공동 작업 환경에서의 다중 세션을 잘 유지하기 위하여 웹 노트 오류 제어를 위한 관리기에 대해서 기술한다. 웹 기반 멀티미디어 공동 작업 환경은 멀티미디어 협력 작업에 웹의 동기화 기술을 확장한 웹 노트, 즉 복제형 구조에 기반을 둔 응용 공유의 동작 원리를 이용하여 동기화를 수행할 수 있는 환경을 의미한다. 각 세션의 생성에 따라 서비스 제공자는 생성된 서비스 제공자 인스턴스를 생성하게 되고 이 인스턴스는 부모인 서비스 제공자의 자원을 이용하여 다수 세션을 지원한다. 이러한 환경에서의 웹 노트 오류 제어 시스템을 기술한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.291-296
• /
• 2007

The ontology has been used widely in recent years with its aim to accumulate knowledge that machine can comprehend. We believe that machine can manage and analyze information on its own using the ontology. In this paper, we propose an algorithm that allows us to extract properties of ontology instances from structured information already existing in web documents. In particular, by stratification of the domain knowledge that is composed of property information, we were able to make the algorithm better and improve the quality of extraction results. In our experiments with 20 thousands targeted documents, we were able to extract property information with 83% confidence.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.161-171
• /
• 2014

When the Hough transform is applied to identify an instance of a given model, the output is typically a histogram of votes cast by a set of image features into a parameter space. The next step is to threshold the histogram of counts to hypothesize a given match. The question is "What is a reasonable choice of the threshold?" In a standard implementation of the Hough transform, the threshold is selected heuristically, e.g., some fraction of the highest cell count. Setting the threshold too low can give rise to a false alarm of a given shape(Type I error). On the other hand, setting the threshold too high can result in mis-detection of a given shape(Type II error). In this paper, we derive two conditional probability functions of cell counts in the accumulator array of the generalized Hough transform(GHough), that can be used to select a scientific threshold at the peak detection stage of the Ghough.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.302-313
• /
• 2003

Currently, DTD(Document Type Definition) Definition of Music score has been widely studied according to applications, and the methods of automatic transformation from defined DTD to XML Schema is in progress. In addition, studies of structure of DTD definition are focused on the expression of music information by individual format. In this paper, expression method of the music information by continuous string values is suggested using the fact that measure is basically a component of score, and XML Schema is also modelled. In addition, mechanism extracting the music information from XML instance which was expressed using the proposed method is presented. As a result, XML Schema taking the continuous string values could be defined, instance obtained by the proposed method results in increasing efficiency by simplicity of XPATH and reduction of search step compared to previous method. In addition, it is possible for human to make direct expression, and it is known that the instance size decreases.