Results 271 to 280 of about 72,703 (318)
Efficacy of Optically Pumped Magnetometers in Detecting Activity From the Cerebellar Cortex. [PDF]
Hum Brain MappRoos S, Hämäläinen M, Iivanainen J.
europepmc +1 more source
Research on AUV Underwater Localization Method Based on an n-Shaped Array. [PDF]
Sensors (Basel)Han C, Gao M, Shen T, Guo C.
europepmc +1 more source
Spatial-spectral resolution analysis using drone hyperspectral and satellite multispectral imagery for shallow coastal water monitoring. [PDF]
Sci RepMederos-Barrera A +2 more
europepmc +1 more source
Clustering single-cell multi-omics data via multi-subspace contrastive learning with structural smoothness. [PDF]
Brief BioinformDing Y +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Decidable subspaces and recursively enumerable subspaces
Journal of Symbolic Logic, 1984AbstractA subspace V of an infinite dimensional fully effective vector space V∞ is called decidable if V is r.e. and there exists an r.e. W such that V ⊕ W = V∞. These subspaces of V∞ are natural analogues of recursive subsets of ω. The set of r.e. subspaces forms a lattice L(V∞) and the set of decidable subspaces forms a lower semilattice S(V∞).
Christopher J. Ash, Rodney G. Downey
openaire +1 more source
Applied Mathematics and Computation, 2010
The literature devoted to set theory provides a rich collection of rules concerning a pair of sets. These relationships involve such notions and operations as subsets, unions, intersections, set difference and complement. In this paper, these relationships are revisited and considered from the point of view of the question whether they remain valid ...
Oskar Maria Baksalary, Götz Trenkler
openaire +2 more sources
The literature devoted to set theory provides a rich collection of rules concerning a pair of sets. These relationships involve such notions and operations as subsets, unions, intersections, set difference and complement. In this paper, these relationships are revisited and considered from the point of view of the question whether they remain valid ...
Oskar Maria Baksalary, Götz Trenkler
openaire +2 more sources
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, 2007
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restricts the validity of the argument of getAllValues. This restriction ensures that essential language features like the call-time choice semantics, the independence of the order ...
Sergio Antoy, Bernd Braßel
openaire +1 more source
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restricts the validity of the argument of getAllValues. This restriction ensures that essential language features like the call-time choice semantics, the independence of the order ...
Sergio Antoy, Bernd Braßel
openaire +1 more source