Results 11 to 20 of about 3,618,002 (268)
Degrees That Are Not Degrees of Categoricity [PDF]
10 pages.
Anderson, Bernard, Csima, Barbara
openaire +3 more sources
Degrees of categoricity and treeable degrees
In this paper, we give a characterization of the strong degrees of categoricity of computable structures greater or equal to [Formula: see text]. They are precisely the treeable degrees — the least degrees of paths through computable trees — that compute [Formula: see text].
Barbara F. Csima, Dino Rossegger
openaire +2 more sources
Venous thromboembolism is a common complication following trauma. We investigated the dynamics of plasma microparticles (MPs) levels and explored their potential as biomarkers of deep vein thromboembolism (DVT) after trauma.
Xinwei Zang Master Degree +9 more
doaj +1 more source
AbstractHuman freedom is in tension with nomological determinism and with statistical determinism. The goal of this paper is to answer both challenges. Four contributions are made to the free-will debate. First, we propose a classification of scientific theories based on how much freedom they allow.
Thyssen, Pieter, Wenmackers, Sylvia
openaire +3 more sources
An Appraisal of the Degree of School Effectiveness among Secondary Schools of Zamfara State, Nigeria
This study was conducted purposely to assess the degree of school effectiveness among public secondary schools of Zamfara State, Nigeria. In order to achieve this fundamental objective, one research question was formulated.
Abbas Sani Dahiru, Jibril Almustapha
doaj +1 more source
DEGREE DISTANCE AND MINIMUM DEGREE [PDF]
AbstractLet G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u+deg v) d(u,v), where deg w is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order,
Mukwembi, S., Munyira, S.
openaire +2 more sources
Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees [PDF]
In network theory, Pearson's correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences.
Pim van der Hoorn, Nelly Litvak
openaire +3 more sources
Thermography is a non-invasive method for measuring surface temperatures and may be a convenient way of identifying hypo/hyperthermic areas under a saddle that may be related to saddle pressures.
Russell MacKechnie-Guire +6 more
doaj +1 more source
Random degree–degree correlated networks [PDF]
8 pages, 9 ...
Marlon Ramos, Celia Anteneodo
openaire +2 more sources
On degree–degree correlations in multilayer networks [PDF]
8 pages, 3 ...
Ferraz de Arruda, G. +3 more
openaire +5 more sources

