Results 51 to 60 of about 601,015 (329)

Feed-Forward Neural Networks Need Inductive Bias to Learn Equality Relations [PDF]

open access: yes, 2018
Basic binary relations such as equality and inequality are fundamental to relational data structures. Neural networks should learn such relations and generalise to new unseen data.
Kopparti, R. M., Weyde, T.
core   +1 more source

Universal Electronic‐Structure Relationship Governing Intrinsic Magnetic Properties in Permanent Magnets

open access: yesAdvanced Functional Materials, EarlyView.
Permanent magnets derive their extraordinary strength from deep, universal electronic‐structure principles that control magnetization, anisotropy, and intrinsic performance. This work uncovers those governing rules, examines modern modeling and AI‐driven discovery methods, identifies critical bottlenecks, and reveals electronic fingerprints shared ...
Prashant Singh
wiley   +1 more source

Boyd-Wong type functional contractions under locally transitive binary relation with applications to boundary value problems

open access: yesAIMS Mathematics
The area of metric fixed point theory applied to relational metric spaces has received significant attention since the appearance of the relation-theoretic contraction principle.
Ahmed Alamer , Faizan Ahmad Khan
doaj   +1 more source

A New Family of Ternary Intermetallic Compounds with Dualistic Atomic Ordering – The ZIP Phases

open access: yesAdvanced Materials, EarlyView.
The ZIP phases are ternary intermetallic compounds with dualistic atomic ordering, i.e., they exhibit one face‐centered cubic (fcc; space group Fd3¯$\bar 3$m) variant and one hexagonal (space group P63/mmc) variant. The ZIP phases in the Nb‐Si‐Ni system are the Nb3SiNi2 (fcc) and Ni3SiNb2 (hexagonal) ternary IMCs, crystal structure schematics of which ...
Matheus A. Tunes   +24 more
wiley   +1 more source

Matkowski-Type Functional Contractions under Locally Transitive Binary Relations and Applications to Singular Fractional Differential Equations

open access: yesFractal and Fractional
This article presents a few fixed-point results under Matkowski-type functional contractive mapping using locally J-transitive binary relations. Our results strengthen, enhance, and consolidate numerous existent fixed-point results.
Faizan Ahmad Khan   +5 more
doaj   +1 more source

Neutrosophic Hypercompositional Structures defined by Binary Relations [PDF]

open access: yesNeutrosophic Sets and Systems, 2014
The objective of this paper is to study neutrosophic hypercompositional structures arising from the hypercompositions derived from the binary relations on a neutrosophic set.
A.A.A. Agboola, S.A. Akinleye
doaj  

Groups and Algebras of Binary Relations

open access: yesThe Bulletin of Symbolic Logic, 2002
AbstractIn 1941, Tarski published an abstract, finitely axiomatized version of the theory of binary relations, called the theory of relation algebras. He asked whether every model of his abstract theory could be represented as a concrete algebra of binary relations.
Givant, Steven, Andreka, Hajnal
openaire   +2 more sources

Divisibility of binary relations [PDF]

open access: yesBulletin of the Australian Mathematical Society, 1971
In his paper in Mat. Sb. (N.S.) 61 (103) (1963), Zareckiĭ associated with any binary relation α an ordered pair, (Lα Mα), say, of lattices and showed that α is a left [right] divisor of β if and only if We provide an alternative proof of this result by embedding the category of relations in the category of sets.
Fitz-Gerald, D. G., Preston, G. B.
openaire   +1 more source

Computational Modeling of Reticular Materials: The Past, the Present, and the Future

open access: yesAdvanced Materials, EarlyView.
Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman   +3 more
wiley   +1 more source

A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata

open access: yesInformation, 2018
The binary discernibility matrix, originally introduced by Felix and Ushio, is a binary matrix representation for storing discernible attributes that can distinguish different objects in decision systems. It is an effective approach for feature selection,
Nan Zhang   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy