Miracle-dz/UniFAR-FTUs huggingface dataset:
CVA6 RISC-V Virtualization: Architecture, Microarchitecture, and Design Space Exploration

Virtualization is a key technology used in a wide range of applications, from cloud computing to embedded systems. Over the last few years, mainstream computer architectures were extended with hardware virtualization support, giving rise to a set of virtualization technologies (e.g., Intel VT and Arm VE) that are now proliferating in modern processors and systems on chip (SoCs). In this article, we describe our work on hardware virtualization support in the RISC-V CVA6 core. Our contribution is multifold and encompasses architecture, microarchitecture, and design space exploration (DSE). In particular, we highlight the design of a set of microarchitectural enhancements [i.e., G-stage translation lookaside buffer (GTLB) and second-level TLB (L2 TLB)] to alleviate the virtualization performance overhead. We also perform a DSE and accompanying postlayout simulations (based on 22-nm FDX technology) to assess performance, power, and area (PPA). Furthermore, we map design variants on a field-programmable gate array (FPGA) platform (Genesys 2) to assess the functional performance–area tradeoff. Based on the DSE, we select an optimal design point for the CVA6 with hardware virtualization support. For this optimal hardware configuration, we collected functional performance results by running the MiBench benchmark on Linux atop Bao hypervisor for a single-core configuration. We observed a performance speedup of up to 16% (approximately 12.5% on average) compared with virtualization-aware nonoptimized design at the minimal cost of 0.78% in area and 0.33% in power. Finally, all works described in this article are publicly available and open-sourced for the community to further evaluate additional design configurations and software stacks.
NPV, IRR, PI, PP, and DPP: a unified view

This paper introduces a class of investment project's profitability metrics that includes the net present value criterion (which labels a project as weakly profitable if its NPV is nonnegative), internal rate of return (IRR), profitability index (PI), payback period (PP), and discounted payback period (DPP) as special cases. We develop an axiomatic characterization of this class, as well as of the mentioned conventional metrics within the class. The proposed approach offers several key contributions. First, it provides a unified interpretation of profitability metrics as indicators of a project's financial stability across various economic scenarios. Second, it reveals that, except for an NPV criterion, a profitability metric is inherently undefined for some projects. In particular, this implies that any extension of IRR to the space of all projects does not meet a set of reasonable conditions. A similar conclusion is valid for the other mentioned conventional metrics. For each of these metrics, we offer a characterization of the pairs of comparable projects and identify the largest set of projects to which the metric can be unequivocally extended. Third, our study identifies conditions under which the application of one metric is superior to others, helping to guide decision-makers in selecting the most appropriate metric for specific investment contexts.
Geometry of contact: contact planning for multi-legged robots via spin models duality

Contact planning is crucial in locomoting systems.Specifically, appropriate contact planning can enable versatile behaviors (e.g., sidewinding in limbless locomotors) and facilitate speed-dependent gait transitions (e.g., walk-trot-gallop in quadrupedal locomotors). The challenges of contact planning include determining not only the sequence by which contact is made and broken between the locomotor and the environments, but also the sequence of internal shape changes (e.g., body bending and limb shoulder joint oscillation). Most state-of-art contact planning algorithms focused on conventional robots (e.g.biped and quadruped) and conventional tasks (e.g. forward locomotion), and there is a lack of study on general contact planning in multi-legged robots. In this paper, we show that using geometric mechanics framework, we can obtain the global optimal contact sequence given the internal shape changes sequence. Therefore, we simplify the contact planning problem to a graph optimization problem to identify the internal shape changes. Taking advantages of the spatio-temporal symmetry in locomotion, we map the graph optimization problem to special cases of spin models, which allows us to obtain the global optima in polynomial time. We apply our approach to develop new forward and sidewinding behaviors in a hexapod and a 12-legged centipede. We verify our predictions using numerical and robophysical models, and obtain novel and effective locomotion behaviors.
Characterization of Constrained Continuous Multiobjective Optimization Problems: A Performance Space Perspective

Constrained multiobjective optimization has gained much interest in the past few years. However, constrained multiobjective optimization problems (CMOPs) are still unsatisfactorily understood. Consequently, the choice of adequate CMOPs for benchmarking is difficult and lacks a formal background. This paper addresses this issue by exploring CMOPs from a performance space perspective. First, it presents a novel performance assessment approach designed explicitly for constrained multiobjective optimization. This methodology offers a first attempt to simultaneously measure the performance in approximating the Pareto front and constraint satisfaction. Secondly, it proposes an approach to measure the capability of the given optimization problem to differentiate among algorithm performances. Finally, this approach is used to contrast eight frequently used artificial test suites of CMOPs. The experimental results reveal which suites are more efficient in discerning between three well-known multiobjective optimization algorithms. Benchmark designers can use these results to select the most appropriate CMOPs for their needs.
Mixture of Diffusers for scene composition and high resolution image generation

Diffusion methods have been proven to be very effective to generate images while conditioning on a text prompt. However, and although the quality of the generated images is unprecedented, these methods seem to struggle when trying to generate specific image compositions. In this paper we present Mixture of Diffusers, an algorithm that builds over existing diffusion models to provide a more detailed control over composition. By harmonizing several diffusion processes acting on different regions of a canvas, it allows generating larger images, where the location of each object and style is controlled by a separate diffusion process.
Beyond Statistical Similarity: Rethinking Metrics for Deep Generative Models in Engineering Design

Deep generative models such as Variational Autoencoders (VAEs), Generative Adversarial Networks (GANs), Diffusion Models, and Transformers, have shown great promise in a variety of applications, including image and speech synthesis, natural language processing, and drug discovery. However, when applied to engineering design problems, evaluating the performance of these models can be challenging, as traditional statistical metrics based on likelihood may not fully capture the requirements of engineering applications. This paper doubles as a review and practical guide to evaluation metrics for deep generative models (DGMs) in engineering design. We first summarize the well-accepted `classic' evaluation metrics for deep generative models grounded in machine learning theory. Using case studies, we then highlight why these metrics seldom translate well to design problems but see frequent use due to the lack of established alternatives. Next, we curate a set of design-specific metrics which have been proposed across different research communities and can be used for evaluating deep generative models. These metrics focus on unique requirements in design and engineering, such as constraint satisfaction, functional performance, novelty, and conditioning. Throughout our discussion, we apply the metrics to models trained on simple-to-visualize 2-dimensional example problems. Finally, we evaluate four deep generative models on a bicycle frame design problem and structural topology generation problem. In particular, we showcase the use of proposed metrics to quantify performance target achievement, design novelty, and geometric constraints. We publicly release the code for the datasets, models, and metrics used throughout the paper at https://decode.mit. edu/projects/metrics/.
High-Rate Point-to-Multipoint Quantum Key Distribution using Coherent States

Quantum key distribution (QKD) which enables information-theoretically security is now heading towards quantum secure networks. It requires high-performance and cost-effective protocols while increasing the number of users. Unfortunately, qubit-implemented protocols only allow one receiver to respond to the prepared signal at a time, thus cannot support multiple users natively and well satisfy the network demands. Here, we show a 'protocol solution' using continuous-variable quantum information. A coherent-state point-to-multipoint protocol is proposed to simultaneously support multiple independent QKD links between a single transmitter and massive receivers. Every prepared coherent state is measured by all receivers to generate raw keys, then processed with a secure and high-efficient key distillation method to remove the correlations between different QKD links. It can achieve remarkably high key rates even with a hundred of access points and shows the potential improvement of two orders of magnitude. This scheme is a promising step towards a high-rate multi-user solution in a scalable quantum secure network.
An Asymptotically Optimal Algorithm for the One-Dimensional Convex Hull Feasibility Problem

This work studies the pure-exploration setting for the convex hull feasibility (CHF) problem where one aims to eﬃciently and accurately determine if a given point lies in the convex hull of means of a ﬁnite set of distributions. We give a complete characterization of the sample complexity of the CHF problem in the one-dimensional setting. We present the ﬁrst asymptotically optimal algorithm called Thompson-CHF, whose modular design consists of a stopping rule and a sampling rule. In addition, we provide an extension of the algorithm that generalizes several important problems in the multi-armed bandit literature. Finally, we further investigate the Gaussian bandit case with unknown variances and address how the Thompson-CHF algorithm can be adjusted to be asymptotically optimal in this setting.
Toward a normative theory of (self-)management by goal-setting

People are often confronted with problems whose complexity exceeds their cognitive capacities. To deal with this complexity, individuals and managers can break complex problems down into a series of subgoals. Which subgoals are most effective depends on people's cognitive constraints and the cognitive mechanisms of goal pursuit. This creates an untapped opportunity to derive practical recommendations for which subgoals managers and individuals should set from cognitive models of bounded rationality. To seize this opportunity, we apply the principle of resource-rationality to formulate a mathematically precise normative theory of (self-)management by goal-setting. We leverage this theory to computationally derive optimal subgoals from a resource-rational model of human goal pursuit. Finally, we show that the resulting subgoals improve the problem-solving performance of bounded agents and human participants. This constitutes a first step towards grounding prescriptive theories of management and practical recommendations for goal-setting in computational models of the relevant psychological processes and cognitive limitations.
Droplet motion with contact-line friction: long-time asymptotics in complete wetting

We consider the thin-film equation for a class of free boundary conditions modelling friction at the contact line, as introduced by E and Ren. Our analysis focuses on formal long-time asymptotics of solutions in the perfect wetting regime. In particular, through the analysis of quasi-self-similar solutions, we characterize the profile and the spreading rate of solutions depending on the strength of friction at the contact line, as well as their (global or local) corrections, which are due to the dynamical nature of the free boundary conditions. These results are complemented with full transient numerical solutions of the free boundary problem.
Influence of real photons diffraction contribution on parametric X-ray observed characteristics

It is proposed and implemented a simple method of calculating of the output of the diffracted real photons of bremsstrahlung and transition radiation from perfect crystals of arbitrary thickness up to a primary extinction lengths. It is shown that for small thickness of crystals and observation angles concerning the center of the diffraction of reflex, contribution of diffraction of real photon is comparable with the output of parametric X-radiation. Influence of experimental equipment characteristic on observed characteristics of radiation is discussed.
CBMC: The C Bounded Model Checker

The C Bounded Model Checker (CBMC) demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loops unrolled to a given depth, into a formula. If the formula is satisfiable, then an execution leading to a violated assertion exists. CBMC is one of the most successful software verification tools. Its main advantages are its precision, robustness and simplicity. CBMC is shipped as part of several Linux distributions. It has been used by thousands of software developers to verify real-world software, such as the Linux kernel, and powers commercial software analysis and test generation tools. Table 1 gives an overview of CBMC's features. CBMC is also a versatile tool that can be applied to solve many practical program analysis problems such as bug finding, property checking, test input generation, detection of security vulnerabilities, equivalence checking and program synthesis. This chapter will give an introduction into CBMC, including practical examples and pointers to further reading. Moreover, we give insights about the development of CBMC itself, showing how its performance evolved over the last decade.
Convergence Analysis of the Deep Galerkin Method for Weak Solutions

This paper analyzes the convergence rate of a deep Galerkin method for the weak solution (DGMW) of second-order elliptic partial differential equations on $\mathbb{R}^d$ with Dirichlet, Neumann, and Robin boundary conditions, respectively. In DGMW, a deep neural network is applied to parametrize the PDE solution, and a second neural network is adopted to parametrize the test function in the traditional Galerkin formulation. By properly choosing the depth and width of these two networks in terms of the number of training samples $n$, it is shown that the convergence rate of DGMW is $\mathcal{O}(n^{-1/d})$, which is the first convergence result for weak solutions. The main idea of the proof is to divide the error of the DGMW into an approximation error and a statistical error. We derive an upper bound on the approximation error in the $H^{1}$ norm and bound the statistical error via Rademacher complexity.
DURABILITY OF MORTAR LININGS IN DUCTILE IRON PIPES

Mortar linings in ductile iron pipes for distribution of water have been investigated with respect to micro-structure, composition, durability and leach of chemical components. Scanning Electron Microscopy (SEM) and Wave Dispersive Analysis of X-ray (WDAX) have been used to study degradation of mortar linings which have been in service for 10 20 years. The same techniques have also been used to follow degradations and leaching of new mortar linings exposed to aggressive solutions in laboratory. Relatively good correlation has been found between the laboratory tests and the degradation of linings of pipes in service. Reliable methods for examination and testing of mortar linings in new pipes will definitely be a valuable implement for municipal water works to specify a wanted composition and quality of mortar linings.
On Exact Sampling in the Two-Variable Fragment of First-Order Logic

In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al.—how to efficiently sample a model of a given first-order sentence on a finite domain? We extend their result for the universally-quantified subfragment of two-variable logic FO2 (UFO2) to the entire fragment of FO2. Specifically, we prove the domain-liftability under sampling of FO2, meaning that there exists a sampling algorithm for FO2 that runs in time polynomial in the domain size. We then further show that this result continues to hold even in the presence of counting constraints, such as ∀x∃=ky : φ(x, y) and ∃=kx∀y : φ(x, y), for some quantifier-free formula φ(x, y). Our proposed method is constructive, and the resulting sampling algorithms have potential applications in various areas, including the uniform generation of combinatorial structures and sampling in statistical-relational models such as Markov logic networks and probabilistic logic programs.
Robust Subtask Learning for Compositional Generalization

Compositional reinforcement learning is a promising approach for training policies to perform complex long-horizon tasks. Typically, a high-level task is decomposed into a sequence of subtasks and a separate policy is trained to perform each subtask. In this paper, we focus on the problem of training subtask policies in a way that they can be used to perform any task; here, a task is given by a sequence of subtasks. We aim to maximize the worst-case performance over all tasks as opposed to the average-case performance. We formulate the problem as a two agent zero-sum game in which the adversary picks the sequence of subtasks. We propose two RL algorithms to solve this game: one is an adaptation of existing multi-agent RL algorithms to our setting and the other is an asynchronous version which enables parallel training of subtask policies. We evaluate our approach on two multi-task environments with continuous states and actions and demonstrate that our algorithms outperform state-of-the-art baselines.
TAP: The Attention Patch for Cross-Modal Knowledge Transfer from Unlabeled Data

This work investigates the intersection of cross-modal learning and semi-supervised learning, where we aim to improve the supervised learning performance of the primary modality by bor-rowing missing information from an unlabeled modality. We investigate this problem from a Nadaraya–Watson (NW) kernel regression perspective and show that this formulation implicitly leads to a kernelized cross-attention module. To this end, we propose The Attention Patch (TAP), a simple neural network plugin that allows data-level knowledge transfer from the unlabeled modality. We provide numerical simulations on three real-world datasets to examine each aspect of TAP and show that a TAP integration in a neural network can improve generalization performance using the unlabeled modality.
Noise Perturbation for Saliency Prediction with Psychophysical Synthetic Images

Convolutional neural networks (CNNs) have achieved great success in natural image saliency prediction. The primary goal of this study is to investigate the performance of saliency prediction in CNN and classic models with psychophysical synthetic images under noise perturbation. Is it still as decent as natural images in terms of performance? In the meantime, it can be used to investigate the relationship between CNNs and human vision, mainly low-level vision functions. On the other hand, are CNNs exact replicas of human visual function? This study used CNNs, Fourier, and spectral models inspired by low-level vision systems to investigate saliency prediction on psychophysical synthetic images rather than natural images. According to our findings, saliency prediction models inspired by Fourier and spectral theory outperformed current pre-trained deep neural networks on psychophysical images with noise perturbation. However, psychophysical models were more unstable in noise than pre-trained deep neural networks. Meanwhile, we suggested that investigating CNNs with psychophysical methods could benefit visual neuroscience and artificial neural network studies.
Crowd-sensing commuting patterns using multi-source wireless data: a case of Helsinki commuter trains

Understanding the mobility patterns of commuter train passengers is crucial for developing efficient and sustainable transportation systems in urban areas. Traditional technologies, such as Automated Passenger Counters (APC) can measure the aggregated numbers of passengers entering and exiting trains, however, they do not provide detailed information nor passenger movements beyond the train itself. To overcome this limitation we investigate the potential combination of traditional APC with an emerging source capable of collecting detailed mobility demand data. This new data source derives from the pilot project TravelSense, led by the Helsinki Regional Transport Authority (HSL), which utilizes Bluetooth beacons and HSL's mobile phone ticket application to track anonymous passenger multimodal trajectories from origin to destination. By combining TravelSense data with APC we are able to better understand the structure of train users' journeys by identifying the origin and destination locations, modes of transport used to access commuter train stations, and boarding and alighting numbers at each station. These insights can assist public transport planning decisions and ultimately help to contribute to the goal of sustainable cities and communities by promoting the use of seamless and environmentally friendly transportation options.
Online Actuator Selection and Controller Design for Linear Quadratic Regulation with Unknown System Model

We study the simultaneous actuator selection and controller design problem for linear quadratic regulation with Gaussian noise over a finite horizon of length $T$ and unknown system model. We consider both episodic and non-episodic settings of the problem and propose online algorithms that specify both the sets of actuators to be utilized under a cardinality constraint and the controls corresponding to the sets of selected actuators. In the episodic setting, the interaction with the system breaks into $N$ episodes, each of which restarts from a given initial condition and has length $T$. In the non-episodic setting, the interaction goes on continuously. Our online algorithms leverage a multiarmed bandit algorithm to select the sets of actuators and a certainty equivalence approach to design the corresponding controls. We show that our online algorithms yield $\sqrt{N}$-regret for the episodic setting and $T^{2/3}$-regret for the non-episodic setting. We extend our algorithm design and analysis to show scalability with respect to both the total number of candidate actuators and the cardinality constraint. We numerically validate our theoretical results.