Specialty
An arXiv preprint describes a real interference-alignment method for an active intelligent reflecting surface and reports a higher simulated sum rate with about a 260-fold speedup over WMMSE. The evidence is limited to a modeled system with synthetic channels and does not establish performance in real networks.
Scientific publication5 min read
An arXiv preprint reports lower task-weighted radio-model error and severe-load backlog with RMWorld in simulated tests. The advantage was not universal, came with higher computational cost, and has not been tested on measured channels.
Scientific publication4 min read
A theoretical preprint compares how several encoder geometries recover selected information under repeated random sampling. It reports different strongest performers for partial and full recovery in the displayed dimension-three examples.
Scientific publication5 min read
A simulation study reports that the proposed IZM-DSR routing and layered video scheme achieved the highest reported PSNR among the compared protocols, while key packet-delivery and delay values were missing from the text.
Scientific publication3 min read
Controlled benchmarks at the AIR Data Centre paired local storage tests with a remote replication campaign spanning 63 sites. The results show a high-capacity fabric, sharp throughput losses under throttling and measurable differences between endpoint hardware and network paths.
Scientific publication4 min read
A preprint reports benchmark-level gains for RFWM, a physics-guided model that predicts dynamic three-dimensional radio-frequency fields, including in scenes absent from training. The study used generated environments and RF fields rather than physical deployments.
Scientific publication3 min read
An arXiv preprint analyzes how Bernard–Letac sampling turns source draws into exact uniform outcomes, deriving prime-modulus cost results and a seven-state binary computation. Its composite-modulus benchmark favors the method on mean cost, but the comparison is empirical and limited to the configurations shown.
Scientific publication3 min read
A theoretical preprint introduces a two-row representation graph that yields a proven asymptotic upper bound for binary-code rates. It also presents finite and matrix hierarchies, while its multidimensional numerical gains remain uncertified.
Scientific publication4 min read