Results 251 to 260 of about 1,424,485 (296)

The Relationship Between Physical Activity, Emotional Regulation, Psychological Stress, and Mood Among College Students: A Network Analysis Study. [PDF]

Behav Sci (Basel)
Tao B, Li Z, Han J, Lu T, Chen H, Yan J.
europepmc   +1 more source

Peierls Bounds from Toom Contours. [PDF]

J Theor Probab
Swart JM, Szabó R, Toninelli C.
europepmc   +1 more source

Evolving Comorbidity Burden and Clinical Characteristics in Peritoneal Dialysis: A 17-Year Nationwide Study. [PDF]

Kidney Med
Lavedrine AS, Boyer A, Lobbedez T, Béchade C, Lanot A.   +4 more
europepmc   +1 more source

Model-based estimates of sex differences in peak power and fatigue index in track cyclists using directed acyclic graphs, inverse probability of treatment weighting, and Bayesian modeling. [PDF]

Front Physiol
Gaviria Chavarro J, Gómez García MÁ, Zambrano Bermeo RN.   +2 more
europepmc   +1 more source

Decoding Causality in Periodontal Medicine: Background Factors and Other Sources of Uncertainty

Journal of Periodontal Research, EarlyView.
Philippe Bouchard
wiley   +1 more source

Periodontal Medicine and the Limitations of Linear Causality: Time for a Cybernetic Framework

Journal of Periodontal Research, EarlyView.
Tom Lonsdale
wiley   +1 more source

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs [PDF]

SIAM Journal of Scientific Computing, 2019
Summary: We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also known as the edge cut. The standard load balancing constraint of having an equitable partition of
Kamer Kaya, Bora Uçar, Umit V Catalyurek   +2 more
exaly   +4 more sources

Collapsibility for Directed Acyclic Graphs

Scandinavian Journal of Statistics, 2009
Abstract. Collapsibility means that the same statistical result of interest can be obtained before and after marginalization over some variables. In this paper, we discuss three kinds of collapsibility for directed acyclic graphs (DAGs): estimate collapsibility, conditional independence collapsibility and model collapsibility. Related to collapsibility,
Xie, Xianchao, Geng, Zhi
openaire   +2 more sources

On counting homomorphisms to directed acyclic graphs

Journal of the ACM, 2006
It is known that if P and NP are different then there is an infinite hierarchy of different complexity classes that lie strictly between them. Thus, if P ≠ NP, it is not possible to classify NP using any finite collection of complexity classes. This situation has led to attempts to identify smaller classes of problems within NP where
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson   +2 more
openaire   +3 more sources

On Mergings in Acyclic Directed Graphs

SIAM Journal on Discrete Mathematics, 2019
Summary: Consider an acyclic directed graph \(G\) with sources \(s_1, s_2, \ldots,s_n\) and sinks \(r_1, r_2, \ldots, r_n\). For \(i=1, 2, \ldots,n\), let \(c_i\) denote the size of the minimum edge cut between \(s_i\) and \(r_i\), which, by Menger's theorem, implies that there exists a group of \(c_i\) edge-disjoint paths from \(s_i\) to \(r_i ...
openaire   +1 more source