Results 31 to 40 of about 479 (179)

Computing Bonds Between Formal Contexts

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 11, Page 11661-11677, 30 July 2026.
ABSTRACT The notion of bond was introduced as a technique to aggregate information from multiple datasets without modifying the information already present in each of the datasets. This notion has been extended to several fuzzy frameworks, including the residuated lattice setting, which we also consider in this paper.
Roberto G. Aragón   +2 more
wiley   +1 more source

FuzzyMind: A Web Platform for End‐to‐End Fuzzy Cognitive Map Modeling

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 14, July 2026.
ABSTRACT Fuzzy cognitive maps (FCMs) are widely used for modeling complex causal systems under uncertainty. However, the FCM development lifecycle, encompassing data preprocessing, model construction, weight optimization, and scenario analysis, is typically fragmented across heterogeneous tools.
Theodoros Tziolas, Elpiniki Papageorgiou
wiley   +1 more source

Discrete Cartesian Coordinate Transformations: Using Algebraic Extension Methods

open access: yesApplied Sciences
It is shown that it is reasonable to use Galois fields, including those obtained by algebraic extensions, to describe the position of a point in a discrete Cartesian coordinate system in many cases. This approach is applicable to any problem in which the
Aruzhan Kadyrzhan   +3 more
doaj   +1 more source

A Method for Strict Remote User Identification Using non - Reversible Galois Field Transformations

open access: yesMATEC Web of Conferences, 2017
This article proposes an approach that accelerates the realization of strict remote user identification using non reversible Galois field transformation.
Bardis Nikolaos G.   +2 more
doaj   +1 more source

THE DEVELOPMENT OF ALGORITHMS FOR CALCULATING THEORETICAL- NUMERICAL SIGNAL TRANSFORMATIONS WITH THE LEAST NUMBER OF MULTIPLICATIONS

open access: yesСовременная наука и инновации, 2022
When using a discrete Fourier transform (DFT) to solve digital signal processing (DSP) problems, errors occur in rounding or truncating the results of operations to the word length used by specialized processors (SP).
M. I. Kalmykov   +3 more
doaj   +1 more source

Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T ( q 3 , q ) in PG ( 7 , q 3 )

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley   +1 more source

Quadratic subfields on quartic extensions of local fields

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1988
We show that any quartic extension of a local field of odd residue characteristic must contain an intermediate field. A consequence of this is that local fields of odd residue characteristic do not have extensions with Galois group A4 or S4 ...
Joe Repka
doaj   +1 more source

Design space exploration of high throughput finite field multipliers for channel coding on Xilinx FPGAs [PDF]

open access: yesAdvances in Radio Science, 2012
Channel coding is a standard technique in all wireless communication systems. In addition to the typically employed methods like convolutional coding, turbo coding or low density parity check (LDPC) coding, algebraic codes are used in many cases.
C. de Schryver   +3 more
doaj   +1 more source

On the fixed‐point proportion of self‐similar groups

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We prove that super strongly fractal groups acting on regular rooted trees have null fixed‐point proportion. In particular, we show that the fixed‐point proportion of an infinite family of iterated monodromy groups of exceptional complex polynomials has the same property.
Jorge Fariña‐Asategui, Santiago Radi
wiley   +1 more source

Computation of Hilbert sequence for composite quadratic extensions using different type of primes in Q

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1997
First, we will give all necessary definitions and theorems. Then the definition of a Hilbert sequence by using a Galois group is introduced. Then by using the Hilbert sequence, we will build tower fields for extension K/k, where K=k(d1,d2) and k=Q for ...
M. Haghighi, J. Miller
doaj   +1 more source

Home - About - Disclaimer - Privacy