Rationality, irrationality, and Wilf equivalence in generalized factor order.
Rationality of induced ordered weighted operators based on the reliability of the source of information in group decision-making
The aggregation of preference relations in group decision-making (GDM) problems can be carried out based on either the reliability of the preference values to be aggregated, as is the case with ordered weighted averaging operators, or on the reliability of the source of information that provided the preferences, as is the case with weighted mean operators. In this paper, we address the problem of aggregation based on the reliability of the source of information, with a double aim: a) To provide...
Reaction automata working in sequential manner
Based on the formal framework of reaction systems by Ehrenfeucht and Rozenberg [Fund. Inform. 75 (2007) 263–280], reaction automata (RAs) have been introduced by Okubo et al. [Theoret. Comput. Sci. 429 (2012) 247–257], as language acceptors with multiset rewriting mechanism. In this paper, we continue the investigation of RAs with a focus on the two manners of rule application: maximally parallel and sequential. Considering restrictions on the workspace and the λ-input mode, we introduce the corresponding...
Real and complex pseudozero sets for polynomials with applications
Pseudozeros are useful to describe how perturbations of polynomial coefficients affect its zeros. We compare two types of pseudozero sets: the complex and the real pseudozero sets. These sets differ with respect to the type of perturbations. The first set – complex perturbations of a complex polynomial – has been intensively studied while the second one – real perturbations of a real polynomial – seems to have received little attention. We present a computable formula for the real pseudozero...
Real quartic surfaces containing 16 skew lines.
Real time recognition with cellular automata : a meaningful example
Réalisation des operations arithmétiques fondamentales avec les nombres complexes au moyen des spectres mathématiques de M. Petrovitch sur les calculatrices électroniques
Realization of generalized good translation algorithm on computer
Realizations of Loops and Groups defined by short identities
In a recent paper, those quasigroup identities involving at most three variables and of “length” six which force the quasigroup to be a loop or group have been enumerated by computer. We separate these identities into subsets according to what classes of loops they define and also provide humanly-comprehensible proofs for most of the computer-generated results.
Real-time and complexity problems in automata theory
Reasoning in Basic Description Logics and Description Logics with Modal Operators
Reasoning Methods for Designing and Surveying Relationships Described by Sets of Functional Constraints
This work is supported by the Hungarian Scientific Research Fund (OTKA), grant T042706.Current methods of database schema design are usually based on modeling the real world as entity (or object) classes with relationships among them. Properties of relationships can be described by semantical database constraints. One of them is functional dependency, which has a key role in traditional database design. The three basic types of binary relationships that can be described by functional dependencies...
Rebalancing operations for deletions in AVL-trees
Rebootable and suffix-closed -power languages
Recent Advances in Stream Cipher Cryptanalysis
Recent Development of the DML-CZ and Its Current State
The project DML-CZ: The Czech Digital Mathematics Library has been implemented since 2005 and in 2010 switched over to routine operation. This report describes progress, growth and usage of the DML-CZ, the experience from cooperation with content providers in the designed editorial workflow, some newly implemented features, adjustments of the workflow following from both the ongoing practical experience and the requirements of the advancing EuDML project, the general public acceptance and attendance...
Recent results and open problems in analytic computational complexity
Recherche à voisinage variable de graphes extrémaux 13. A propos de la maille
Le système AutoGraphiX (AGX1 et AGX2) permet, parmi d’autres fonctions, la génération automatique de conjectures en théorie des graphes et, dans une version plus récente, la preuve automatique de conjectures simples. Afin d’illustrer ces fonctions et le type de résultats obtenus, nous étudions systématiquement ici des conjectures obtenues par ce système et de la forme où désigne la maille (ou longueur du plus petit cycle) du graphe , un autre invariant choisi parmi le nombre de stabilité,...
Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille*
Le système AutoGraphiX (AGX1 et AGX2) permet, parmi d'autres fonctions, la génération automatique de conjectures en théorie des graphes et, dans une version plus récente, la preuve automatique de conjectures simples. Afin d'illustrer ces fonctions et le type de résultats obtenus, nous étudions systématiquement ici des conjectures obtenues par ce système et de la forme où g désigne la maille (ou longueur du plus petit cycle) du graphe G=(V, E), i un autre invariant choisi parmi le nombre...
Recherche des graphes des matrices de Coxeter hyperboliques d’ordre