Results 81 to 90 of about 441 (192)
Hyperstructures associated with binary relations
Computers & Mathematics with Applications, 2006 Given a binary relation \(R\) on a non-empty set \(H\), a hyperoperation \(\odot_R\) is defined on \(H \times H\) by \(x \odot_R y = \{z \in H \mid xRz, zRy\}\). \((H,\odot_R) \) is a hypergroupoid \(\Leftrightarrow R \circ R = H \times H\) [\textit{P. Corsini}, ``Binary relations and hypergroupoids'', Ital. J. Pure Appl. Math.
Spartalis Spartalis, C. Mamaloukas
openaire +1 more source
L’hyperstructure : un mode privilégié de présentation des événements scientifiques ? [PDF]
, 2009 Le présent article s’attache à présenter une première définition de l’hyperstructure comme élément de structuration de l’information. L’exemple d’un dossier portant sur la thématique de la transgénie (pages 1 à 5 du quotidien France-Soir du 26 février ...
Lugrin, Gilles, Adam, Jean-Michel
core +1 more source
n–ary hyperstructures constructed from binary quasi–ordered semigroups
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Based on works by Davvaz, Vougiouklis and Leoreanu-Fotea in the field of n–ary hyperstructures and binary relations we present a construction of n–ary hyperstructures from binary quasi-ordered semigroups.
Novák Michal
doaj +1 more source
Algorithms for Finding Specific Elements in Algebraic Hyperstructures with One Hyperoperation [PDF]
Mathematics Interdisciplinary ResearchIn this paper, first, we show how to define an algebraic hyperstructure by using algorithms. Then, we present algorithms that calculate specific elements in algebraic hyperstructures. These specific elements are: scalars, scalar identities
Aboutorab Pourhaghani +2 more
doaj +1 more source
Personalized Information Structures II: Hyperstructure Hotlists
, 1995 This paper describes ongoing research into the use of a domain-retargetable reverse engineering environment to aid the structural understanding of large information spaces.
Scott R. Tilley, Walter M. Lamia
core
Advanced results in enumeration of hyperstructures
Journal of Algebra, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bayon, R., Lygeros, N.
openaire +3 more sources
Convexity Invariance of Fuzzy Sets under the Extension Principles
Journal of Function Spaces and Applications, 2012 We discuss the convexity invariance of fuzzy sets under the extension principles. Particularly, we give a necessary and sufficient condition for a mapping to be an inverse *-convex transformation, and also obtain some sufficient conditions for a mapping ...
Dong Qiu, Weiquan Zhang
doaj +1 more source
Applications and Variations of the Maximum Common Subgraph for the Determination of Chemical Similarity [PDF]
, 2015 The Maximum Common Substructure (MCS), along with numerous graph theory techniques, has been used widely in chemoinformatics. A topic which has been studied at Sheffield is the hyperstructure concept - a chemical definition of a superstructure, which ...
Duesbury, Edmund
core
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 In this paper we study the concept of sets of elements, related to results of an associative binary operation. We discuss this issue in the context of matrices and lattices.
Křehlík Štěpán, Novák Michal
doaj +1 more source
Multiple Ways of Processing in Questionnaires
Ratio Mathematica, 2017 In social sciences when questionnaires are used, there is a new tool, the bar instead of Likert scale. The bar has been suggested by Vougiouklis & Vougiouklis in 2008, who have proposed the replacement of Likert scales, usually used in questionnaires ...
Pipina Nikolaidou
doaj +1 more source