Results 251 to 260 of about 27,298 (312)

SGEDiff: a subgraph-enriched diffusion model for structure-based 3D molecular generation. [PDF]

J Cheminform
Gong C, Fang J, Tang Y, Liu G, Tang Y, Li W.   +5 more
europepmc   +1 more source

Structure‐Aware Machine Learning for Polymers: A Hierarchical Graph Network for Predicting Properties From Statistical Ensembles

Macromolecular Rapid Communications, Volume 47, Issue 12, 22 June 2026.
This work presents a structure‐aware graph convolutional network that models polymers as statistical ensembles to predict macroscopic properties. By combining topologically realistic graphs generated via kinetic Monte Carlo simulations with explicit molar mass distributions, the framework achieves high accuracy in classifying architectures and ...
Julian Kimmig, Yannik Köster, Timo Koswig, Punith Raviswamy, Subhash V. S. Ganti, Stefan Zechel, Christopher Kuenneth, Ulrich S. Schubert   +7 more
wiley   +1 more source

Towards a hierarchical approach and scalable semi-local centrality for key node identification in weighted complex networks. [PDF]

Sci Rep
Kong L, Xie W, Abshirini AA.
europepmc   +1 more source

Integrative Modular, Network‐Based, and Machine Learning Framework for Predicting Accessory Genome Functions and Virulence in Escherichia coli O157:H7

MicrobiologyOpen, Volume 15, Issue 3, June 2026.
An analysis of the accessory genomes from 77 Escherichia coli O157:H7 strains using network and machine learning techniques uncovers modular communities of plasmid‐related virulence associated with IncF replicons. Accessory markers that are not directly linked to toxin genes can effectively predict the virulence status with an AUC of 0.85, facilitating
Sydney Menzeko Gambushe, Oliver Tendayi Zishiri   +1 more
wiley   +1 more source

Adaptive graph contrastive learning with hard negative mining for multimodal hyperspectral and LiDAR classification. [PDF]

iScience
Wu L, Wang H.
europepmc   +1 more source

A Comprehensive Multistage Average Controller for Trajectory Tracking in Solar‐Powered Mobile Robots: Analysis of Actuator‐Driver and Power Stage Integration

International Journal of Mechanical System Dynamics, Volume 6, Issue 2, Page 224-246, June 2026.
ABSTRACT This work addresses the challenge of bidirectional trajectory tracking in solar‐powered wheeled mobile robots (WMRs), considering the mechanical structure, actuator‐driver, and power stage subsystems. Notably, this is the first study to explicitly model and control the actuator‐driver subsystem within this context. The proposed solution relies
Benjamin Natanael Santiago‐Nogales, Julio Cesar Ordaz‐Dehesa, Ramón Silva‐Ortigoza, Erik Reyes‐Reyes, J. Martín Alba‐Martínez, Juan Eduardo Velázquez‐Velázquez, José Rafael García‐Sánchez, Magdalena Marciano‐Melchor, Hind Taud   +8 more
wiley   +1 more source

Design and Analysis of Minimum-Weighted Connected Capacitated Vertex Cover Algorithms for Link Monitoring in IoT-Enabled WSNs. [PDF]

Sensors (Basel)
Kol M, Uslu EE, Dagdeviren ZA, Dagdeviren O.   +3 more
europepmc   +1 more source

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study

Networks, Volume 87, Issue 4, Page 343-371, June 2026.
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk, Stefan Voß, Raka Jovanovic   +2 more
wiley   +1 more source

Joint mixed-effects models for causal inference in clustered network-based observational studies. [PDF]

Stat Methods Med Res
McNealis V, Moodie EE, Dean N.
europepmc   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

Networks, Volume 87, Issue 4, Page 404-427, June 2026.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz, Ernestine Großmann, Christian Schulz   +2 more
wiley   +1 more source