Filetype
Optimization problems occur in many areas in science and engineering. When the optimization problem at hand is of large-scale, the computational cost of the optimization algorithm is a main concern. First-order optimization algorithms—in which updates are performed using only gradient or subgradient of the objective function—have low per-iteration computational cost, which make them suitable for t
The devices that constitute the Internet of Things are evolving to include more than just enabling sensing and actuation over a wireless interface. In a contemporary scenario, these devices perform tasks and contribute to an aggregate information flow, in a distributed manner. In the wake of this evolution, new distributed Internet of Things frameworks have emerged. These frameworks maintain a dis
For multi-vehicle complex traffic scenarios in shared spaces such as intelligent intersections, safe coordination and trajectory planning is challenging due to computational complexity. To meet this challenge, we introduce a computationally efficient method for generating collision-free trajectories along predefined vehicle paths. We reformulate a constrained minimum-time trajectory planning probl
The first WARA Robotics Mobile Manipulation Challenge, held in December 2024 at ABB Corporate Research in Vasteras, Sweden, addressed the automation of task-intensive and repetitive manual labor in laboratory environments - specifically the transport and cleaning of glassware. Designed in collaboration with AstraZeneca, the challenge invited academic teams to develop autonomous robotic systems cap
During the last two decades, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of the resolution proof system are fairly well understood, but many open problems remain for the related but stronger proof system polynomial calculus (PC/PCR). For instance, the space complexity of many standard “
Background: CD40 agonists have the potential to enhance the efficacy of standard of care chemotherapy and to trigger antitumor immunity. Preclinical models indicate that the success of this approach depends on appropriate sequencing of chemotherapy with a CD40 agonist. Preliminary efficacy results from the OPTIMIZE-1 Phase II study (NCT04888312) combining mitazalimab (anti-CD40) with mFFX chemothe
Particulate methane monooxygenase (pMMO) is an enzyme that converts methane into methanol at ambient temperature and pressure. Over the past three decades, the metal content and location of the active site have been highly controversial. Recent single-particle cryogenic electron-microscopy (cryo-EM) structures have furthered this debate. In this study, three cryo-EM structures (PDB entries 7s4h, 7
We analyze the stability of the logit evolutionary dynamics in population games, possibly with multiple heterogeneous populations. For general population games, we prove that, on the one hand, strict Nash equilibria are asymptotically stable under the logit dynamics for low enough noise levels, on the other hand, a globally exponentially stable logit equilibrium exists for sufficiently large noise
The performance of wireless communications at sea are often limited by fading caused by reflections at the sea surface. The reliability could potentially be improved by employing multiple antennas. We have conducted massive multiple-input multiple-output (MIMO) measurements at sea in order to evaluate the performance. The measurements were conducted at 5.6 GHz with 64 dual-polarized antennas, whic
The Bregman distance is a central tool in convex optimization, particularly in first-order gradient descent and proximal-based algorithms. Such methods enable optimization of functions without Lipschitz continuous gradients by leveraging the concept of relative smoothness, with respect to a reference function h. A key factor in determining the full range of allowed step sizes in Bregman schemes is
We consider the verification of neural network policies for discrete-time stochastic systems with respect to reach-avoid specifications. We use a learner-verifier procedure that learns a certificate for the specification, represented as a neural network. Verifying that this neural network certificate is a so-called reach-avoid supermartingale (RASM) proves the satisfaction of a reach-avoid specifi
The vast bandwidth available at sub-THz frequencies holds great promise for high-speed wireless access, precise localization, and advanced sensing applications. However, fundamental physical constraints and technological limitations make the deployment of reliable sub-THz networks challenging. We propose a new paradigm for sub-THz coverage by transmitting the RF signals over polymer microwave fibe
We develop a Lyapunov-based analysis of Korpelevich’s extragradient method and show that it achieves an o(1/k) last-iterate convergence rate of the constructed Lyapunov function. This Lyapunov function simultaneously upper bounds several standard measures of optimality, which allows our analysis to sharpen existing last-iterate convergence guarantees for these measures. Moreover, the same analysis
Whereas theoretical attacks on standardized crypto primitives rarely lead to actual practical attacks, the situation is different for side-channel attacks. Improvements in the performance of side-channel attacks are of utmost importance.In this paper, we propose a framework to be used in key-recovery side-channel attacks on CCA-secure post-quantum encryption schemes. The basic idea is to construc
In this work, we introduce novel techniques for adapting the SCA-LDPC framework to NTRU-style Key Encapsulation Mechanisms (KEMs). Our approach significantly reduces the required measurements compared to prior analyses under similar oracle noise, validated through extensive simulations, and shows robustness against decision errors in the constructed oracle. Furthermore, we present the first docume
In this work, we introduce novel techniques for adapting the SCA-LDPC framework to conduct efficient plaintext-checking (PC) oracle-based side-channel attacks on NTRU-style Key Encapsulation Mechanisms (KEMs). We specifically address the unique algebraic structure of the NTRU and NTRU Prime schemes, demonstrating how to extract information related to secret variables from side channels and modeled
As the Hamming Quasi-Cyclic (HQC) cryptosystem was recently selected by NIST for standardization, a thorough evaluation of its implementation security is critical before its widespread deployment. This paper presents single-trace side-channel attacks that recover the full long-term secret key of HQC, experimentally evaluated on a protected Cortex-M4 implementation. We introduce two distinct attack
A broadband high gain metasurface-based Fabry–Perot resonant cavity antenna (FPRCA) for polarization reconfigurable is proposed in this article. The antenna features a microstrip source antenna with a single-layer 2 × 2 circular patch metasurface, a ground plane, and a double-layer partially reflective surface (PRS), along with four resistors and two diodes. Characteristic mode analysis (CMA) is p
This is the Replicated Computational Results (RCR) Report for the article “Testing Abstractions for Cyber-Physical Control Systems.” The article empirically studies how substituting different components in Cyber-Physical Systems (CPSs) testing with simulators impacts the fault-exposition. This RCR report describes the artefacts used in the article, how to use the testing setups used in the article
Combining attribute grammars with object-oriented programming supports a new kind of declarative programming, allowing compilers to be built in a highly extensible manner. By leveraging a base compiler, extended languages can be supported at a relatively low cost. Recent work shows the applicability of the technique to general-purpose programming languages like Java. In this article, we illustrate
