Filetype
This thesis discusses novel results in the area of code-based cryptography, ranging from cryptanalyses on several code-based cryptographic constructions to proposing a code-based authentication scheme based on a novel Syndrome Decoding variant.To address the looming threat of large-scale quantum computers that wouldbreak many widely-used public-key cryptosystems, the National Institute of Stan-dar
This thesis investigates scalable control design for networked dynamical systems, which are of great importance due to their wide range of practical applications, including large-scale formation control. A central challenge in such systems is enabling agents to coordinate effectively based only on local and relative information, particularly as the system size increases. To address this, the thesi
The Restricted Syndrome Decoding Problem (RSDP) is a variant of the well-known syndrome decoding problem. It has been recently turned into a post-quantum signature scheme named CROSS by Baldi et al.. It is a scheme highlighted for being computationally friendly and providing a compact signature and public key size. This paper investigates an Oracle-based definition of the RSDP that has already pro
We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al.'99] also on proof size. [Alekhnovich and Razborov'03] established that if the clause-variable incidence graph of a conjunctive normal form (CNF) formula F is a good enough expander, then proving that F is unsatisfiable requires high
We study the notion of (additive) separability of a function of several variables with respect to a hypergraph (H-graph). We prove the existence of a unique minimal H-graph with respect to which a function is separable and show that the corresponding minimal decomposition of the function can be obtained through a recursive algorithm. We then focus on (strategic form) games and propose a concept of
Navigating complex environments requires Unmanned Aerial Vehicles (UAVs) and autonomous systems to perform trajectory tracking and obstacle avoidance in realtime. While many control strategies have effectively utilized linear approximations, addressing the non-linear dynamics of UAV, especially in obstacle-dense environments, remains a key challenge that requires further research. This paper intro
In this paper, we unify two already published results on state feedback H-infinity optimality. Previously, optimality has been shown for a particular controller structure in the case that the open-loop state matrix is symmetric, as well as in the case that the closed-loop system is internally positive. By contrast, the main result of the present paper gives optimality based on neither of these two
Balcinrenone (AZD9977) is a selective mineralocorticoid receptor modulator in development in combination with dapagliflozin for treatment of heart failure with impaired kidney function and chronic kidney disease. A prespecified concentration–QT analysis was performed based on data from a phase I single ascending dose study prospectively designed as a thorough QT study substitute. Oral single doses
Background: Outcome measurement is essential to progress clinical practice and improve patient care. Aim: To develop a Core Outcome Set for best care for the dying person. Design: We followed the Core Outcome Measures in Effectiveness Trials (COMET) Initiative guidelines, which involved identifying potential outcomes via a systematic literature review (n = 619 papers) and from participants in the
Exceptional are the instances where explicit solutions to optimal control problems are obtainable. Of particular interest are the explicit solutions derived for minimax problems, as they provide a framework for addressing challenges involving adversarial conditions and uncertainties. This thesis presents explicit solutions to a novel class of minimax optimal control problems for positive linear sy
When it comes to innovation, economic growth, affluence and international attractiveness, there are currently few places in the world that can compare with the San Francisco Bay Area. However, new megatrends such as Sustainability, can challenge its attractiveness. Scholars talk about the “Nordic approach”.In the geographical area of Southern Scandinavia, ‘The Strait Area’, the focus is on Sustain
We study an information design problem to reduce congestion in transportation networks. In presence of an uncertain network state, the central planner may sends private signals to the users, with the goal of steering the user equilibrium towards the system optimum flow. We consider private signals and provide sufficient conditions under which optimality may be achieved by information provision in
We deal with a control problem for a complex social network in which each agent has an action and an opinion, evolving according to a coevolutionary model. In particular, we consider a scenario in which a committed minority - a set of stubborn nodes - aims to steer a population, initially at a consensus, to a different consensus state. Our study focuses on determining the conditions under which su
Computational methods to understand interactions in bio-complex systems are however limited to time-scales typically much shorter than in Nature. For example, on the nanoscale level, interactions between nanoparticles (NPs)/molecules/peptides and membranes are central in complex biomolecular processes such as membrane-coated NPs or cellular uptake. This can be remedied by the application of e.g. J
The contributions from anions and cations from salt are inseparable in their perturbation of molecular systems by experimental and computational methods, rendering it difficult to dissect the effects exerted by the anions and cations individually. Here we investigate the solvation of a small molecule, caffeine, and its perturbation by monovalent salts from various parts of the Hofmeister series. U
In this paper, characteristic mode analysis is used to gain insight into the operation of millimeter-wave series patch array. It is shown that the series patch array (broadside) mode has lower modal bandwidth and higher resonant frequency than the corresponding mode of a constituting patch element, whereas the other dominant orthogonal (broadside) mode is identical between the array and the single
We prove near-optimal tradeoffs for quantifier depth (also called quantifier rank) versus number of variables in first-order logic by exhibiting pairs of n-element structures that can be distinguished by a k-variable first-order sentence but where every such sentence requires quantifier depth at least nω (k/log k). Our tradeoffs also apply to first-order counting logic and, by the known connection
Conflict analysis has been successfully generalized from Boolean satisfiability (SAT) solving to mixed integer programming (MIP) solvers, but although MIP solvers operate with general linear inequalities, the conflict analysis in MIP has been limited to reasoning with the more restricted class of clausal constraint. This is in contrast to how conflict analysis is performed in so-called pseudo-Bool
Mutation testing is the state-of-the-art technique for assessing the fault detection capacity of a test suite. Unfortunately, a full mutation analysis is often prohibitively expensive. The CppCheck project for instance, demands a build time of 5.8 min and a test execution time of 17 s on our desktop computer. An unoptimised mutation analysis, for 55,000 generated mutants took 11.8 days in total, o
