Optimization based load forecasting and demand management in smart building microgrids with Greylag Goose and Bi level graph models. [PDF]
Ahamed BS +6 more
europepmc +1 more source
An in situ integrated TiO2/SiOx/Al2O3 synaptic phototransistor couples ultraviolet and electrical stimuli within a scalable, CMOS‐compatible oxide stack. Multimodal plasticity, spike‐timing‐dependent learning, and bee‐inspired associative conditioning are achieved through trap‐mediated temporal dynamics.
Youngbin Yoon +5 more
wiley +1 more source
Multi-dimensional EEG analysis reveals distinct neurophysiological patterns in Alzheimer's and frontotemporal dementia. [PDF]
Cai G, Shi Y, Ma J, Zhang X, Wu W.
europepmc +1 more source
HKD-CPI: high-order knowledge distillation enhanced inductive compound-protein interaction prediction. [PDF]
He Z +7 more
europepmc +1 more source
A multichannel MEG time-frequency analysis framework for detecting stage -specific effects of spatial distraction in visual-spatial working memory. [PDF]
Li Z +10 more
europepmc +1 more source
Prior-Knowledge-Guided Graph Attention Network for Fault Diagnosis of Engine Valve Clearance. [PDF]
Li M, Wen J, Yang X, Hu Y, Li X, Shi Z.
europepmc +1 more source
A versatile coherent Ising computing platform. [PDF]
Wei H +14 more
europepmc +1 more source
Enhancing CAP Education with a multi-guideline knowledge graph: a mixed-methods study. [PDF]
Liu F, Xiong Z, Gao P, Lu M, Li P.
europepmc +1 more source
Related searches:
On enhanced power graphs of certain groups
Discrete Mathematics, Algorithms and Applications, 2020The enhanced power graph [Formula: see text] of a group [Formula: see text] is a simple undirected graph with vertex set [Formula: see text] and two distinct vertices [Formula: see text] are adjacent if both [Formula: see text] and [Formula: see text] belongs to same cyclic subgroup of [Formula: see text].
Sandeep Dalal, Jitender Kumar
openaire +1 more source
Enhanced power graphs are weakly perfect [PDF]
Summary: A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group \(G\) is weakly perfect: its clique number and chromatic number are equal to the maximum order of an element of \(G\). The proof requires a combinatorial lemma. We give some remarks about related graphs.
Peter J. Cameron, Veronica Phan
openaire +1 more source

