Search

This paper deals with the fractional Sobolev spaces $W^{s, p}(\Omega)$, with $s\in (0, 1]$ and $p\in[1,+\infty]$. Here, we use the interpolation results in [4] to provide suitable conditions on the exponents $s$ and $p$ so that the spaces $W^{s, p}(\Omega)$ realize a continuous embedding when either $\Omega=\mathbb R^N$ or $\Omega$ is any open and bounded domain with Lipschitz boundary. Our results enhance the classical continuous embedding and, when $\Omega$ is any open bounded domain with Lipschitz boundary, we also improve the classical compact embeddings. All the results stated here are proved to be optimal. Also, our strategy does not require the use of Besov or other interpolation spaces.

Machine Translation (MT) evaluation metrics assess translation quality automatically. Recently, researchers have employed MT metrics for various new use cases, such as data filtering and translation re-ranking. However, most MT metrics return assessments as scalar scores that are difficult to interpret, posing a challenge to making informed design choices. Moreover, MT metrics' capabilities have historically been evaluated using correlation with human judgment, which, despite its efficacy, falls short of providing intuitive insights into metric performance, especially in terms of new metric use cases. To address these issues, we introduce an interpretable evaluation framework for MT metrics. Within this framework, we evaluate metrics in two scenarios that serve as proxies for the data filtering and translation re-ranking use cases. Furthermore, by measuring the performance of MT metrics using Precision, Recall, and F-score, we offer clearer insights into their capabilities than correlation with human judgments. Finally, we raise concerns regarding the reliability of manually curated data following the Direct Assessments+Scalar Quality Metrics (DA+SQM) guidelines, reporting a notably low agreement with Multidimensional Quality Metrics (MQM) annotations., Comment: Accepted at EMNLP 2024 Main Conference. 26 pages

Given $s$, $q\in(0,1)$, and a bounded and integrable function $h$ which is strictly positive in an open set, we show that there exist at least two nonnegative solutions $u$ of the critical problem $$(-\Delta)^s u=\varepsilon h(x)u^q+u^{2^*_s-1},$$ as long as $\varepsilon>0$ is sufficiently small. Also, if $h$ is nonnegative, these solutions are strictly positive. The case $s=1$ was established in [APP00], which highlighted, in the classical case, the importance of combining perturbative techniques with variational methods: indeed, one of the two solutions branches off perturbatively in $\varepsilon$ from $u=0$, while the second solution is found by means of the Mountain Pass Theorem. The case $s\in\left(0,\frac12\right]$ was already established, with different methods, in [DMV17] (actually, in [DMV17] it was erroneously believed that the method would have carried through all the fractional cases $s\in(0,1)$, so, in a sense, the results presented here correct and complete the ones in [DMV17]).

In a temporal forest each edge has an associated set of time labels that specify the time instants in which the edges are available. A temporal path from vertex $u$ to vertex $v$ in the forest is a selection of a label for each edge in the unique path from $u$ to $v$, assuming it exists, such that the labels selected for any two consecutive edges are non-decreasing. We design linear-size data structures that maintain a temporal forest of rooted trees under addition and deletion of both edge labels and singleton vertices, insertion of root-to-node edges, and removal of edges with no labels. Such data structures can answer temporal reachability, earliest arrival, and latest departure queries. All queries and updates are handled in polylogarithmic worst-case time. Our results can be adapted to deal with latencies. More precisely, all the worst-case time bounds are asymptotically unaffected when latencies are uniform. For arbitrary latencies, the update time becomes amortized in the incremental case where only label additions and edge/singleton insertions are allowed as well as in the decremental case in which only label deletions and edge/singleton removals are allowed. To the best of our knowledge, the only previously known data structure supporting temporal reachability queries is due to Brito, Albertini, Casteigts, and Traven\c{c}olo [Social Network Analysis and Mining, 2021], which can handle general temporal graphs, answers queries in logarithmic time in the worst case, but requires an amortized update time that is quadratic in the number of vertices, up to polylogarithmic factors., Comment: ISAAC 2024

We consider the continuous superposition of operators of the form \[ \iint_{[0, 1]\times (1, N)} (-\Delta)_p^s \,u\,d\mu(s,p), \] where $\mu$ denotes a signed measure over the set $[0, 1]\times (1, N)$, joined to a nonlinearity satisfying a proper subcritical growth. The novelty of the paper relies in the fact that, differently from the existing literature, the superposition occurs in both $s$ and $p$. Here we introduce a new framework which is so broad to include, for example, the scenarios of the finite sum of different (in both $s$ and $p$) Laplacians, or of a fractional $p$-Laplacian plus a $p$-Laplacian, or even combinations involving some fractional Laplacians with the "wrong" sign. The development of this new setting comes with two applications, which are related to the Weierstrass Theorem and a Mountain Pass technique. The results obtained contribute to the existing literature with several specific cases of interest which are entirely new.

Annually, at the Conference of Machine Translation (WMT), the Metrics Shared Task organizers conduct the meta-evaluation of Machine Translation (MT) metrics, ranking them according to their correlation with human judgments. Their results guide researchers toward enhancing the next generation of metrics and MT systems. With the recent introduction of neural metrics, the field has witnessed notable advancements. Nevertheless, the inherent opacity of these metrics has posed substantial challenges to the meta-evaluation process. This work highlights two issues with the meta-evaluation framework currently employed in WMT, and assesses their impact on the metrics rankings. To do this, we introduce the concept of sentinel metrics, which are designed explicitly to scrutinize the meta-evaluation process's accuracy, robustness, and fairness. By employing sentinel metrics, we aim to validate our findings, and shed light on and monitor the potential biases or inconsistencies in the rankings. We discover that the present meta-evaluation framework favors two categories of metrics: i) those explicitly trained to mimic human quality assessments, and ii) continuous metrics. Finally, we raise concerns regarding the evaluation capabilities of state-of-the-art metrics, emphasizing that they might be basing their assessments on spurious correlations found in their training data., Comment: Presented at ACL 2024 Main Conference. 29 pages

Assumption-based Argumentation (ABA) is advocated as a unifying formalism for various forms of non-monotonic reasoning, including logic programming. It allows capturing defeasible knowledge, subject to argumentative debate. While, in much existing work, ABA frameworks are given up-front, in this paper we focus on the problem of automating their learning from background knowledge and positive/negative examples. Unlike prior work, we newly frame the problem in terms of brave reasoning under stable extensions for ABA. We present a novel algorithm based on transformation rules (such as Rote Learning, Folding, Assumption Introduction and Fact Subsumption) and an implementation thereof that makes use of Answer Set Programming. Finally, we compare our technique to state-of-the-art ILP systems that learn defeasible knowledge., Comment: Extended version of the paper published in: Proceedings 27th European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, Volume 392: ECAI 2024, pp. 3445 - 3452. DOI: 10.3233/FAIA240896

Catamorphisms are functions that are recursively defined on list and trees and, in general, on Algebraic Data Types (ADTs), and are often used to compute suitable abstractions of programs that manipulate ADTs. Examples of catamorphisms include functions that compute size of lists, orderedness of lists, and height of trees. It is well known that program properties specified through catamorphisms can be proved by showing the satisfiability of suitable sets of Constrained Horn Clauses (CHCs). We address the problem of checking the satisfiability of those sets of CHCs, and we propose a method for transforming sets of CHCs into equisatisfiable sets where catamorphisms are no longer present. As a consequence, clauses with catamorphisms can be handled without extending the satisfiability algorithms used by existing CHC solvers. Through an experimental evaluation on a non-trivial benchmark consisting of many list and tree processing algorithms expressed as sets of CHCs, we show that our technique is indeed effective and significantly enhances the performance of state-of-the-art CHC solvers., Comment: Under consideration in Theory and Practice of Logic Programming (TPLP)

$^3$He spin-dependent structure functions, $g^3_1(x)$ and $g^3_2(x)$, which parametrize the hadronic tensor in polarized deep-inelastic scattering, were evaluated within the Poincar\'e covariant light-front framework. The Bakamjian-Thomas construction of the Poincar\'e generators allows us to make use of a realistic $^3$He wave function, obtained from refined nuclear phenomenological potentials. The same approach was already successfully applied to the $^3$He and $^4$He unpolarized deep-inelastic scattering. To investigate the neutron polarized structure functions, $g^n_1$ and $g^n_2$, a readily implementable procedure, aimed at extracting the neutron spin structure functions from those of $^3$He, is shown to hold. Moreover, the first moment of $g^3_1(x)$ was evaluated, aiming at providing a valuable check of the Bjorken sum rule. The present analysis is relevant for experiments nvolving polarized beams planned at the future facilities, like the Electron Ion Colliders., Comment: 13 pages, 7 figures

We discuss the existence theory of a nonlinear problem of nonlocal type subject to Neumann boundary conditions. Differently from the existing literature, the elliptic operator under consideration is obtained as a superposition of operators of mixed order. The setting that we introduce is very general and comprises, for instance, the sum of two fractional Laplacians, or of a fractional Laplacian and a Laplacian, as particular cases (the situation in which there are infinitely many operators, and even a continuous distribution of operators, can be considered as well). New bits of functional analysis are introduced to deal with this problem. An eigenvalue analysis divides the existence theory into two streams, one related to a Mountain Pass method, the other to a Linking technique.

We present a new functional setting for Neumann conditions related to the superposition of (possibly infinitely many) fractional Laplace operators. We will introduce some bespoke functional framework and present minimization properties, existence and uniqueness results, asymptotic formulas, spectral analyses, rigidity results, integration by parts formulas, superpositions of fractional perimeters, as well as a study of the associated heat equation., Comment: 42 pages, 2 figures

This white paper outlines a long-term scientific vision for the development of digital-democracy technology. We contend that if digital democracy is to meet the ambition of enabling a participatory renewal in our societies, then a comprehensive multi-methods research effort is required that could, over the years, support its development in a democratically principled, empirically and computationally informed way. The paper is co-authored by an international and interdisciplinary team of researchers and arose from the Lorentz Center Workshop on ``Algorithmic Technology for Democracy'' (Leiden, October 2022).

The Hofstadter model allows to describe and understand several phenomena in condensed matter such as the quantum Hall effect, Anderson localization, charge pumping, and flat-bands in quasiperiodic structures, and is a rare example of fractality in the quantum world. An apparently unrelated system, the relativistic Toda lattice, has been extensively studied in the context of complex nonlinear dynamics, and more recently for its connection to supersymmetric Yang-Mills theories and topological string theories on Calabi-Yau manifolds in high-energy physics. Here we discuss a recently discovered spectral relationship between the Hofstadter model and the relativistic Toda lattice which has been later conjectured to be related to the Langlands duality of quantum groups. Moreover, by employing similarity transformations compatible with the quantum group structure, we establish a formula parametrizing the energy spectrum of the Hofstadter model in terms of elementary symmetric polynomials and Chebyshev polynomials. The main tools used are the spectral duality of tridiagonal matrices and the representation theory of the elementary quantum group., Comment: Accepted on Journal of Mathematical Physics, 15 pages, no figures, reference added

The field of plasmonics is capable of enabling interesting applications in the different wavelength ranges, spanning from the ultraviolet up to the infrared. The choice of plasmonic material and how the material is nanostructured have significant implications for ultimate performance of any plasmonic device. Artificially designed nanoporous metals have interesting material properties including large specific surface area, distinctive optical properties, high electrical conductivity, and reduced stiffness, implying their potentials for many applications. This manuscript reviews the wide range of available nanoporous metals, mainly focusing on their properties as plasmonic materials. While extensive reports on the use and characterization of NPMs exist, a detailed discussion on their connection with surface plasmons and enhanced spectroscopies as well as photocatalysis is missing. Here, we report on different metals investigated, from the most used nanoporous gold to mixed metal compounds, and discuss each of these plasmonic materials suitability for a range of structural design and applications. Finally, we discuss the potentials and limitations of the traditional and alternative plasmonic materials for applications in enhanced spectroscopy and photocatalysis.

Neurological disorders, including stroke, spinal cord injuries, multiple sclerosis, and Parkinson's disease, generally lead to diminished upper extremity (UE) function, impacting individuals' independence and quality of life. Traditional assessments predominantly focus on standardized clinical tasks, offering limited insights into real-life UE performance. In this context, this review focuses on wearable technologies as a promising solution to monitor UE function in neurologically impaired individuals during daily life activities. Our primary objective is to categorize the different sensors, review the data collection and understand the employed data processing approaches. After screening over 1500 papers and including 21 studies, what comes to light is that the majority of them involved stroke survivors, and predominantly employed accelerometers or inertial measurement units to collect kinematics. Most analyses in these studies were performed offline, focusing on activity duration and frequency as key metrics. Although wearable technology shows potential in monitoring UE function in real-life scenarios, it also appears that a solution combining non-intrusiveness, lightweight design, detailed hand and finger movement capture, contextual information, extended recording duration, ease of use, and privacy protection remains an elusive goal. These are critical characteristics for a monitoring solution and researchers in the field should try to integrate the most in future developments. Last but not least, it stands out a growing necessity for a multimodal approach in capturing comprehensive data on UE function during real-life activities to enhance the personalization of rehabilitation strategies and ultimately improve outcomes for these individuals., Comment: IEEE Transactions on Neural Systems and Rehabilitation Engineering, 2024

Quantum computers are inherently affected by noise. While in the long-term error correction codes will account for noise at the cost of increasing physical qubits, in the near-term the performance of any quantum algorithm should be tested and simulated in the presence of noise. As noise acts on the hardware, the classical simulation of a quantum algorithm should not be agnostic on the platform used for the computation. In this work, we apply the recently proposed noisy gates approach to efficiently simulate noisy optical circuits described in the dual rail framework. The evolution of the state vector is simulated directly, without requiring the mapping to the density matrix framework. Notably, we test the method on both the gate-based and measurement-based quantum computing models, showing that the approach is very versatile. We also evaluate the performance of a photonic variational quantum algorithm to solve the MAX-2-CUT problem. In particular we design and simulate an ansatz which is resilient to photon losses up to $p \sim 10^{-3}$ making it relevant for near term applications.

We consider the homology theory of \'etale groupoids introduced by Crainic and Moerdijk, with particular interest to groupoids arising from topological dynamical systems. We prove a K\"unneth formula for products of groupoids and a Poincar\'e-duality type result for groupoids which are principal with orbits homeomorphic to a Euclidean space. We conclude with a few example computations for systems associated to nilpotent groups such as self-similar actions, and we generalize previous homological calculations by Burke and Putnam for systems which are analogues of solenoids arising from algebraic numbers. For the latter systems, we prove the HK conjecture, even when the resulting groupoid is not ample., Comment: splitting off part of arXiv:2207.03118 as a separate paper