Results 21 to 30 of about 364 (127)

Modeling basal body temperature data using horseshoe process regression. [PDF]

Stat Med
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]

Ecol Appl
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, Ewald J, Hofmann M, Trivellone V, Styrnik V, Nickel H, Neumayer J, Pospisil K, Klein D, Tobisch C, König S, Richter T, Geres L, Baier R, Seibold S.   +14 more
europepmc   +2 more sources

Modulating verbal working memory with fronto‐parietal transcranial electric stimulation at theta frequency: Does it work?

European Journal of Neuroscience, Volume 55, Issue 2, Page 405-425, January 2022., 2022
We used multi‐site transcranial alternating stimulation at theta frequency to either synchronize or desynchronize a fronto‐parietal working memory network in order to modulate verbal working memory performance. Results indicate that a behavioural modulatory effect of synchronizing fronto‐parietal tACS can only be observed in a working memory task of ...
Anna Lena Biel, Elisabeth Sterner, Lukas Röll, Paul Sauseng   +3 more
wiley   +1 more source

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming

Algorithms, 2018
Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this ...
Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil   +3 more
doaj   +1 more source

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

Algorithms, 2019
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj   +1 more source

Game Comonads & Generalised Quantifiers [PDF]

Logical Methods in Computer Science
Game comonads, introduced by Abramsky, Dawar and Wang and developed by Abramsky and Shah, give an interesting categorical semantics to some Spoiler-Duplicator games that are common in finite model theory. In particular they expose connections between one-
Adam Ó Conghaile, Anuj Dawar
doaj   +1 more source

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]

Discrete Mathematics & Theoretical Computer Science
In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann, Leon Kellerhals, Tomohiro Koana   +2 more
doaj   +1 more source

The significance of structural rich club hubs for the processing of hierarchical stimuli. [PDF]

Hum Brain Mapp
We collected functional magnetic resonance imaging data during presentation of hierarchically structured stimuli, and diffusion weighted imaging data to identify the hierarchical rich club architecture in the same subjects. Integrating functional and structural data revealed an anterior‐medial frontal shift and engagement of rich club hubs for ...
Mecklenbrauck F, Gruber M, Siestrup S, Zahedi A, Grotegerd D, Mauritz M, Trempler I, Dannlowski U, Schubotz RI.   +8 more
europepmc   +2 more sources

Local certification of MSO properties for bounded treedepth graphs

CoRR, 2021
The graph model checking problem consists in testing whether an input graph satisfies a given logical formula. In this paper, we study this problem in a distributed setting, namely local certification. The goal is to assign labels to the nodes of a network to certify that some given property is satisfied, in such a way that the labels can be checked ...
Nicolas Bousquet 0001, Laurent Feuilloley, Théo Pierron   +2 more
openaire   +2 more sources

On the Complexity of Embedding in Graph Products

Computing in Geometry and Topology
Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph G in a host graph that is the strong product of a path ...
Therese Biedl, David Eppstein, Torsten Ueckerdt   +2 more
doaj   +1 more source