Galois connections are a particular kind of correspondence between ordered sets that preserve some but not all structure. In this thesis we explore examples and properties of Galois connections on preordered sets, and results such as the adjoint functor theorem.
openaire +1 more source
Vehicle-to-Vehicle Secure Communication Protocol Based on Digital Vehicle Identification Number. [PDF]
Escapa Gordón P +2 more
europepmc +1 more source
From Schreier graphs to secure s-boxes using a group-theoretic design framework. [PDF]
Razaq A +4 more
europepmc +1 more source
Correlation-controlled stochastic computing for low-power FIR and IIR filters in edge DSP. [PDF]
Krishna R +4 more
europepmc +1 more source
Extracting automata from neural networks using active learning. [PDF]
Xu Z, Wen C, Qin S, He M.
europepmc +1 more source
"In Mathematical Language": On Mathematical Foundations of Quantum Foundations. [PDF]
Plotnitsky A.
europepmc +1 more source
A combinatory approach of non-chain ring and henon map for image encryption application. [PDF]
Mohi Ud Din S +4 more
europepmc +1 more source
Generalized triangle group based S-box construction for secure image encryption. [PDF]
Abbasi AZ +5 more
europepmc +1 more source
Applying the defense model to strengthen information security with artificial intelligence in computer networks of the financial services sector. [PDF]
Karn AL +7 more
europepmc +1 more source
Canonicalizing Zeta Generators: Genus Zero and Genus One. [PDF]
Dorigoni D +7 more
europepmc +1 more source

