Results 121 to 130 of about 92,446 (202)

SAGE: Spatially Aware Gene Selection and Dual‐View Embedding Fusion for Domain Identification in Spatial Transcriptomics

open access: yesAdvanced Science, Volume 13, Issue 16, 18 March 2026.
SAGE is a unified framework for spatial domain identification in spatial transcriptomics that jointly models tissue architecture and gene programs. Topic‐driven gene selection (NMF plus classifier‐based scoring) highlights spatially informative genes, while dual‐view graph embedding fuses local expression and non‐local functional relations.
Yi He   +5 more
wiley   +1 more source

Perceived Saturation in Normal and Red–Green Color‐Deficient Observers

open access: yesColor Research &Application, Volume 51, Issue 2, March/April 2026.
Results in this study indicate that perceived saturation of protan (P) and deutan (D) observers is lower than that of color normal (N) observers as shown in the figures. Horizontal axis denotes the stimulus pair with the same hue but different chroma.
Miyoshi Ayama   +2 more
wiley   +1 more source

Efficient Scheduling Algorithms for Multicore Cyclic Executives With Precedence and Exclusion Relations

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.
ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira   +4 more
wiley   +1 more source

Quasi-Irreducibility of Nonnegative Biquadratic Tensors

open access: yesMathematics
While the adjacency tensor of a bipartite 2-graph is a nonnegative biquadratic tensor, it is inherently reducible. To address this limitation, we introduce the concept of quasi-irreducibility in this paper.
Liqun Qi, Chunfeng Cui, Yi Xu
doaj   +1 more source

Perfect Matching Under Precedence Constraints

open access: yesNetworks, Volume 87, Issue 2, Page 175-190, March 2026.
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley   +1 more source

哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2009
Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj   +1 more source

GAGrank: Software for Glycosaminoglycan Sequence Ranking Using a Bipartite Graph Model. [PDF]

open access: yesMol Cell Proteomics, 2021
Hogan JD   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy