Exploring Variability of Visual Accessibility Options in Operating Systems

Digital technologies are an opportunity to overcome disabilities, provided that accessibility is ensured. In this paper, we focus on visual accessibility and the way it is supported in Operating Systems (OS). The significant variability in this support has practical consequences, e.g., the difficulty to recommend or select an OS, or migrate from one OS to another. This suggests building a variability model for OS that would classify them and would serve as a reference. We propose a methodology to build such a variability model with the help of the Formal Concept Analysis (FCA) framework. In addition, as visual accessibility can be divided into several concerns (e.g., zoom, or contrast), we leverage an extension of FCA, namely Relational Concept Analysis. We also build an ontology to dispose of a standardized description of visual accessibility options. We apply our proposal to the analysis of the variability of a few representative operating systems.

Download Full-text

Finding Topics in Email Using Formal Concept Analysis and Fuzzy Membership Functions

Advances in Artificial Intelligence - Lecture Notes in Computer Science ◽

10.1007/978-3-540-68825-9_11 ◽

2008 ◽

pp. 108-113 ◽

Cited By ~ 1

Author(s):

Liqiang Geng ◽

Larry Korba ◽

Yunli Wang ◽

Xin Wang ◽

Yonghua You

Keyword(s):

Formal Concept Analysis ◽

Concept Analysis ◽

Fuzzy Membership ◽

Formal Concept ◽

Membership Functions ◽

Fuzzy Membership Functions

Download Full-text

Towards automated assessment generation in e-learning systems using combinatorial testing and Formal Concept Analysis

IEEE Access ◽

10.1109/access.2021.3070510 ◽

2021 ◽

pp. 1-1

Author(s):

Frano Skopljanac-Macina ◽

Ivona Zakarija ◽

Bruno Blaskovic

Keyword(s):

Formal Concept Analysis ◽

Concept Analysis ◽

Learning Systems ◽

Formal Concept ◽

Combinatorial Testing ◽

Automated Assessment ◽

E Learning

Download Full-text

Continuous Domains in Formal Concept Analysis*

Fundamenta Informaticae ◽

10.3233/fi-2021-2025 ◽

2021 ◽

Vol 179 (3) ◽

pp. 295-319

Author(s):

Longchun Wang ◽

Lankun Guo ◽

Qingguo Li

Keyword(s):

Formal Concept Analysis ◽

Concept Analysis ◽

Continuous Functions ◽

Formal Context ◽

Formal Concept ◽

Contractive Mappings ◽

Continuous Domains ◽

Algebraic Domains ◽

Scott Continuous ◽

Continuous Domain

Formal Concept Analysis (FCA) has been proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notion of contractive mappings over formal contexts is proposed, which can be viewed as a generalization of interior operators on sets into the framework of FCA. Then, by considering subset-selections consistent with contractive mappings, the notions of attribute continuous formal contexts and continuous concepts are introduced. It is shown that the set of continuous concepts of an attribute continuous formal context forms a continuous domain, and every continuous domain can be restructured in this way. Moreover, the notion of F-morphisms is identified to produce a category equivalent to that of continuous domains with Scott continuous functions. The paper also investigates the representations of various subclasses of continuous domains including algebraic domains and stably continuous semilattices.

Download Full-text

The Research of Semantic Web Service Matching Algorithm Based on the Formal Concept Analysis

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.760-762.1708 ◽

2013 ◽

Vol 760-762 ◽

pp. 1708-1712

Author(s):

Ying Fang Li ◽

Ying Jiang Li ◽

Yan Li ◽

Yang Bo

Keyword(s):

Semantic Web ◽

Web Service ◽

Formal Concept Analysis ◽

Service Discovery ◽

Concept Lattice ◽

Concept Analysis ◽

Formal Concept ◽

Semantic Web Service ◽

Matching Algorithm ◽

Service Matching

At present, as the number of web services resources on the network drastically increased, how to quickly and efficiently find the needed services from publishing services has become a problem to resolve. Aiming at the problems of low efficiency in service discovery of traditional web service, the formal concept analysis ( FCA) is introduced into the semantic Web service matching, and a Matching Algorithm based semantic web service is proposed. With considering the concept of limited inheritance,this method introduces the concept of limited inheritance to the semantic similarity calculation based on the concept lattice. It is significant in enhancing the service function matching in practical applications through adjust the calculation.

Download Full-text