Results 211 to 220 of about 138,756 (354)

Maternal depression across childhood and offspring young adult depression and anxiety: Testing adolescent emotion dynamics as transdiagnostic mechanisms

JCPP Advances, EarlyView.
Abstract Background Early exposure to maternal depression can increase risk for offspring mental health problems across the lifespan. Less is known about the transdiagnostic pathways through which maternal depression influences offspring mental health risk in young adulthood.
Gabrielle R. Rinne, Blakely L. Berryhill, Caroline M. Chandler, Jennifer A. Somers   +3 more
wiley   +1 more source

ShadowVIMP: permutation-based multiple testing-controlled variable selection. [PDF]

BMC Bioinformatics
Müller T, Hornung R, Szymczak S, Buchner H.   +3 more
europepmc   +1 more source

Cardinality and Representation of Stone Relation Algebras

Previous work has axiomatised the cardinality operation in relation algebras, which counts the number of edges of an unweighted graph. We generalise the cardinality axioms to Stone relation algebras, which model weighted graphs, and study the ...
Furusawa, Hitoshi, Guttmann, Walter
core  

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

Visual Food Ingredient Prediction Using Deep Learning with Direct F-Score Optimization. [PDF]

Foods
Theera-Ampornpunt N, Treepong P.
europepmc   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

RCS-Doppler-Assisted MM-GM-PHD Filter for Passive Radar in Non-Uniform Clutter. [PDF]

Sensors (Basel)
Wang J, Xu B, Zhang Z, Jin B.
europepmc   +1 more source

Towards Robust CNF Encodings of Cardinality Constraints

, 2007
Marques-Silva, Joao, Lynce, Ines
core  

An End Degree for Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this paper we define a degree for ends of infinite digraphs. The well‐definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree.
Matthias Hamann, Karl Heuer
wiley   +1 more source

Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications. [PDF]

Sci Rep
Hayat S, Naeem R, Afzal Siddiqui HM, Riaz A, Imran M, Belay MB, Klai Z.   +6 more
europepmc   +1 more source