Given a groupoid , and , we say that is antiassociative if an only if for all , and are never equal. Generalizing this, is -antiassociative if and only if for all , any two distinct expressions made by putting parentheses in are never equal. We prove that for every , there exist finite groupoids that are -antiassociative. We then generalize this, investigating when other pairs of groupoid terms can be made never equal.
In [FS1] we announced a precise asymptotic formula for the ground-state energy of a non-relativistic atom. The purpose of this paper is to establish an elementary inequality that plays a crucial role in our proof of that formula. The inequality concerns the Thomas-Fermi potentialVTF = -y(ar) / r, a > 0, where y(r) is defined as the solution of⎧ y''(x) = x-1/2y3/2(x),⎨ y(0) = 1,⎩ y(∞) = 0.
The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning process executed...
The paper presents a short overview of the foundations of the Role-Based Access Control Modal Model and its properties. In particular, the translation of these model formulae to the first-order logic formulae in a form of Horn's clauses is analysed. The automation of processes and mechanisms related to access control on the basis of logical automated reasoning and the PROLOG language are described.
Mathematics Subject Classification: 26A33, 93C83, 93C85, 68T40Fractional Calculus (FC) goes back to the beginning of the theory of differential calculus. Nevertheless, the application of FC just emerged in the last two decades. In the field of dynamical systems theory some work has been carried out but the proposed models and algorithms are still in a preliminary stage of establishment. This article illustrates several applications of fractional calculus in robot manipulator path planning and control....
In this paper a method for the design of algorithms is presented which use fuzzy techniques in order to achieve a better vagueness treatment. A base of rules will be developed in order to design the algorithms. Data fuzzification problem is solved by using probability density functions and probability distribution functions, whereas data analysis is set out associating, to each one of the analysis rules, a fuzzy set which will be obtained by applying an aggregation function which will be defined...
A synthesis of recent development of regime-switching models based on aggregation operators is presented. It comprises procedures for model specification and identification, parameter estimation and model adequacy testing. Constructions of models for real life data from hydrology and finance are presented.
The paper discusses the application of a similarity metric based on compression to the measurement of the distance among Bulgarian dia- lects. The similarity metric is de ned on the basis of the notion of Kolmo- gorov complexity of a le (or binary string). The application of Kolmogorov complexity in practice is not possible because its calculation over a le is an undecidable problem. Thus, the actual similarity metric is based on a real life compressor which only approximates the Kolmogorov complexity....
In this work, the application of fuzzy logic in surveillance systems based on cameras is analyzed. Three different fuzzy systems have been tested and compared with a crisp decision system. The first one has been developed using an expert knowledge, the second one was learned from recorded videos, and a third one is developed as a refinement taking into account evaluation with ground truth. In all cases, the core of the system is the association function, in which the developed fuzzy system takes...
Étant donné l'importance que prennent les grammaires catégorielles dans le domaine de la linguistique computationnelle, il nous a semblé intéressant de dresser un panorama sur cette question. Nous espérons fournir, aux chercheurs intéressés, un matériau de base susceptible de les aider à approfondir par eux-mêmes le sujet.
Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented....