An algorithmic framework is developed for automatic deployment of car-like robots based on Linear Temporal Logic (LTL) formulae over a set of regions of interest in the environment. The environment and the regions of ...
详细信息
Diversity of loads, resistive and inductive, monophase and three phase, balanced and unbalanced, developed with power electronics or not, led to power quality problems at consumer level. Problems that can be resolved ...
详细信息
In this paper the relationship between one-sided concept lattices and their restricted version is described. One-sided concept lattices are based on the Galois connections within Formal Concept Analysis (FCA) framewor...
详细信息
In this paper the relationship between one-sided concept lattices and their restricted version is described. One-sided concept lattices are based on the Galois connections within Formal Concept Analysis (FCA) framework, which allows to analyse object-attribute models with different structures for truth values of attributes. We present the approach for generation of one-sided concept lattices from restricted formal context, which is obtained from given one by omitting some subset of the set of all attributes. The resulted algorithm for such restricted problem is described, together with the discussion on its correctness.
In this paper we provide experimental comparison on time complexity of algorithm for creation of Generalized One-Sided Concept Lattices according to the sparseness of the input data table between standard and sparse-b...
详细信息
ISBN:
(纸本)9781467352055
In this paper we provide experimental comparison on time complexity of algorithm for creation of Generalized One-Sided Concept Lattices according to the sparseness of the input data table between standard and sparse-based implementation. It is an incremental algorithm related to FCA (Formal Concept Analysis), which is ready to be used with various attribute types and to create so-called generalized one-sided concept lattice. While these algorithms are generally exponential, in practice the complexity can be considerably reduced, e.g., for sparse input data tables. We describe sparse-based implementation of two crucial operations in our algorithm and provide experiments with different sparse data tables, where time complexity is studied for comparison of standard and sparse-based implementation of the algorithm.
This paper proposes an algorithm for finding the optimal trajectory on a set of admissible paths based on the task tree approach. The space solution represents two-dimensional plane. A classical approach is based on D...
详细信息
In this paper the analysis of the influence of C60 fullerenes on flow electrification of mineral insulating oil during aging is presented. Three sets of samples, one fresh and two aged for 24 h and 96 h were tested fo...
详细信息
This paper presents a procedure for optimization of the switched reluctance drive, in order to achieve required torque-speed characteristics. SRM configuration and characteristics are given, and experimental verificat...
详细信息
This work considers the whole process of making a path finding simulator for Pioneer 3DX mobile robot. This simulator needs to be provided implementation of various optimal path finding algorithms and make their compa...
详细信息
This paper focuses on problems which arise from network controlled systems within master-slave type of Communications. Since the master and slave are connected over the network, network-induced time-varying delay has ...
详细信息
This paper discusses some of the interesting properties of stability analysis of a discretized wave equation. The solutions of the wave equation are wave functions, hence oscillating, so when testing stability the dis...
详细信息
暂无评论