Distributed massive MIMO (D-MIMO) is a promising technology for future generation wireless systems as it takes advantage of both an increased array aperture and a decentralized processing architecture and topology. In order to truly understand the possibilities and limitations of these approaches in real scenarios, practical realization of testbeds is an essential step in the technology advancement. This work presents the Lund University Large Intelligent Surface testbed -- LuLIS, that can operate up to 256 coherent radio frequency (RF) chains using 16 AMD Zynq UltraScale RFSoC ZCU216 evaluation boards acting as distributed processing nodes. Real-time processing is facilitated by acceleration and distribution of MIMO processing algorithms on the FPGA fabric of the boards. The system is easily scalable, as increasing the number of antennas is done in multiples of 16 by adding more RFSoCs, which also implies addition of another processing node. The design allows up-scaling without hardware redesign, introduction of large latencies or data transfer overhead. The testbed is flexible in terms of deployment, with options of fully distributing the nodes (as in D-MIMO) or co-locating them (as in more traditional Massive MIMO). A detailed description of the implementation of the testbed is presented and initial results are shown for an uplink (UL) transmission from four single-antenna user equipments (UEs) to 64, 128 and 256 base-station antennas.

We prove a fermionic-bosonic duality relation for the Macdonald index in Argyres-Douglas theories of type $(A_1, D_{2k+1})$, thereby yielding a conjectural fermionic formula due to Andrews et al. Our duality is built upon a new conjugate Bailey pair to be established using techniques from orthogonal polynomials and basic hypergeometric series. In addition, this fermionic formula implies another sum-like expression independently conjectured by Andrews et al. and Kim et al. for the same Macdonald index.

An optomechanical oscillator undergoes a Hopf bifurcation that connects two dynamical regimes with different information-processing capabilities: thermal Brownian motion and coherent self-sustained oscillation. Below threshold, the oscillator occupies a stable fixed point around which thermal fluctuations drive stochastic Brownian motion - a regime dominated by linear response, with only short-lived memory and negligible usable nonlinearity. Above threshold, radiation pressure, free-carrier dynamics, and thermo-optic relaxation act together to sustain a stable limit cycle that simultaneously provides both nonlinear transformation and dynamical memory. Here we show that this coherent regime can be used as a physical reservoir for computation: by perturbing the phonon-lasing attractor, the cavity performs nonlinear input-output transformations and retains short-term memory without any external feedback mechanism. Using only a single chip-integrated device with 20 virtual nodes, we reconstruct nonlinear functions, predict the evolution of chaotic time series, and perform spoken digit classification on a two-digit sub-task. The mechanical resonance frequency sets the intrinsic dynamical timescale of the reservoir and therefore its processing speed; while the present device operates near 0.4 GHz, optomechanical and nanomechanical systems can be engineered to reach multi-GHz and sub-terahertz frequencies, directly translating into a scalable path toward ultrafast integrated physical computing.

We propose a degree-preserving variant of the Builder--Chooser clique game of Pettie, Tardos, and Walczak. In each round, Builder chooses a matching, performs a degree-preserving growth (DPG) step by replacing the chosen edges with edges incident to a new vertex. Then partitions the entire edge set into two parts, and Chooser keeps one part. We begin the study of this game with the first nontrivial target, namely forcing a triangle. For triangle-free initial graphs we prove an exact one-round criterion, derive an exact one-round threshold on paths and exact forcing times on cycles, and identify the $5$-cycle as the first genuine two-round example. We then formulate a one-round criterion for larger cliques, prove a sharp exact result for forcing $K_4$ from triangle-free seeds. We establish general lower bounds on clique-forcing times from clique-free seeds, and isolate a conjectural template-amplifier lemma which, if proved, would imply that every clique is forceable from some triangle-free seed.

We investigate the interior structures and cryovolcanic observability of the exoplanets TRAPPIST-1f, g, and h. Our aim is to determine which interior configurations can sustain subsurface liquid water oceans in thermal equilibrium and to assess whether the resulting cryovolcanic outgassing could be detectable with current and future observatories. Using a layered interior model with silicate and ice layers, we identify thermal equilibrium configurations and quantify internal heat partitioning through Monte Carlo simulations. We also estimate cryovolcanic water outgassing and assess its detectability using synthetic transmission spectra of atmospheres and exospheres. We find that the internal heat budgets of all three planets are dominated by radiogenic heating and tidal dissipation in high-pressure ice layers. Thermal equilibrium solutions for TRAPPIST-1f and g favor thin outer ice shells and shallow subsurface oceans, whereas TRAPPIST-1h permits thicker ice shells, in agreement with previous work. Localized plume-like outgassing produces stronger JWST/NIRISS transmission signals than globally distributed exospheres. Under favorable assumptions, outgassing on TRAPPIST-1f may be detectable within about 20 transits. Overall, our results show that subsurface oceans can be sustained across a broad range of interior configurations and constrain the detectability of cryovolcanic water vapor on the TRAPPIST-1f, g, and h planets. Interior heat budgets and the spatial distribution of outgassed material emerge as key factors controlling detectability. This framework motivates future transmission studies of Europa-like exoplanets.

A neutron star is born as a hot, lepton-rich protoneutron star (PNS) and cools via neutrino emission, eventually allowing heavy ions in the outer layers to crystallize into a solid crust. We develop a simple analytic estimate for the onset time of this crust formation during the late, post-convective PNS cooling phase. Using a diffusion-based neutrino luminosity and the resulting entropy evolution together with an approximately isentropic interior structure, we obtain the time-dependent density and temperature at the neutrinosphere. We then impose the Coulomb crystallization condition for heavy nuclei, expressed through the Coulomb coupling parameter, and determine when the neutrinosphere temperature first falls below the crystallization threshold evaluated at the neutrinosphere density. This procedure yields closed expressions for the entropy at crystallization and the corresponding crust-formation time, with explicit dependence on the PNS mass and radius, an effective diffusion/cooling normalization, and composition parameters such as the ionic charge $Z$ and heavy-nuclei mass fraction. For canonical microphysics, we find that the first solid phase typically appears at $t_{\mathrm{crust}}\sim 100$-$500\,\mathrm{s}$. These closed-form scalings provide a useful late-time analytic benchmark for the onset of crust formation and clarify its dependence on PNS and composition parameters.

We prove the open question posed by Zhuang and Hu in Remark 3.1. More generally, we consider symmetric joint probability mass functions and joint densities whose associated quadratic form is non-negative. In this class, for every \(r>0\), the inequality \(\E\abs{X+Y}^{r}\ge \E\abs{X-Y}^{r}\) holds for all distributions with finite \(r\)-th absolute moment if and only if \(0<r\le2\).

Convex integration has revealed that the Euler system of gas dynamics is ill-posed in the class of weak solutions even if the entropy inequality is imposed as an additional constraint. A natural question arises, namely, if a physically relevant solution can be selected by maximizing the entropy production rate. Firstly, we present an example of Riemann initial data in 2-D, for which the standard self-similar solution fails to satisfy the maximal entropy production principle. Hence, maximizing the entropy production rate rules out the 1-D self-similar solution which intuitively seems to be the physically relevant solution in this context. Secondly, we show for a large class of initial data that there exist entropy admissible weak solutions with an arbitrary (non-decreasing) total entropy profile.

Conventionally, controlling photonic modes require complex artificial structures made of electromagnetic media such as photonic crystal, metamaterial, and waveguide systems. Here, we report a new mechanism for mode control induced solely by curved spacetime, which give rise to a spatially dependent photonic band structure. In this framework, the photonic mode can naturally undergo conversion in the spatial domain. We select two canonical models from general relativity--the Rindler spacetime and the Einstein-Rosen bridge (ERB)--to demonstrate light propagation effects. In Rindler spacetime, a light beam transitions to a diffusive mode for positive acceleration and to a highly collimated propagating mode for negative acceleration. In the ERB, beam transmission is governed by the Schwarzschild radius, which determines the extend of the spatial bandgap. Furthermore, an intriguing tunneling effect is also illustrated. Finally, we propose several feasible experimental methods to verify our theoretical predictions. Our findings elucidate a distinctive formation mechanism of photonic band structure in curved spacetime, enabling precise spatial control of light and the design of photonic devices within a non-Euclidean geometrical framework.

In December 2023, the Large-Sized Telescope prototype (LST-1) detected for the first time VHE $γ$-ray emission from the FSRQ OP~313 becoming the furthest blazar ever observed at VHE with z=0.997. We aim to characterize the $γ$-ray emission of OP 313 during this flare, comparing it with its average emission state in order to understand the processes leading to this detection. Its remarkable distance also enables studies on the Extragalactic Background Light (EBL), with the goal of evaluating the attenuation of VHE $γ$-ray photons. We characterize the $γ$-ray emission during the flare in December 2023 and the low emission state observed in January 2024 thanks to the LST-1 and MAGIC data and quasi-simultaneous \textit{Fermi}-LAT observations. This dataset also enables us to evaluate the EBL attenuation by systematically exploring the EBL intensity over the $γ$-ray spectrum. Finally, we study the multi-wavelength emission and interpret the broadband spectral energy distribution (SED) within blazar radiative models including the thermal contributions from the accretion disc, dusty torus and broad line region. We also characterize the flare brightness in the high-energy (HE, $E>100$~MeV) $γ$-ray band, that was found to be a factor 50 above the average emission seen by \textit{Fermi}-LAT. The HE and VHE observations allow us to set constrains to the EBL density. Finally, thanks to the extensive multi-wavelength campaign organized, we are able to construct and model the broadband SED of OP~313 within the framework of a two-zone leptonic model where the $γ$-ray emission is produced via inverse-Compton scattering of the broad line region, accretion disk and dusty torus photon fields. However the dominant external photon field remains unknown, as several combinations are able to successfully explain the $γ$-ray emission observed.

Inspired by the vectorial lattice Boltzmann method for linear elastodynamics \citep{boolakee2025linear}, we construct a total-Lagrangian vectorial lattice Boltzmann formulation for two-dimensional finite-strain hyperelastic dynamics. The governing equations are first written as a conservative first-order system for the material velocity and the full deformation gradient. This representation separates the kinematic part of the dynamics from the constitutive closure: the first Piola--Kirchhoff stress is evaluated locally from the current deformation gradient and enters the lattice only through nonlinear flux moments. A D2Q4 stencil with six-component vector populations is then used to match the state and the two material-coordinate fluxes. The formulation includes a second-order population initialization, trapezoidally centered body forcing, displacement reconstruction by velocity quadrature, and half-way reconstructions for velocity Dirichlet and Neumann traction boundaries on grid-aligned domains. The resulting method preserves the local collide--stream structure of standard lattice Boltzmann schemes while adapting the vectorial first-order strategy from linear elastodynamics to hyperelastic finite-strain dynamics.

We study odometer maps $W_L$ on vector-valued full Fock spaces arising from Fock representations of the odometer semigroup. We obtain a canonical upper triangular block decomposition \[ W_L= \begin{pmatrix} W_{11} & W_{12}\\ 0 & W_{22} \end{pmatrix}, \] where $W_{11}$ is unitary and $W_{22}$ admits a Hardy space realization as an analytic Toeplitz operator $M_Θ$. The associated symbol $Θ\in H^\infty_{\mathcal{B}(\mathcal{E})}(\mathbb{D})$ is used to characterize the isometric, unitary, and invertible cases, as well as norm identities and Douglas-type factorization properties of $W_L$. We also derive an explicit formula for $W_L^*$ for arbitrary bounded symbols $L$. In the isometric case, this identifies $\ker W_L^*$ with $\mathcal{E}_L\ominus L\mathcal{E}$, and hence $\operatorname{mult}(W_L)=\dim(\mathcal{E}_L\ominus L\mathcal{E})=\operatorname{mult}(M_Θ)$. In the same setting, the condition $\dim(\mathcal{E}_L\ominus L\mathcal{E})<\infty$ is equivalent both to Fredholmness and to essential normality of $W_L$, with $\operatorname{ind}(W_L)=-\dim(\mathcal{E}_L\ominus L\mathcal{E})$. We further obtain Coburn-type spectral consequences and a necessary condition for hyponormality.

The integration of Non-Terrestrial Networks (NTN) with Terrestrial Networks (TN) is a key enabler for resilient 5G-Advanced and future 6G backhaul infrastructures. However, managing traffic across these highly asymmetric links remains a significant routing challenge, as systems must support heterogeneous network slices with conflicting service-level agreements (SLAs) while selectively utilizing costly NTN resources. This paper presents a computationally lightweight SLA-aware traffic-steering framework for a hybrid TN-NTN backhaul that models the load-balancing problem as an exact potential game. This mathematical foundation inherently enables decentralized coordination between uplink and downlink load-balancing agents without control-message overhead. By formulating traffic steering as a coupled optimization problem, per-slice (or per-user group) traffic fractions are dynamically distributed across terrestrial and satellite paths based on utility functions that capture throughput, latency, packet loss, and SLA penalties. The resulting game admits a pure Nash equilibrium, ensuring stable and predictable traffic adaptation under non-stationary load conditions. The framework is evaluated on a geographically distributed 5G testbed, using bidirectional traffic generated for five representative slices. Experimental results show that the proposed controller significantly outperforms heuristic and conventional baselines, reducing SLA violations to 1.7% for V2X and 0.7% for the emergency slice while completely eliminating them for video, IoT, and best-effort traffic.

This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at random, its type observed, and then it is returned to the urn. The urn is subsequently updated according to a mixed replacement matrix: with fixed probability $p\in(0,1)$, the Friedman replacement matrix is applied, adding $a$ balls of the drawn type and $b$ balls of the opposite type; with fixed probability $1-p\in (0,1)$, the Pólya replacement matrix is applied, adding $c$ balls of the drawn type. We establish the central limit theorem for the proportion of type $1$ balls after $n$ draws. Furthermore, we provide corollaries that yield large deviation inequalities and the law of the iterated logarithm related to the proportion of type $1$ balls after $n$ draws.

We theoretically investigate the effects of parametric driving on the one-dimensional Frenkel-Kontorova model, a nonlinear many-body lattice system. It is numerically found that a parametric vibration induces spatiotemporal ordering characterized by the subharmonic frequency $ω_{\mathrm{ex}}/2$ and wavenumber $k$ which takes nontrivial values depending on the vibration strength $P_{\mathrm{ac}}$ and frequency $ω_{\mathrm{ex}}$. With increasing $P_{\mathrm{ac}}$, $k$ gradually increases and discontinuously jumps up to $k=π$. Based on an extended linear stability analysis, we show that the former $k$ resonance (the latter $π$ resonance) corresponds to the unstable (stable) mode and that the $k$ resonance is made possible by the interplay between the parametric amplification and the collective fluctuation developing through the nonlinear effect.

Understanding regional dynamical structures in the sea is fundamental to characterize energy transfer and transport properties, with implications in physical and biogeochemical modeling and characterization. In this work, we study the potential of clustering techniques to identify regional patterns, persistent or recurrent configurations, out of daily snapshots of sea surface temperature and kinetic energy in a region of the western Mediterranean Sea. From the methodological perspective, we use different clustering techniques: K-means, Self-Organizing Maps and InfoMap to verify if the patterns found are coherent across methods. Our results show that K-means and Self-Organizing Maps consistently delineate four distinct clusters of sea surface temperature configurations, aligned with the seasons even after removing the annual cycle, which indicates the persistence of seasonal structures beyond a mean effect in the temperature field. The study of surface kinetic energy, characterized by higher spatial and temporal variability, reveals more complex circulation regimes. While K-means and Self-Organizing Maps provide a robust and convergent classification of the dominant large-scale energy patterns, InfoMap uncovers finer-scale features such as localized jets and eddies. InfoMap, in particular, provides a complementary perspective to the partition-based methods, validating subtle yet significant hydrodynamic structures and acting as an anomaly detector for extreme events.

Shared library hijacking attacks in the Linux ecosystem, including embedded Linux, are a significant concern. It fundamentally exploits the dynamic linker's library-resolution semantics rather than modifying trusted libraries directly. Prior research has extensively analyzed attack vectors exploiting environment variables, embedded search paths, and dynamic loader internals, demonstrating that hijacking is rooted in fundamental loader behavior rather than isolated misconfigurations. Existing defenses either harden or replace the loader, enforce control-flow integrity after libraries are loaded, or apply file-centric integrity mechanisms such as signatures and measurement frameworks. However, these approaches fail to address a critical gap: none verify whether the shared object actually resolved by the loader is the intended and trusted one. In this paper, we argue that shared library hijacking is fundamentally a loader-resolution authenticity problem and present a loader-centric verification framework that enforces authenticity guarantees for the dynamic linker's resolution process. Our design supports both path-bound and location-independent (i.e., Build-ID-based) identity models combined with cryptographic hashing. We implement our approach on GNU libc (glibc) systems and evaluate it on both general-purpose Linux (e.g., Ubuntu) and embedded Linux (e.g., Buildroot) environments under emulation. Our results demonstrate that our proposed mechanism indeed prevents shared library hijacking attacks.

We prove that the continuous-time, single-flip Glauber dynamics for lozenge tilings of the size-$N$ hexagon mix in time $N^{2+o(1)}$. This was predicted to hold on fairly general domains of diameter $N$ (on the basis of the ``Lifshitz law'' heuristic) but had previously only been established in domains such that the associated limit shape has no frozen facets. To access the hexagon, we introduce a multi-scale comparison argument between the height function of the random tiling evolving under the Glauber dynamics and the limit shape of a volume-tilted tiling (whose tilting parameter varies suitably in time).

A linear-complexity algorithm for computing the Wasserstein-1 distance on non-uniform meshes is proposed. This work extends the fast Sinkhorn algorithms from [Q. Liao et al., Commun. Math. Sci., 20(2022)] and [Q. Liao et al., J. Sci. Comput., 98 (2024)] to non-uniform meshes. In those prior works, a distinctive collinear structure of the kernel matrix on uniform meshes was identified, enabling \(O(N)\) acceleration via dynamic programming. While non-uniform meshes are prevalent in practical applications like computational fluid dynamics and finance, their lack of collinearity has hindered direct acceleration. In this paper, we introduce the concept of a ``dividing index'', which partitions the kernel matrix into two blocks. We demonstrate that each block exhibits a quasi-collinear property, a generalization of the structure found in uniform meshes. Leveraging this insight, we develop \textbf{F}ast S\textbf{I}nkhorn algorithm on \textbf{NO}n-uniform \textbf{M}eshes (\textbf{FINOM}), a dynamic programming approach that reduces the per-iteration complexity of the Sinkhorn algorithm from \(O(N^2)\) to \(O(N)\). Extensive numerical experiments on 1D and 2D problems confirm these improvements, achieving speed-ups of several orders of magnitude while maintaining accuracy.

We discuss the isospin-breaking effects on threshold cusp structures in multichannel scattering near two-body thresholds. In hadronic systems with isospin symmetry, two or more nearly degenerate thresholds can appear, and their small splitting due to isospin breaking can generate multiple cusp structures in a narrow energy region. In this paper, using the $K$-matrix representation, we derive a general expression for the scattering amplitude near the thresholds and show that the cusp structures can be classified by the signs of the slopes of the cross section above and below threshold. We also show that additional restrictions appear in two- or three-channel systems and in the Flatté amplitude. For three-channel scattering with two nearby thresholds, we clarify how the two cusp structures are related when the threshold splitting is small and how they merge into a single cusp in the degenerate limit. Finally, we discuss the cusp structures in the $Λp$ elastic cross section in the coupled $ΛN$-$ΣN$ system with charge $Q=+1$. We show that, when isospin breaking is small, the two cusp structures are constrained by isospin symmetry. We also perform quantitative calculations using both simplified examples and realistic input based on N$^2$LO chiral effective field theory, and find that isospin breaking can significantly modify the relative sharpness of the cusps and may even change the cusp type itself.

We study dynamic large deviations for the Kipnis--Marchioro--Presutti process on the discrete torus $\mathbb{T}_N^d$. By recasting the candidate rate function in terms of a linear hyperbolic-parabolic equation with rough drift, we show that pathological trajectories appear in the large deviations with finite rate in any dimension $d\ge 2$. Along the way, we rigorously validate the lower bound derived by Bertini-Gabrielli-Lebowitz in any dimension.

The Resource Public Key Infrastructure (RPKI) has become essential to secure inter-domain routing. Despite its critical role, RPKI software remains largely untested beyond shallow parsing. Existing fuzzers, like AFL++ or libFuzzer, do not work well for RPKI as they assume a single, self-contained input per execution, while RPKI repositories contain hundreds of interdependent cryptographically linked objects. Existing fuzzers fail to handle this complexity and lack the ability for precise coverage attribution in multi-object repositories, breaking feedback-based exploration and thereby missing most severe vulnerabilities in RPKI validation. In this paper, we overcome these limitations through novel fuzzing techniques, including continuous sampling and using functions as side-channels for per-object coverage attribution in large input repositories. We further show how parsing inputs to a labeled tree allows structural and semantic mutations while preserving cryptographic validity in mutated repositories. We implement our new techniques into a powerful fuzzing tool called CAT, combining non-sequential fuzzing with our template-agnostic ASN.1 mutation engine to achieve 66x throughput improvement over sequential fuzzing and exploring 24 - 47% more unique code paths compared to libFuzzer and previous work. Evaluating CAT on RPKI validators uncovered 21 previously unknown vulnerabilities with 8 CVEs already assigned (CVSS 7.5 - 9.8). These include a buffer overflow, Denial-of-Service (DoS), and exploitable repository-poisoning logic flaws. We open-source CAT to enable reproducibility, further research, and adaptation of our methods to other complex cryptography-based protocols such as DNSSEC and TLS.

We provide an extended acount of the recent statistical mechanical theory of gauge invariance against operator shifting in quantum many-body systems (arXiv:2509.20494). The gauge transformation is enacted by a shifting superoperator that displaces the fundamental position and momentum degrees of freedom. The shifting superoperator constitutes a map between Hilbert space operators and it features Lie algebra commutator structure. Averages of general observables remain invariant under the shifting both in and out of thermal equilibrium, as well as in groundstates. The gauge invariance induces exact sum rules that interconnect global observables and associated locally resolved correlation functions. In particular we describe the resulting one-body force, hyperforce, product, and two-body sum rules. We relate the shifting superoperator to a previously formulated quantum canonical transformation and present the generalization of quantum shifting to multi-component systems. The gauge theory respects fundamental fermionic and bosonic particle properties, as we demonstrate by proving the compatibility of operator shifting and exchange symmetry. We formulate the quantum version of hyperdensity functional theory to provide formal access to hyperforces as well as to general averaged quantum observables via universal density functionals. For time-dependent situations, we describe quantum dynamical gauge invariance and prove exact dynamical sum rules for nonequilibrium situations, as generated by Hamiltonian time dependence. We argue for the fundamental status of statistical mechanical gauge invariance based on the compliance of the underlying geometry with canonical quantization according to Dirac's correspondence principle. Analogies and differences of the quantum mechanical sum rules with their classical counterparts remain indicative of the respective levels of description.

A formal development of the hypoequilibrium (HE) state concept within the Steepest-Entropy-Ascent Quantum Thermodynamics (SEAQT) framework is presented, emphasizing its rigorous mathematical formulation. Using a general decomposition of the Hilbert space, HE states are defined in operator language and the reduced evolution of the associated intensive parameters for the regime where the dissipative dynamics commutes with the Hamiltonian is derived. It is proved that the $M$-th order HE family (where $M$ is the number of spectral sectors) constitutes an invariant manifold under the SEAQT equation of motion, ensuring that states initially representing a ``mixture of canonicals'' maintain this structure throughout their evolution. Furthermore, a formal connection is established between the HE ansatz and the rate-controlled constrained equilibrium (RCCE) method, identifying HE variables as constraint potentials. Finally, the model is extended to non-Hamiltonian SEAQT (NH-SEAQT) interactions to describe thermodynamically consistent energy and entropy exchanges between subsystems and heat baths. This work provides the formal foundation for reduced-order modeling of far-from-equilibrium relaxation and transport processes, and supports a methodology previously applied across various physical and chemical systems.

In a computer system, multiple indispensable components-such as the CPU, memory, and others-work together with other essential components to produce an overall effect, which can only be measured on an independently running system. Since the system operates as an integrated whole, isolating the effect of individual components is challenging. Accurately attributing the system's overall effect to its specific component is crucial for both computer design and evaluation. Taking CPU evaluation as a benchmark, our experiments reveal that the general-purpose rigorous methodologies, like DoE, RCTs, can not address this issue efficiently; A single-purpose empirical methodology, SPEC CPU2017, which is the industry-standard CPU benchmark, only reports the overall effect. Even more concerningly, for the identical CPU, the undefined configurations of other indispensable components introduce uncontrolled variability, with the SPEC scores fluctuating from 12.16\% to 436.80\%. We propose a rigorous methodology that can attribute the overall effect to its specific component, which can be utilized in computer component evaluations and design, as well as in other areas. Through theoretical analysis and pioneering controlled experiments, we systematically compare our methodology against three established methodologies: SPEC CPU2017, DoE, and RCTs. The results show our methodology can achieve its goal in a cost-efficient way, while others exhibit inherent limitations.

We study a tractable two-player contest built on a truncated cubic contest success function. Its defining feature is a strategic-feedback parameter whose sign determines whether a leading player's effort lowers (suppression) or raises (empowerment) the marginal effectiveness of the trailing player's effort; standard lottery contests impose suppression by construction. The benchmark yields closed-form mixed equilibria under complete information and a unique affine Bayesian Nash equilibrium under IID private information. Expected effort is typically single-peaked in the feedback parameter. Uncertainty lowers effort under suppression but raises it under empowerment, and the same asymmetry governs information disclosure: an effort-maximizing designer withholds information under suppression and discloses fully under empowerment. Several familiar conclusions of contest theory turn out to reflect suppressive benchmarks rather than contests as such.

Stream-based monitoring is a runtime verification approach where a monitor aggregates streams of input data from sensors and other sources to give real-time statistics and assessments of a system's health. One of the central challenges in designing reliable stream-based monitors is to deal with the asynchronous nature of data streams: in concrete applications, the different sensors being monitored produce values at different speeds, and it is the monitor's responsibility to correctly react to the asynchronous arrival of different streams of values. To ease this process, modern frameworks for stream-based monitoring such as RTLola enable users to finely specify data synchronization policies via a system of pacing annotations. While this feature simplifies the design of monitors, it can also lead users to write inconsistent policies, where synchronization between two streams is explicitly requested via annotations, but cannot always be achieved. To mitigate this issue, this paper presents pacing types, a novel type system implemented in RTLola to ensure that monitors for asynchronous streams are free of timing inconsistencies. We give a formal semantics to pacing annotations for a core fragment of RTLola, and present a soundness proof of the pacing type system. For an additional level of guarantees, we machine-checked the soundness proof using the Rocq proof assistant.

Practical ISAC is constrained by static clutter and NLoS multipath, which obscure target-coupled echoes and induce spurious peaks for beam alignment. Existing receiver-side methods largely model targets as passive scatterers, limiting the structural separability of target echoes from the environment. This paper establishes a structural correspondence between these limitations and target-side Backscatter-MIMO responses: reflection modulation enables waveform-domain separation from unmodulated clutter, while retro-directional passive beamforming concentrates the tagged echo toward the BS-facing direction and suppresses NLoS-induced false-peak locking. To operationalize this correspondence, dual-end spatial locking is required to overcome cascaded backscatter loss and provide beam-domain angular information. We propose a downlink-triggered blind dual-end alignment protocol that jointly selects the BS and Backscatter-MIMO codeword indices from the tagged echo observed at the BS, without pilots, CSI feedback, or target synchronization. We further derive a clutter-aware remodulation waveform robust to fractional timing offsets and construct adjustable-width BS/Backscatter-MIMO codebooks via quadratic phase spoiling. For reliability characterization, we derive closed-form expressions for the coherence-averaged end-to-end success probability. The analysis shows that beam narrowing is not universally beneficial: in NLoS-dominated regimes, enlarging the array aperture may degrade alignment reliability. The optimal beamwidth is instead governed by cross-phase competition between discovery and alignment, yielding a nontrivial feasible region with an analytically characterized boundary. Simulations validate the analysis and demonstrate improved reliability-gated locked-link performance under strong clutter, severe NLoS multipath, and finite coherence time.

This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean $d$-space: It is shown that for any finite point set $\mathbb{R}^d$, any root, and any $ε>0$, there is a Euclidean Steiner $(1+ε,O(\sqrt{1/ε}))$-SLT without any dependence on dimension. We also revisit the core example, designed by Solomon, in the plane and its generalization to $d$-space.

Stochastic model-predictive control (SMPC) has evolved to a powerful framework for the control of stochastic dynamical systems. SMPC utilizes a probabilistic uncertainty description to provide a systematic trade-off between the control objective and constraint satisfaction in a statistical sense. However, the majority of existing SMPC methods face challenges related to computational tractability due to the need for stochastic inference. Approaches that apply accurate inference are computationally demanding, which can lead to serious limitations in the implementability of these methods. Hence, in practice, the uncertainty propagation and the resulting distributions are typically approximated, e.g., by Gaussian distributions. These approximations promote computational efficiency, but are often too conservative, becoming a limiting factor in the representation of stochastic state evolution and the implied guarantees. To overcome this fundamental limitation of SMPC approaches, we propose a novel formulation based on the meta-state-space (MSS) representation of stochastic dynamical systems. The proposed MSS-based SMPC scheme offers a computationally efficient way to forward propagate the uncertainty with a flexible and highly accurate approximation of the probabilistic system description. With the presented method, the entire output probability density function can be directly shaped, which is unprecedented among existing SMPC techniques. Finally, we provide a detailed theoretical analysis and demonstrate the effectiveness of the proposed methodology via an extensive simulation study.