Results 251 to 260 of about 42,222 (303)
Congruency, Homomorphism  and Isomorphism on Autometrized Algebras. [PDF]
F1000ResTilahun GY.
europepmc +1 more source
KAN-GIN: Adaptive Nonlinear Molecular Representation Learning for Drug-Target Affinity Prediction. [PDF]
Pharmaceuticals (Basel)Bedoui A, Duraisamy N, Cherkaoui M.
europepmc +1 more source
From SMILES Codes for Reactants and Products to Transition States With VeloxChem. [PDF]
J Comput Chemvan Hoorn B, Norman P, Ahlquist MSG.
europepmc +1 more source
Joyce Structures from Quadratic Differentials on the Sphere. [PDF]
Commun Math PhysMoy T.
europepmc +1 more source
Fault Diagnosis Method for Reciprocating Compressors Based on Spatio-Temporal Feature Fusion. [PDF]
Sensors (Basel)Xu H +6 more
europepmc +1 more source
Getting to the root of the problem: sums of squares for limits of trees. [PDF]
Math ProgramBrosch D, Puges D.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 12th International Conference on Artificial Intelligence and Law, 2009
As knowledge representation tools become more sophisticated, and computer systems increase in power and ubiquity, the prospects of building practical applications based on the representation of large amounts of legislation draw closer. In this paper we reflect on our experience with developing a knowledge representation language for legal rules and an ...
Trevor J. M. Bench-Capon +1 more
openaire +1 more source
As knowledge representation tools become more sophisticated, and computer systems increase in power and ubiquity, the prospects of building practical applications based on the representation of large amounts of legislation draw closer. In this paper we reflect on our experience with developing a knowledge representation language for legal rules and an ...
Trevor J. M. Bench-Capon +1 more
openaire +1 more source
Fractional isomorphism of graphs [PDF]
Discrete Mathematics, 1994 Let the adjacency matrices of graphs G and H be A and B. These graphs are isomorphic provided there is a permutation matrix P with AP=PB, or equivalently, A=PBPT. If we relax the requirement that P be a permutation matrix, and, instead, require P only to
Ed Scheinerman
exaly +2 more sources
The Journal of Symbolic Logic, 2016
AbstractWe show that isomorphism is not a complete ${\rm{\Sigma }}_1^1$ equivalence relation even when restricted to the hyperarithmetic reals: If E1 denotes the ${\rm{\Sigma }}_1^1$ (even ${\rm{\Delta }}_1^1$) equivalence relation of [4] then for no Hyp function f do we have xEy iff f(x) is isomorphic to f(y) for all Hyp reals x,y.
openaire +4 more sources
AbstractWe show that isomorphism is not a complete ${\rm{\Sigma }}_1^1$ equivalence relation even when restricted to the hyperarithmetic reals: If E1 denotes the ${\rm{\Sigma }}_1^1$ (even ${\rm{\Delta }}_1^1$) equivalence relation of [4] then for no Hyp function f do we have xEy iff f(x) is isomorphic to f(y) for all Hyp reals x,y.
openaire +4 more sources
Isomorphisms and non-isomorphisms of at actions
Journal d'Analyse Mathématique, 2009Measure-theoretic classification of ergodic actions of the integers and reals was developed through the use of von Neumann algebras by Krieger and later by Connes and Woods. In particular, the latter showed that AT (approximatively transitive) actions are classified by their Poisson boundary obtained from an inverse limit of (binomial) polynomials ...
openaire +1 more source