Designing Access Control Policy Using Formal Concept Analysis

2014 ◽  
Vol 602-605 ◽  
pp. 3822-3825 ◽  
Author(s):  
Bo Chen ◽  
Jia Di Qiu ◽  
Ming Ming Chen
Keyword(s):  
Access Control ◽  
Formal Concept Analysis ◽  
Control Policy ◽  
Order Theory ◽  
Concept Analysis ◽  
Experimental Results ◽  
Formal Concept ◽  
Access Control Policy ◽  
Computer Environment ◽  
Share Information

The need to securely share information among collaborating entities is increasingly becoming important. It often needed to implement access control (AC) models. The objective of this paper is to design access control policy using formal concept analysis, which is based on mathematical lattice and order theory. We provide discussion on how FCA can be used to capture RBAC constraints. We show with FCA, we can express more intend constrains than it can be done in traditional RBAC approach. The experimental results show that the approach is more resilient to dynamic computer environment.

scholarly journals Incremental Method of Generating Decision Implication Canonical Basis

2021 ◽  
Author(s):  
Shaoxia Zhang ◽  
Deyu Li ◽  
Yanhui Zhai
Keyword(s):  
Formal Concept Analysis ◽  
Canonical Basis ◽  
Concept Analysis ◽  
Experimental Results ◽  
Incremental Algorithm ◽  
Compact Representation ◽  
Formal Concept ◽  
Practical Applications ◽  
Incremental Method ◽  
Elementary Representation

Abstract Decision implication is an elementary representation of decision knowledge in formal concept analysis. Decision implication canonical basis (DICB), a set of decision implications with completeness and nonredundancy, is the most compact representation of decision implications. The method based on true premises (MBTP) for DICB generation is the most efficient one at present. In practical applications, however, data is always changing dynamically, and MBTP has to re-generate inefficiently the whole DICB. This paper proposes an incremental algorithm for DICB generation, which obtains a new DICB just by modifying and updating the existing one. Experimental results verify that when the samples in data are much more than condition attributes, which is actually a general case in practical applications, the incremental algorithm is significantly superior to MBTP. Furthermore, we conclude that, even for the data in which samples is less than condition attributes, when new samples are continually added into data, the incremental algorithm must be also more efficient than MBTP, because the incremental algorithm just needs to modify the existing DICB, which is only a part of work of MBTP.

Research on Malicious Behavior of Firmware Based on Hardware Resources Access Control

2013 ◽  
Vol 340 ◽  
pp. 737-743
Author(s):  
Le Kang Yang ◽  
Di Chen ◽  
Ju Mei ◽  
Liang Xue
Keyword(s):  
Access Control ◽  
Control Policy ◽  
Malicious Code ◽  
Experimental Results ◽  
Formal Definition ◽  
System Software ◽  
Access Control Policy ◽  
Malicious Behavior ◽  
Back Door ◽  
Detecting Method

As same as the traditional application and system software, firmware also faced the risk of malicious code like hobbyhorse, back door, logical bomb and so on. Firmware exhibited strong cohesion and hardware relativity, which make the malicious action in firmware to be different from that in the traditional software. This paper analyzed the specificities of firmware and the malicious behaviour about it, then expatiate the essence of the malicious behaviour of the firmware, and presented a firmware formal definition and detecting method which was based on the hardware resources access control policy. Experimental results proved that the method was effective to detect the malicious firmware.

scholarly journals Finding Music Formal Concepts Consistent with Acoustic Similarity

2020 ◽  
Author(s):  
Yoshiaki Okubo
Keyword(s):  
Efficient Algorithm ◽  
Formal Concept Analysis ◽  
Concept Analysis ◽  
Point Of View ◽  
Experimental Results ◽  
Formal Concept ◽  
Acoustic Similarity ◽  
Formal Concepts

In this paper, we present a method of finding conceptual clusters of music objects based on Formal Concept Analysis. A formal concept (FC) is defined as a pair of extent and intent which are sets of objects and terminological attributes commonly associated with the objects, respectively. Thus, an FC can be regarded as a conceptual cluster of similar objects for which its similarity can clearly be stated in terms of the intent. We especially discuss FCs in case of music objects, called music FCs. Since a music FC is based solely on terminological information, we often find extracted FCs would not always be satisfiable from acoustic point of view. In order to improve their quality, we additionally require our FCs to be consistent with acoustic similarity. We design an efficient algorithm for extracting desirable music FCs. Our experimental results for The MagnaTagATune Dataset shows usefulness of the proposed method.

scholarly journals Four-Fold Formal Concept Analysis Based on Complete Idempotent Semifields

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 173
Author(s):  
Francisco José Valverde-Albacete ◽  
Carmen Peláez-Moreno
Keyword(s):  
Data Mining ◽  
Formal Concept Analysis ◽  
Order Theory ◽  
Concept Analysis ◽  
Galois Connection ◽  
Formal Concept ◽  
Data Mining Technique ◽  
Full Spectrum ◽  
Mining Technique ◽  
Ordered Pairs

Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lattice and Order Theory, that has several extensions to, e.g., fuzzy and idempotent semirings. At the heart of FCA lies a Galois connection between two powersets. In this paper we extend the FCA formalism to include all four Galois connections between four different semivectors spaces over idempotent semifields, at the same time. The result is K¯-four-fold Formal Concept Analysis (K¯-4FCA) where K¯ is the idempotent semifield biasing the analysis. Since complete idempotent semifields come in dually-ordered pairs—e.g., the complete max-plus and min-plus semirings—the basic construction shows dual-order-, row–column- and Galois-connection-induced dualities that appear simultaneously a number of times to provide the full spectrum of variability. Our results lead to a fundamental theorem of K¯-four-fold Formal Concept Analysis that properly defines quadrilattices as 4-tuples of (order-dually) isomorphic lattices of vectors and discuss its relevance vis-à-vis previous formal conceptual analyses and some affordances of their results.

Sign in / Sign up

Export Citation Format

Share Document