Results 61 to 70 of about 5,610 (306)
Higher level extremal problems [PDF]
, 1996 Ahlswede R, Cai N, Zhang Z. Higher level extremal problems. Comb. Inf. & Syst. Sc.
Cai, Ning, Zhang, Zhen, Ahlswede, Rudolf
core
Digital Cognitive Phenotyping for Differential Diagnosis and Monitoring in Neurological Conditions
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To assess the utility, accessibility, and equivalence to supervised scales of online cognitive assessment in older individuals with cognitive impairment. Methods Patients with Alzheimer's disease (AD, n = 31), idiopathic normal pressure hydrocephalus (iNPH, n = 26), and traumatic brain injury (TBI, n = 23) completed online cognitive ...
Martina Del Giovane +10 more
wiley +1 more source
Various Problems in Extremal Combinatorics [PDF]
, 2012 Extremal combinatorics is a central theme of discrete mathematics. It deals with the problems of finding the maximum or minimum possible cardinality of a collection of finite objects satisfying certain restrictions.
Huang, Hao
core
Discrete Dynamics in Nature and Society, 2020 This paper is concerned with the existence of extremal solutions for periodic boundary value problems for conformable fractional differential equations with deviating arguments.
Huiling Chen, Shuman Meng, Yujun Cui
doaj +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
Several Problems in Extremal Combinatorics [PDF]
, 2014 Extremal combinatorics is one of the central branches of discrete mathematics. It focuses on determining or estimating the optimal possible size of a discrete structure(e.g. set systems, graphs) with certain properties.
Gan, Wenying
core
Tchebotaröv’s extremal problem
Open Mathematics, 2005 Abstract We give the complete solution of the extremal problem posed by N.G. Tchebotaröv in 20th of the last century, and we establish explicit parametric formulae for the extremals.
openaire +1 more source
Arthritis Care &Research, EarlyView.Objective The objective of this study was to estimate the minimal important change (MIC) and minimal clinically important difference (MCID) for pain and physical function in individuals with hip osteoarthritis (OA) following a physiotherapist‐guided exercise intervention.
Yareni Guerrero +8 more
wiley +1 more source
Graphs with coloring redundant edges
Electronic Journal of Graph Theory and Applications, 2016 A graph edge is $d$-coloring redundant if the removal of the edge doesnot change the set of $d$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges.
Bart Demoen, Phuong-Lan Nguyen
doaj +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source