Results 211 to 220 of about 408 (250)

Intelligent monitoring and anomaly detection for power service processes based on spatiotemporal attention mechanism. [PDF]

Sci Rep
Lin N, Wen X, Wu J, Huang X, Wen H.
europepmc   +1 more source

Traffic Forecasting for Industrial Internet Gateway Based on Multi-Scale Dependency Integration. [PDF]

Sensors (Basel)
Ma T, Liu J, Xu P, Song Y.
europepmc   +1 more source

Sensor-integrated hip and knee prostheses: advances, challenges, and future perspectives. [PDF]

Front Bioeng Biotechnol
Wu XD, Zhao Z, Lu D, Shao H, Yang D, Zhou Y.   +5 more
europepmc   +1 more source

Random features meet MIL: a deep GP approach to colorectal MSI prediction. [PDF]

NPJ Digit Med
Shen S, Wang Z, Liu T, Ma K, Tian Z, Zhang F, Zhang Q.   +6 more
europepmc   +1 more source

Evolution of chromosomes and nuclear architectures of amniotes. [PDF]

Nat Commun
Liu J, Zhou Q.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Farey Graceful Labeling

The National Academy of Sciences, India, 2023
Ajay Kumar, Debdas Mishra, V. K. Srivastava   +2 more
exaly   +2 more sources

Graceful Cascading Labelling Algorithm: Construction of Graceful Labelling of Trees

2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST), 2021
The Graceful Labelling of trees is one of the most challenging conjectures in Graph Theory, proudly known as the 'Disease' of Graph Theory which remains a challenge as it remains unsolved. To counter the conjecture, an algorithm is proposed to construct a Graceful Binary Tree and a Graceful Caterpillar Tree.
Dipta Gomes, Md. Manzurul Hasan
openaire   +1 more source

ODD GRACEFUL LABELINGS OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2009
A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Zhen-Bin Gao, Xiao-Dong Zhang 0001, Lijuan Xu   +2 more
openaire   +1 more source

The Generation of k-Graceful Figure and Graceful Label

2014 Fourth International Conference on Instrumentation and Measurement, Computer, Communication and Control, 2014
This paper introduces the concept of graceful figure, discusses a special kind of graceful figure: K-graceful figure, draw all the graceful figure of the generated by the n side of all the beautiful label generation algorithm. The algebraic theory and computer tools introduced a graceful figure.
Jia Peipei, Zhang Tai, Zhang Yuanyuan
openaire   +1 more source