• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.33-34
• /
• 2014

이 논문에서는 클라우드 데이터베이스를 위한 분리수행이 가능한 트랜잭션 처리시스템을 제안한다. 제안하는 시스템은 기존의 클라우드 데이터베이스의 수정을 최소화 하면서 트랜잭션 처리가 가능하도록 할수 있다. 질의를 클라우드 데이터베이스의 CRUD(Create, Read, Update, Delete) 연산의 조합으로 변환하여 수행시킴으로써 동시성제어와 장애복구에 관한 기능을 제공한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.07a
• /
• pp.309-310
• /
• 2012

최근에 웹 온톨로지 언어를 사용한 웹 서비스와 애플리케이션들이 많이 개발됨에 따라 RDF/S를 기반으로 한 온톨로지 문서의 크기가 증가되었고 이로 인해 효율적으로 문서를 저장하고 검색하기위한 시맨틱 웹 정보관리 시스템의 필요가 대두되었다. 본 논문에서는 시맨틱 웹 정보관리 시스템에서 클래스와 프로퍼티의 삭제 알고리즘을 제안한다. 제안한 삭제 알고리즘에서는 클래스나 프로퍼티가 삭제될 때에 이를 반영하여 계층 정보의 스키마 정보가 변경된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.133-135
• /
• 2001

본 논문에서는 MPEG-2 프로그램 스트림(Program Stream)을 위한 A/V(Audio/Video) 편집기를 제안하고 구현하였다. 이 편집기에서는 사용자가 일반 문서를 편집하듯이 간단한 조작만으로 스트림(Stream)을 복사(Copy), 자름(Cut), 삭제(Delete), 붙이기(Paste)가 가능하며, 또한 스트림 내에서 임의로 조합하여 새로운 스트림을 생성할 수 있는 조합기능도 제공된다. 기존 편집기의 복잡성을 감소시키고 사용자가 접근하기 쉽도록 제작되었으며, 계산량을 현저히 줄임으로써 보다 향상된 성능을 제공할 수 있다.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.539-544
• /
• 2005

In this paper, we propose the one-step least squares method based on the squared differences to estimate the parameters of the variogram used for spatial data modelling, and discuss its asymptotic efficiency. The proposed method does not require to specify lags of interest and partition lags, so that we can delete the subjectiveness and ambiguity originated from the lag selection in estimating spatial dependence.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.413-416
• /
• 2004

REST(Representational State Transfer)는 분산 컴퓨팅 플랫폼 모델이며, 세계에서 가장 큰 분산 응용인 Web에서 사용하고 있는 웹 구조 스타일 모델이다. 현재 웹의 기본 요소는 URI, HTTP, XML(HTML) 이며, REST는 이러한 인터넷 표준만을 사용한다. REST 에서 리소스의 식별은 URI로, 상태는 상태가 표현된 문서(리소스)로써 HTTP를 통해 전달된다. 리소스의 내용은 XML로 기술하며, 리소스 탐색 및 참조에는 HTTP의 표준 메서드인 GET, PUT, POST, DELETE 등만을 이용하는 것으로 분산 컴퓨팅을 모델링하고 있다. 따라서 서비스마다 다양한 메서드를 기억하여야 하는 SOAP 기반 웹 서비스에 비해 REST 모델의 분산 컴퓨팅 응용은 확장성 및 웹 친화성 측면에 있어서 매우 유리함을 알 수 있다.

• Proceedings of the PSK Conference
• /
• 2003.10b
• /
• pp.175.4-176
• /
• 2003

Our long-term research goals involve the SARs study and the synthetic procedure development of wogonin and its analogs. We investigated efficient synthetic pathways of wogonin and its bioisosteres in a large quantity to decipher the structural requirements for anti-inflammatory activities. We plan to serially delete or modify the 5,7-dihydroxyl groups of wogonin to observe the effects of the hydroxyl groups on anti-inflammatory activity. Also we modofied the 8- methoxy group on a ring since it is known to be necessary for biological activity. (omitted)

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.456-460
• /
• 2012

Privacy Protection Act of 30 March 2012 was performed. In general, personal information management to enhance security in the DB server has a security system but, PC for the protection of the privacy and security vulnerability analysis is needed to research on self-diagnosis. In this paper, from a PC to search information relating to privacy and enhance security by encrypting and for delete file delete recovery impossible. In pc found vulnerability analysis is Check user accounts, Checking shared folders ,Services firewall check, Screen savers, Automatic patch update Is checked. After the analysis and quantification of the vulnerability checks through the expression, enhanced security by creating a checklist for the show, PC security management, server management by semi-hwahayeo activates. In this paper the PC privacy and PC security enhancements a economic damage and of the and Will contribute to reduce complaints.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.233-241
• /
• 2014

This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

• Journal of the Korean Society of Safety
• /
• v.35 no.1
• /
• pp.97-106
• /
• 2020

The objective of this paper is to suggest a new quantification method for multi-unit probabilistic safety assessment (PSA) that removes the overestimation error caused by the existing delete-term approximation (DTA) based quantification method. So far, for the actual plant PSA model quantification, a fault tree with negates have been solved by the DTA method. It is well known that the DTA method induces overestimated core damage frequency (CDF) of nuclear power plant (NPP). If a PSA fault tree has negates and non-rare events, the overestimation in CDF drastically increases. Since multi-unit seismic PSA model has plant level negates and many non-rare events in the fault tree, it should be very carefully quantified in order to avoid CDF overestimation. Multi-unit PSA fault tree has normal gates and negates that represent each NPP status. The NPP status means core damage or non-core damage state of individual NPPs. The non-core damage state of a NPP is modeled in the fault tree by using a negate (a NOT gate). Authors reviewed and compared (1) quantification methods that generate exact or approximate Boolean solutions from a fault tree, (2) DTA method generating approximate Boolean solution by solving negates in a fault tree, and (3) probability calculation methods from the Boolean solutions generated by exact quantification methods or DTA method. Based on the review and comparison, a new intersection removal by probability (IRBP) method is suggested in this study for the multi-unit PSA. If the IRBP method is adopted, multi-unit PSA fault tree can be quantified without the overestimation error that is caused by the direct application of DTA method. That is, the extremely overestimated CDF can be avoided and accurate CDF can be calculated by using the IRBP method. The accuracy of the IRBP method was validated by simple multi-unit PSA models. The necessity of the IRBP method was demonstrated by the actual plant multi-unit seismic PSA models.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.393-404
• /
• 2004

Recently, mSCTP (Mobile SCTP) has been proposed as a transport layer approach for supporting mobility. mSCTP is based on the ‘multi-homing’ feature of Stream Control Transmission Protocol(SCTP), and utilize the functions to dynamically add or delete IP addresses of end points to or from the existing connectionin order to support mobility. In this paper, we propose a mechanism to determine when to add or delete an W address, utilizing the link layer radio signal strength information in order to enhance the performance of mSCTP We also propose a mechanism for a mobile node to initiate the change of data delivery path based on link layer radio signal strength information. In addition, if it takes long time to acquire new data path, we propose an approach for reducing handover latency. The simulation results show that the performance of proposed transport layer mobility support mechanism is competitive compared to the traditional network layer mobility supporting approach. Especially, when the moving speed of mobile node is fast, it shows better performance than the traditional network layer approaches.