The increasing number of people are living with disability in the World and their access to formal education is considered a challenge for the development of the online education and educational resources. This problem is considered one of the 17 sustainable development goals that are focused on inclusive and equitable quality education. Nevertheless, the existing proposals for mainstream accessibility in virtual education are still complex to apply. However, the models, standards, and good practices to contribute to the virtual educational process and the design of learning for all are identified. For these reasons, in this paper, we describe an accessibility evaluation proposal based on 4 interaction domains: user analysis and interaction, intelligent systems, knowledge databases, and evaluation. In the same way, we describe a set of tools that constitute a Repository of Accessible Learning Objects (RALO) from the perspective of accessibility and adaptability metadata. In this line, the knowledge database follows the regulation and educational models focused on the students with disabilities needs and preferences from the conception of universal design. The validation of the proposal is based on the interaction study and analysis of regular and disabled students and teachers who developed the Learning Objects (LO). To determine whether there was consensus among the teacher’s scores, we used Kendall’s Coefficient of Concordance W.

In this paper, we introduce the notion of infinity branches and approaching surfaces. We obtain an algorithm that compares the behavior at the infinity of two given algebraic surfaces that are defined by an irreducible polynomial. Furthermore, we show that if two surfaces have the same asymptotic behavior, the Hausdorff distance between them is finite. All these concepts are new and represent a great advance for the study of surfaces and their applications.

We present symbolic algorithms for computing the g-asymptotes, or generalized asymptotes, of a plane algebraic curve, $\mathcal{C}$, implicitly or parametrically defined. The g-asymptotes generalize the classical concept of asymptotes of a plane algebraic curve. Both notions have been previously studied for analyzing the geometry and topology of a curve at infinity points, as well as to detect the symmetries that can occur in coordinates far from the origin. Thus, based on this research, and in order to solve practical problems in the fields of science and engineering, we present the pseudocodes and implementations of algorithms based on the Puiseux series expansion to construct the g-asymptotes of a plane algebraic curve, implicitly or parametrically defined. Additionally, we propose some new symbolic methods and their corresponding implementations which improve the efficiency of the preceding. These new methods are based on the computation of limits and derivatives; they show higher computational performance, demanding fewer hardware resources and system requirements, as well as reducing computer overload. Finally, as a novelty in this research area, a comparative analysis for all the algorithms is carried out, considering the properties of the input curves and their outcomes, to analyze their efficiency and to establish comparative criteria between them.