Results 51 to 60 of about 1,491 (176)

Does a decision support tool designed to depict West Nile virus risk explain variation in ruffed grouse Bonasa umbellus use of managed forests?

open access: yesWildlife Biology, EarlyView.
Infectious diseases are commonly cited as significant contributors to wildlife population declines. It is, therefore, important to investigate the extent to which tools designed to mitigate the effects of infectious diseases explain wildlife responses to habitat management.
Jacob Goldman   +8 more
wiley   +1 more source

Targeting the noncatalytic activity of GSK3β modulates neuronal excitability in medium spiny neurons via Nav1.6 interactions

open access: yesBritish Journal of Pharmacology, EarlyView.
Abstract Background and Purpose Kinases phosphorylate ion channels, but their noncatalytic roles via protein–protein interactions (PPI) are less understood. Here, we identified the peptidomimetic ZL141 to characterize the PPI between GSK3β and Nav1.6, revealing a noncatalytic role for GSK3β in regulating Nav1.6 currents and neuronal excitability ...
Aditya K. Singh   +19 more
wiley   +1 more source

A Heuristic for Distance Magic Labeling

open access: yes, 2015
A distance magic labeling of a graph G with magic constant k is a bijection λ from the V(G) into {1, 2,. . ., |V(G)|}, such that ∑u∈N(v) λ(u) = k for every vertex v.
Yasin, Fuad, Simanjuntak, Rinovia
core   +1 more source

Does Visual Working Memory Decline Explain Age Differences in Visualization Performance?

open access: yesComputer Graphics Forum, EarlyView.
Abstract Visualization studies that examine age effects on task performance often attribute the performance gap between young adults (YA) and people in late adulthood (PLA) to declines in cognitive abilities, especially reduced visual working memory (VWM) capacity.
Y. Li   +5 more
wiley   +1 more source

Tetravalent distance magic graphs of small order and an infinite family of examples

open access: yes, 2023
A graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors.
Šparl, Primož, Rozman, Ksenija
core  

Recent Trends in Metabolomics by NMR Spectroscopy

open access: yesAngewandte Chemie, Volume 138, Issue 24, 8 June 2026.
AI tools were applied to analyze more than 5 000 publications indexed in Scopus (2018–2025), identifying key trends and research directions in NMR‐based metabolomics. The artificial intelligence‐assisted workflow classified papers into six main fields of application, human health, food and nutrition, veterinary science, plants, environment, and ...
Giorgio Di Paco   +6 more
wiley   +2 more sources

A semantic feature for human motion retrieval [PDF]

open access: yes, 2013
With the explosive growth of motion capture data, it becomes very imperative in animation production to have an efficient search engine to retrieve motions from large motion repository.
Zhuang, Yueting   +11 more
core   +1 more source

Local inclusive distance antimagic coloring of graphs

open access: yesIndonesian Journal of Combinatorics
For a simple graph G, a bijection f : V(G) → [1,|V (G)|] is called as a local inclusive distance antimagic (LIDA) labeling of G if w(u) ≠ w(v) for every two adjacent vertices u,v ∈ V(G) with w(u) = ∑x∈N [u] f(x).
Fawwaz Fakhrurrozi Hadiputra   +4 more
doaj   +1 more source

Golden weapons and golden fetters: From the gold standard to the new geopolitics

open access: yesThe Economic History Review, EarlyView.
Abstract This paper explores the historical relationship between monetary regimes, security concerns, and geopolitical tensions, particularly focusing on the role of gold. Throughout history, monetary systems have been deeply intertwined with international state systems and security provisions.
Harold James
wiley   +1 more source

On local distance antimagic labeling of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
Let [Formula: see text] be a graph of order n and let [Formula: see text] be a bijection. For every vertex [Formula: see text], we define the weight of the vertex v as [Formula: see text] where N(v) is the open neighborhood of the vertex v. The bijection
Adarsh Kumar Handa   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy