Results 211 to 220 of about 10,888 (264)
Ground State Energy Fluctuations of Pinned Elastic Manifolds. [PDF]
Fyodorov YV +2 more
europepmc +1 more source
Villain Action in Lattice Gauge Theory. [PDF]
Chevyrev I, Garban C.
europepmc +1 more source
Computational exploration of hydrogen storage potential in Mg<sub>2</sub>LiXH<sub>6</sub> (X = Ti, V) hydrides <i>via</i> DFT and AIMD simulations. [PDF]
Iqbal MMA +4 more
europepmc +1 more source
Enhanced EAADE: a quantum-resilient and privacy-preserving authentication protocol for secure data exchange in vehicular social networks. [PDF]
Alrashdi R +7 more
europepmc +1 more source
Fusion-based implementation of qLDPC codes with quantum emitters. [PDF]
Chen SX +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Idempotent nullnorms on bounded lattices
Information Sciences, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Funda Karaçal, Gul Deniz Cayli
exaly +3 more sources
Aggregation functions on bounded lattices
International Journal of General Systems, 2017In this paper, we show that the set An(L) of all n-ary aggregation functions on a complete lattice L is a complete lattice and we study some properties of this lattice. If L is a bounded lattice and n is a natural number such that n≠0, we obtain that Lm for m∈[n] can be embedded into the lattice An(L).
Radko Mesiar, Funda Karaçal
exaly +2 more sources
Lattice-based sum of t-norms on bounded lattices
Fuzzy Sets and Systems, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moataz El-Zekey
exaly +2 more sources
On the construction of uninorms on bounded lattices
Fuzzy Sets and Systems, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emel Asici, Radko Mesiar
openaire +1 more source
2013 IEEE International Symposium on Information Theory, 2013
The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities.
Srikanth Pai Bantwal, B. Sundar Rajan
openaire +2 more sources
The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities.
Srikanth Pai Bantwal, B. Sundar Rajan
openaire +2 more sources

