Hierarchical Federated Learning (HFL) has emerged as a promising evolution of Federated Learning (FL) where a shared model is learned collaboratively via hierarchical aggregation, and it requires federated unlearning to protect users’ right to be forgotten in the training process. However, most existing designs neglect...
Ying Qian, Lian-Bo Ma, Guo Yu et al.· IEEE Transactions on Mobile...· 0 citations
Vehicular edge computing (VEC) plays a pivotal role in enabling cooperative perception for connected autonomous vehicles (CAVs), providing comprehensive environmental awareness for safe vehicle control and road safety. However, collaborative perception in VEC faces significant challenges arising from stringent bandwidt...
Wen-Qiang Ma, Wen Sun, Jian-Hua He et al.· IEEE Transactions on Mobile...· 0 citations
We present a scalable method for computing persistence pairing graphs from large cubical filtrations and use it to test whether graph organization among persistent classes contains information beyond persistence intervals alone. The method cancels equal-value pairs before global reduction, constructs the compressed com...
We study proportional fairness in graphical resource allocation, where agents are vertices, indivisible items are edges, and each item must be allocated to one of its two endpoints. It has been proved that PROP1 orientations always exist and PROPx orientations may not, but it has remained open whether the intermediate...
Bo Li, An-Kang Sun, Rui-Jie Wang· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
A deterministic polynomial-time approximation for Maximum Weighted $3-Set Packing, breaking the $\sqrt3$ locality-gap barrier of squared-weight local search and proving that $\sqrt3$ is a locality-gap lower bound for the squared-weight objective even with exchanges of arbitrary size.
This work proposes a multi-agent reinforcement learning (MARL) approach for queue-level scheduling in TSN-enabled VEC and employs multi-agent proximal policy optimization (MAPPO) to enable coordinated yet autonomous scheduling decisions.
Bernardo A. C. Pereira, Marcos Carvalho, Fatih Temiz et al.· 0 citations
Two-dimensional (2D) non-layered oxides, such as MoO2, are emerging candidates for next-generation electronics, optoelectronics and sensors, especially novel in-sensor computing. However, there is a lack of effective method to grow large-area 2D MoO2 single crystals due to multiple preferred orientations induced by unc...
DECISION: REJECT ELEMENT: No element survives — the pool-density ≥90 filter is a statistical artifact, not an E8-geometry-compatible edge. EXPECTED IMPACT: The +1.5pp backtest gain (n=1800) is within noise for a 32.5%→34.0% shift (σ≈1.1pp). Merlin's own live-window projection shows only +8.6pp on 7 trades (n=7, meaning...
Andrew Stewart Caldin· Zenodo (CERN European Organi...· 0 citations
This study designed an edge computing detection system for maize pests and diseases based on an improved YOLOv11 model and designed a C2PSLCA module based on linear self-attention to replace the C2PSA module in YOLOv11, enhancing the model’s ability to extract features of maize pests and diseases in complex environment...
Decision Support Systems (DSS) in precision agriculture have evolved from static rule-based engines into data-driven frameworks powered by Internet of Things (IoT) telemetry and supervised machine learning. While recent literature increasingly focuses on deep learning and volatile commodity forecasting, empirical farm-...
Sumit Gaikwad, Omsingh Gour, Vishakha Gaikwad et al.· International Journal of Cre...· 0 citations
Deliverable D3.5 Production Planning & Reconfiguration v1 provides an overall status update of two core components developed within the CIRCMAN5.0 project’s Work Package 3 (WP3). They are aligned with WP3’s purpose that is to deliver novel simulation and modelling software to improve process and product manufacturing....
Centre for Research and Technology Hellas, Institute of Communication and Computer Systems· Zenodo (CERN European Organi...· 0 citations
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026