Results 241 to 250 of about 122,748 (264)
Shorter sleep duration predicts altered next-day physiologic, behavioral, and corticolimbic responses during fear extinction recall in youth. [PDF]
Carpenter C +11 more
europepmc +1 more source
Media Consumption and Mass Violence-Related Distress in Communities Affected by Mass Violence.
Morgan CH +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Pattern Avoidance and Overlap in Strings
Combinatorics, Probability and Computing, 2002Consider a finite alphabet Ω and patterns which consist of characters from Ω. For a given pattern w, let cor(w) denote its autocorrelation, which can be seen as a measure of the amount of overlap in w. Letting aw(n) denote the number of strings over Ω of length n which do not contain w as a substring, the main result of this paper is: If cor(w) >
openaire +1 more source
2019
So far this book has mostly focused on what we should do. It is also helpful to discuss the things we should not do. This chapter contains a list of anti-patterns – programming concepts and styles that we should avoid.
openaire +1 more source
So far this book has mostly focused on what we should do. It is also helpful to discuss the things we should not do. This chapter contains a list of anti-patterns – programming concepts and styles that we should avoid.
openaire +1 more source
On avoidance of V- and ^-patterns in permutations.
Ars Comb., 2010We study V- and ^-patterns which generalize valleys and peaks, as well as increasing and decreasing runs, in permutations. A complete classi¯cation of permutations (multi)-avoiding V- and ¤-patterns of length 4 is given. We also establish a connection between restricted permutations and matchings in the coronas of complete graphs.
Kitaev, Sergey, Pyatkin, Artem
openaire +1 more source
The undirected repetition threshold and undirected pattern avoidance
Theoretical Computer Science, 2021Lucas Mol
exaly
Edge colorings avoiding patterns
European Journal of CombinatoricsAssume a set \(V\subseteq \mathbb{R}^2\) of order \(n\), where no three points are collinear, is given. A visibility-blocking set is a set \(B\) disjoint from \(V\) such that every segment with endpoints in \(V\) contains a point from \(B\). Here, \(b(V)\) is the minimum cardinality of \(B\) for given \(V\), while \(b(n)\) is the minimum of \(b(V ...
openaire +3 more sources

