In briefA continuous projection converse and weighted construction for uniquely decodable code pairs
SummaryThis paper studies the maximum sum rate of uniquely decodable code pairs. A weighted refinement of a complement-gluing construction gives an explicit code of length 672 with sum rate above 1.318639029203. An iterated projection argument, combined with a conditional entropy estimate and a justified continuous limit, yields an upper bound of 1.480063425539.
In briefRandomized allocations balancing ex-ante and ex-post fairness under subadditive valuations
SummaryThis paper studies allocating indivisible goods to agents with equal entitlements and subadditive valuations. The authors give a transformation that turns any algorithm producing ρ-MMS allocations into a randomized algorithm that is ρ-MMS ex-post and η-MES ex-ante. They prove η is at least min[ρ/(2+ρ), 1/4] and apply the transformation to existing algorithms for subadditive and XOS valuations.
In briefAdaptive client clustering and coordination for managing federated learning workflows at the edge
SummaryThis paper proposes A-CoDa, a framework for managing dependent federated learning workflows in edge networks. It groups clients by label-distribution divergence and selects participants using FedMIX, which ranks clients by loss, latency, and uncertainty. A dependency-aware DAG scheduler orchestrates layer-wise task execution. Experiments on handwriting, wearable-sensing, product-image, and medical-imaging tasks show reduced end-to-end completion time while maintaining competitive accuracy.
In briefSunflowers of Reed–Solomon Codes: Families of Codes Sharing a Common Intersection
SummaryThe paper introduces Reed–Solomon sunflowers, families of Reed–Solomon codes whose pairwise intersections all equal the same fixed subspace. It gives an algebraic criterion using generalized V-matrices to identify such families. The authors study their sizes through counting and constructions, fully resolving the dimension-two case. For higher dimensions they give recursive and greedy constructions with many petals.
In briefSharing downstream profits with data sellers in tree-shaped data markets
SummaryData can be copied and resold repeatedly, forming tree-shaped chains of resale, while upstream sellers capture none of the downstream value, which weakens their incentive to trade. The paper develops a framework for profit reallocation on such tree-structured markets, introducing a sequential trading game and a class of budget-feasible reallocation mechanisms, along with efficient algorithms for computing equilibria. The authors prove that any budget-feasible mechanism weakly expands equilibrium trades, and budget-balanced mechanisms also weakly improve social welfare. Experiments on synthetic markets show these benefits grow with the tree's depth and branching.
In briefGaps and Augmentations in Bayesian Scheduling
SummaryThis paper studies how prior information, Bayesian incentive compatibility, randomization, and machine-side resource augmentation affect the approximation barrier for makespan scheduling on unrelated machines. It proves an asymptotic 4/3 lower bound for randomized BIC mechanisms with two machines and shows randomized BIC mechanisms can beat deterministic ones, with an integrality gap of 8/7. It also shows that under a spreading condition on job assignments, O(m/ε) sampled layers let the truthful MinWork mechanism reach a 1+ε approximation.
In briefToward system-of-systems integration for composable cloud, HPC, and edge AI platforms
SummaryThis paper argues that modern AI platforms combining cloud, HPC, cloud-native, and edge stacks can be viewed as systems of systems, where each constituent keeps its own control and failure semantics. It proposes composable integration based on interfaces, contracts, and operational evidence, without requiring a single orchestration stack. The authors present a peer constituent-system view, a boundary test, a shared responsibility model, seven integration surfaces, and a cross-system workflow example. They close with evidence classes and research questions for evaluating interoperability, governance, observability, and fault containment.
In briefGeometry-aware multi-UAV full-duplex communication system and field experiment
SummaryThis paper presents a multi-UAV in-band full-duplex communication system that uses high-gain directional antennas and separated uplink and downlink channels. It turns self-interference into controllable co-channel interference between UAVs, avoiding energy-intensive self-interference cancelers on the UAVs. The authors derive a geometry-aware interference model and define a reliable operating region in 3D airspace where the SINR requirement is met. Field trials with two UAVs and a ground station show downlink capacity that exceeds conventional TDD and approaches ideal full-duplex in most of the airspace.
