• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.49-63
• /
• 2008

RDF is the base ontology model which is used in Semantic Web defined by W3C. OWL expands the RDF base model by providing various vocabularies for defining much more ontology relationships. Recently Jain and Farkas have suggested an RDF access control model based on RDF triple. Their research point is to introduce an authorization conflict problem by RDF inference which must be considered in RDF ontology data. Due to the problem, we cannot adopt XML access control model for RDF, although RDF is represented by XML. However, Jain and Farkas did not define the authorization propagation over the RDF upper/lower ontology concepts when an RDF authorization is specified. The reason why the authorization specification should be defined clearly is that finally, the authorizatin conflict is the problem between the authorization propagation in specifying an authorization and the authorization propagation in inferencing authorizations. In this article, first we define an RDF access authorization specification based on RDF triple in detail. Next, based on the definition, we analyze the authoriztion conflict problem by RDF inference in detail. Next, we briefly introduce a method which can quickly find an authorization conflict by using graph labeling techniques. This method is especially related with the subsumption relationship based inference. Finally, we present a comparison analysis with Jain and Farkas' study, and some experimental results showing the efficiency of the suggested conflict detection method.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.112-124
• /
• 2008

RDF and OWL are the primary base technologies for implementing Semantic Web. Recently, many researches related with them, or applying them into the other application domains, have been introduced. However, relatively little work has been done for securing the RDF and OWL data. In this article, we briefly introduce an RDF triple based model for specifying RDF access authorization related with RDF security. Next, to efficiently find the authorization conflict by RDF inference, we introduce a method using prime number graph labeling in detail. The problem of authorization conflict by RDF inference is that although the lower concept is permitted to be accessed, it can be inaccessible due to the disapproval for the upper concept. Because by the RDF inference, the lower concept can be interpreted into the upper concept. Some experimental results show that the proposed method using the prime number graph labeling has better performance than the existing simple method for the detection of the authorization conflict.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.181-188
• /
• 2001

An XML is an markup language which has been focused on the next generation Web programming language. It easily represents the complex structure of a document, and it is possible to provide the access control over each component of an XML document. An implicit authorization technique means that granting an authorization to a node has effect on granting the same implicit authorization to its all descendants. Therefore, it enhances the time for the authorization grant and reduces the memory required for the authorization information. An authorization technique using an intention type and a authorization replacement solves a redundancy problem and decides whether the access is possible or the authorization conflict occurs at the first attempt.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.422-433
• /
• 2009

As an effort to secure Semantic Web, in this paper, we introduce an RDF access authorization model based on an ontology hierarchy and an RDF triple pattern. In addition, we apply the authorization model to RDF query validation for approved access authorizations. A subscribed SPARQL or RQL query, which has RDF triple patterns, can be denied or granted according to the corresponding access authorizations which have an RDF triple pattern. In order to efficiently perform the query validation process, we first analyze some primary authorization conflict conditions under RDF subsumption inference, and then we introduce an efficient query validation algorithm using the conflict conditions and Dewey graph labeling technique. Through experiments, we also show that the proposed validation algorithm provides a reasonable validation time and when data and authorizations increase it has scalability.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2495-2504
• /
• 2015

This study was performed in order to contributing the conflict factors which largely affects the efficient promotion of Urban Rehabilitation Project. then, it aims to induce conflict factors which affect the business period and business expense through PLS Regression Analysis. The data was build up from union members, tenants and merchants who are living in the completed urban rehabilitation area. In the case of 'Business period', it shows the priority on conflict factors in this order such as the 'Approval and Authorization for union establishment', 'Approval and Plan for business enforcement' and 'Interruption of interest group related to service business such as business delay'. In addition, In the case of 'Business expenses', it shows the priority on conflict factors in this order such as the 'Approval and Authorization for union establishment', 'Selling contract', 'Report of Demolition and Loss' and 'Plan and Authorization of Management disposition'.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.45-47
• /
• 1998

객체지향 데이터베이스 시스템에서 많이 연구되고 있는 묵시적 권한부여(implicit authorization) 방법은 모든 객체에 대하여 일일이 권한을 부여하는 오버헤드를 줄이기 위한 방법이다. 묵시적 권한부여 방법에서는 기존의 권한과 새로이 추가될 권한간의 충돌(conflict) 여부의 효율적인 검사가 중요하다. 기존의 데이터베이스 단위 계층 구조( database granularity hierarchy)에서의 의도형 권한부여(intention type authorization) 기법은 자신의 자손 노드에 대한 권한을 쉽게 판정할 수는 있지만, 클래스 복합 계층 구조(class composition hierarchy)상에서의 임의의 한 노드 ni에 추가로 권한을 부여할 때 ni의 자손 노드와 복합 참조(composite reference)의 관계를 가지는 노드 nj들에 대한 권한과의 충돌 여부를 탐지하기 위하여 추가로 nj들에 대한 권한을 일일이 탐색해야 하는 어려움이 있었다. 본 논문에서는 클래스 복합 계층 구조에서의 묵시적 권한부여 하에서 발생할 수 있는 권한간의 충돌을 효율적으로 탐지하는 새로운 기법을 확장하여 제안한다. 제안된 복합 계층 의도형 권한부여(intention type authorization for composition hierarchy)기법은 계층 구조에서 복합 참조의 관계를 따라 nj를 일일이 탐색할 필요 없이 노드 ni에서 바로 충돌 여부를 판정할 수 있는 장점을 가진다.

• The Mathematical Education
• /
• v.61 no.2
• /
• pp.221-237
• /
• 2022

This study investigated teachers' decision-making and related factors in the elementary textbook adoption process. Our participants include 296 elementary teachers who took part in the mathematics textbook (grades 3 and 4) adoption committees in his/her schools. Our study used the decision-making model of Shavelson and Stern (1981) for analyzing teacher beliefs and attitudes concerning choices and priorities, judgments, evaluation methods, and key factors to reviewing and selecting a mathematics textbook. Our discussion includes teacher beliefs and intentions and the way they come into conflict with determinant factors that influence the decision-making of textbook adoption. Findings also reveal the unique nature of elementary school teaching as generalists in contrast with secondary teachers as specialists, playing a significant role in the adoption process. Lastly, the study discusses the entanglements of textbook reform and explains the discrepancy between textbook authorization/approval policies versus the plight of little change (and innovation) in mathematics textbooks.

• Proceedings of the Safety Management and Science Conference
• /
• 2010.11a
• /
• pp.175-189
• /
• 2010

With the foundation of the WTO in 1995, the era of boundless and unlimited competition between many of the countries around the world has begun. In order to elevate the competitiveness in the international market, we have incorporated the QMS and the EMS system, establish by the International Standardization Organization, and the process has been operated under the authorization. However, many Korea companies' separate enforcement of the QMS and the EMS system is causing the dissipation of the labor force and the invested capital. As we can see through studying the contents on this paper, the number of documents has been reduced down to 54% (From 139 of them to 64 of them), and the conflict and the chaos that could have happened between the documents has been prevented. Its' outcome is attributed to the foundation and the embarkation on the Integrated Management Systems of the KS, QMS, and EMS. Not only that, it has also reduced the waste elements up to greater than 40%.

• Journal of the Korea Safety Management & Science
• /
• v.12 no.4
• /
• pp.229-238
• /
• 2010

With the foundation of the WTO in 1995, the era of boundless and unlimited competition between many of the countries around the world has begun. In order to elevate the competitiveness in the international market, we have incorporated the QMS and the EMS system, establish by the International Standardization Organization, and the process has been operated under the authorization. However, many Korea companies' separate enforcement of the QMS and the EMS system is causing the dissipation of the labor force and the invested capital. As we can see through studying the contents on this paper, the number of documents has been reduced down to 54% (From 139 of them to 64 of them), and the conflict and the chaos that could have happened between the documents has been prevented. Its' outcome is attributed to the foundation and the embarkation on the Integrated Management Systems of the KS, QMS, and EMS. Not only that, it has also reduced the waste elements up to greater than 40%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.1-3
• /
• 2012

RIF(Rule Interchange Format)는 시맨틱 웹의 구조중 규칙 계층을 담당하며 기존에 사용되고 있는 여러 상이한 규칙 언어들 간의 호환을 위한 표준 규칙 언어라고 할 수 있다. RIF는 W3C에서 승인되었다. 시맨틱웹을 위한 표준 온톨로지 언어로는 RDF와 OWL이 있으며, 최근 RDF 데이터에 대한 접근제어 (Access Control) 메커니즘과 관련하여 일부 학술적 연구가 수행되었다. 본 논문에서는 RDF 데이터와 결합될 수 있는 RIF 추론 규칙에 대해 이미 제안한 RDF 접근제어 메커니즘을 확장하고자 한다. RDF 데이터에 대해 명세된 접근 권한은 RIF 추론에 의하여 권한 충돌이 발생할 수 있고, 그로 인해 접근 권한은 허용되지 않을 수 있다. 본 논문에서는 어떤 조건에서 이러한 RIF 추론에 의한 권한 충돌이 발생하는 지를 분석하며, 이미 제안한 그래프 레이블링을 사용하는 충돌 발견 방법이 RIF 추론과 관련하여서도 효율적임을 보인다. 실험에서는 제안된 방법이, 비록 포함관계 추론에 특화 되었지만, Chase 알고리즘에 기반한 다른 연구에서의 방법보다 발견 시간을 크게 감소시킴을 보인다.