A Faster Parameterized Algorithm for Treedepth [PDF]
The width measure \emph{treedepth}, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest.
Reidl, Felix +3 more
core +2 more sources
Treedepth Parameterized by Vertex Cover Number [PDF]
To solve hard graph problems from the parameterized perspective, structural parameters have commonly been used. In particular, vertex cover number is frequently used in this context.
Kobayashi, Yasuaki, Tamaki, Hisao
core +4 more sources
Memory Versus Expectation: Processing Relative Clauses in a Flexible Word Order Language. [PDF]
Abstract Memory limitations and probabilistic expectations are two key factors that have been posited to play a role in the incremental processing of natural language. Relative clauses (RCs) have long served as a key proving ground for such theories of language processing. Across three self‐paced reading experiments, we test the online comprehension of
Ronai E, Xiang M.
europepmc +2 more sources
Reconfiguration in bounded bandwidth and treedepth [PDF]
We show that several reconfiguration problems known to be PSPACE-complete remain so even when limited to graphs of bounded bandwidth. The essential step is noticing the similarity to very limited string rewriting systems, whose ability to directly ...
Wrochna, Marcin
core +4 more sources
Brain dopamine receptor system is not altered in obesity: Bayesian and frequentist meta-analyses. [PDF]
Brain dopamine receptor availability is not different between lean and overweight/obese subjects according to both Bayesian and frequentist meta‐analyses. However, the effect is dependent on the radiopharmaceutical and the degree of obesity. Abstract Feeding induces dopamine release in the striatum, and a dysfunction of the dopaminergic reward system ...
Pak K, Nummenmaa L.
europepmc +2 more sources
Family Income Is Associated With Regional Brain Glucose Metabolism in Middle-Aged Males. [PDF]
ABSTRACT Socioeconomic status is a multifaceted construct that plays a prominent role in shaping our environment. This study investigated the associations between family income, education level, and brain glucose metabolism in middle‐aged males. We retrospectively analysed data of healthy males who underwent a health check‐up programme including (1 ...
Pak K +6 more
europepmc +2 more sources
Personalized Nutrition Recommendations Using a Bayesian Mixture Model of Concentration Constraints and Intake Preferences. [PDF]
ABSTRACT Maintaining proper nutrition is crucial for preserving health and preventing disease. However, what constitutes proper nutrition may vary among individuals; evidence indicates that the effects of diet and even single nutrients can differ considerably because of personal characteristics.
Turkia J, Schwab U, Hautamäki V.
europepmc +2 more sources
Modeling basal body temperature data using horseshoe process regression. [PDF]
Biomedical data often exhibit jumps or abrupt changes. For example, women's basal body temperature may jump at ovulation, menstruation, implantation, and miscarriage. These sudden changes make these data challenging to model: many methods will oversmooth the sharp changes or overfit in response to measurement error.
Chase EC, Taylor JMG, Boonstra PS.
europepmc +2 more sources
Effects of the timing of grazing on insect diversity and insect-plant interactions in mountain grasslands. [PDF]
Abstract Grazing is the common agricultural land‐use in mountain regions. It is of high socioeconomic importance but also essential for conservation as extensive mountain pastures are hotspots of biodiversity. Climate change is causing earlier growing seasons, prompting earlier livestock turnout.
Panassiti B +14 more
europepmc +2 more sources
Computing treedepth in polynomial space and linear fpt time
The treedepth of a graph $G$ is the least possible depth of an elimination forest of $G$: a rooted forest on the same vertex set where every pair of vertices adjacent in $G$ is bound by the ancestor/descendant relation. We propose an algorithm that given a graph $G$ and an integer $d$, either finds an elimination forest of $G$ of depth at most $d$ or ...
Nadara, Wojciech +2 more
openaire +5 more sources

