Results 171 to 180 of about 70,260 (212)

Gradient Descent Provably Escapes Saddle Points in the Training of Shallow ReLU Networks. [PDF]

J Optim Theory Appl
Cheridito P, Jentzen A, Rossmannek F.
europepmc   +1 more source

The Role of Self‐Compassion and Experience in Psychologists' Latent Emotional Labour Strategy Profiles

Journal of Clinical Psychology, EarlyView.
ABSTRACT Objective Emotional labour has long been associated with personal and organizational outcomes such as burnout. However, theoretically dichotomising regulation into surface and deep acting may constrain the ecological validity of research as iterative and person‐centered approaches to emotion regulation are not considered.
James J. Clarke, Vincent O. Mancini, Clare S. Rees, Lauren J. Breen   +3 more
wiley   +1 more source

Runtime Monitoring of Static Fairness Properties

Henzinger TA, Karimi M, Kueffner K, Mallik K.   +3 more
europepmc   +1 more source

Distinguishing a Drone from Birds Based on Trajectory Movement and Deep Learning. [PDF]

Sensors (Basel)
Nesteruk A, Nikitin V, Albrekht Y, Ścisło Ł, Grela D, Król P.   +5 more
europepmc   +1 more source

The prevalence of food insecurity and its relationship with wellbeing in a large, cross‐sectional study of children and young people in England

JCPP Advances, EarlyView.
AbstractBackgroundWe aimed to assess the prevalence of food insecurity reported by children and young people in four areas of England in 2023 and examine its association with mental health and wellbeing.MethodsWe used data from the OxWell student survey, a large, diverse, cross‐sectional study of 38,430 students aged 8–19 years, conducted primarily in ...
Giacomo Bignardi, Mina Fazel, OxWell Study Team, Sarah‐Jayne Blakemore   +3 more
wiley   +1 more source

Pipelined and conflict-free number theoretic transform accelerator for CRYSTALS-Kyber on FPGA. [PDF]

PLoS One
Waris A, Aziz A, Khan BM.
europepmc   +1 more source

On Strongly and Robustly Critical Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn, Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma   +3 more
wiley   +1 more source

Gauge fixing for sequence-function relationships. [PDF]

PLoS Comput Biol
Posfai A, Zhou J, McCandlish DM, Kinney JB.   +3 more
europepmc   +1 more source

Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number

Journal of Graph Theory, EarlyView.
ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire, Martin Milanič, Ðorđe Vasić   +2 more
wiley   +1 more source

Spectral quantum algorithm for passive scalar transport in shear flows. [PDF]

Sci Rep
Pfeffer P, Brearley P, Laizet S, Schumacher J.   +3 more
europepmc   +1 more source