Search

This article introduces a groundbreaking analytical workflow designed for the holistic characterisation, modelling and physical simulation of device heterostructures. Our innovative workflow autonomously, comprehensively and locally characterises the crystallographic information and 3D orientation of the crystal phases, the elemental composition, and the strain maps of devices from (scanning) transmission electron microscopy data. It converts a manual characterisation process that traditionally takes days into an automatic routine completed in minutes. This is achieved through a physics-guided artificial intelligence model that combines unsupervised and supervised machine learning in a modular way to provide a representative 3D description of the devices, materials structures, or samples under analysis. To culminate the process, we integrate the extracted knowledge to automate the generation of both 3D finite element and atomic models of millions of atoms acting as digital twins, enabling simulations that yield essential physical and chemical insights crucial for understanding the device's behaviour in practical applications. We prove this end-to-end workflow with a state-of-the-art materials platform based on SiGe planar heterostructures for hosting coherent and scalable spin qubits. Our workflow connects representative digital twins of the experimental devices with their theoretical properties to reveal the true impact that every atom in the structure has on their electronic properties, and eventually, into their functional quantum performance. Notably, the versatility of our workflow is demonstrated through its successful application to a wide array of materials systems, device configurations and sample morphologies.

Motivated by the three-dimensional structure of Kitaev materials we explore multilayer Kitaev models. The magnetic properties of a multilayer of an arbitrary number of Kitaev honeycomb layers stacked on top of each other coupled through a Heisenberg interaction, J, is analyzed through Abrikosov fermion mean-field theory. The system sustains quantum spin liquid (QSL) solutions which have different character depending on parity of the number of layers. While in even layered Kitaev models a gapped QSL emerges, odd-layered models host gapless QSLs. The projective symmetry group analysis of these solutions unravel a layer-to-layer inversion symmetry rather than an expected reflection. Although these QSLs retain features of the single layer Kitaev spin liquid (KSL), they should be regarded hybrid QSLs consisting on several KSLs. The good agreement at large-J between the energy of the Gutzwiller projected mean-field QSL and the exact energy indicates that such QSL Ansatz is adiabatically connected to the exact ground state. We also find that the Kitaev gapped chiral quantum spin liquid induced by external magnetic fields is stabilized by an antiferromagnetic interlayer coupling. Our results are relevant to the physics of alpha-RuCl3 and H3LiIr2O6 which are examples of magnetically coupled multilayer Kitaev models., Comment: 16 pages, 8 figures

Dealing with boundary conditions in Smoothed Particle Hydrodynamics (SPH) poses significant difficulties, indeed being one of the SPHERIC Grand Challenges. In particular, wall boundary conditions have been pivotal in SPH model development since it evolved from astrophysics to more generic fluid dynamics simulations. Despite considerable attention from researchers and numerous publications dedicated to formulating and assessing wall boundary conditions, few of them have addressed the crucial aspect of energy conservation. This work introduces a novel boundary condition designed with energy conservation as a primary consideration, effectively extending the unconditional stability of SPH to problems involving wall boundary conditions. The result is formulated within the framework of the Boundary Integrals technique. The proposal is tested on a number of cases: normal impact against a wall, adiabatic oscillations of a piston, dam break, and the water landing of a spacecraft., Comment: 35 pages, 25 figures. SPH solver released as free software (see https://gitlab.com/sanguinariojoe/aquagpusph). Accepted for publication on "Computers & Fluids"

Elongated particles in dense systems often exhibit alignment due to volume exclusion interactions, leading to packing configurations. Traditional models of collective dynamics typically impose this alignment phenomenologically, neglecting the influence of volume exclusion on particle positions. In this paper, we derive nematic alignment from an anisotropic repulsive potential, focusing on a Gaussian-type potential and first-order dynamics for the particles. By analyzing larger particle systems and performing a hydrodynamic limit, we uncover the effects of anisotropy on both particle density and direction. Our findings reveal that while particle density evolves independently of direction, anisotropy slows down nonlinear diffusion. The direction dynamics are affected by the particles' position and involve complex transport and diffusion processes, with different behaviors for oblate and prolate particles. The key to obtaining these results lies in recent advancements in Generalized Collision Invariants offered by Degond, Frouvelle and Liu (KRM 2022)., Comment: 42 pages, 10 figures

We present the results from spectroscopic and photometric analysis of 17 globular cluster (GC) candidates in the Irr II galaxy NGC 3077. The GC candidates were selected on the Hubble Space Telescope (HST) images and were cleaned of foreground Galactic stars using the GAIA parameters. We carried out aperture photometry using the multi-band archival images from SDSS, and 2MASS of all candidates, and low resolution (R= 1000) spectroscopic observations of 12 GC candidates and three suspected foreground stars using the OSIRIS/MOS mode at the Gran Telescopio Canarias (GTC). Age, metallicity and extinction values were determined both using spectroscopic and photometric data, independently. We find three of the 17 candidates are old (age >10 Gyr), metal-poor ([Fe/H]<-1.0 dex), massive (mass>10^5 Msun) GCs with characteristics similar to the classical GCs in the Milky Way. The rest are intermediate-age clusters (IACs) with typical ages of 3 to 4 Gyr, and in general metal-rich clusters. The radial velocities of both populations are within 100 km/s of the recessional velocity of the host galaxy. A relatively large population of IACs and low value of GC specific frequency (Sn=0.7) suggest that the pre-interaction galaxy was actively forming stars and star clusters, and is unlikely to be a dE as suggested in some previous works., Comment: Accepted in Astronomical Journal

Continuous glucose monitoring (CGM) data has revolutionized the management of type 1 diabetes, particularly when integrated with insulin pumps to mitigate clinical events such as hypoglycemia. Recently, there has been growing interest in utilizing CGM devices in clinical studies involving healthy and diabetes populations. However, efficiently exploiting the high temporal resolution of CGM profiles remains a significant challenge. Numerous indices -- such as time-in-range metrics and glucose variability measures -- have been proposed, but evidence suggests these metrics overlook critical aspects of glucose dynamic homeostasis. As an alternative method, this paper explores the clinical value of glucodensity metrics in capturing glucose dynamics -- specifically the speed and acceleration of CGM time series -- as new biomarkers for predicting long-term glucose outcomes. Our results demonstrate significant information gains, exceeding 20\% in terms of adjusted $R^2$, in forecasting glycosylated hemoglobin (HbA1c) and fasting plasma glucose (FPG) at five and eight years from baseline AEGIS data, compared to traditional non-CGM and CGM glucose biomarkers. These findings underscore the importance of incorporating more complex CGM functional metrics, such as the glucodensity approach, to fully capture continuous glucose fluctuations across different time-scale resolutions.

Impartial selection problems are concerned with the selection of one or more agents from a set based on mutual nominations from within the set. To avoid strategic nominations of the agents, the axiom of impartiality requires that the selection of each agent is independent of the nominations cast by that agent. This paper initiates the study of impartial selection problems where the nominations are weighted and the set of agents that can be selected is restricted by a combinatorial constraint. We call a selection mechanism $\alpha$-optimal if, for every instance, the ratio between the total sum of weighted nominations of the selected set and that of the best feasible set of agents is at least $\alpha$. We show that a natural extension of a mechanism studied for the selection of a single agent remains impartial and $\frac{1}{4}$-optimal for general independence systems, and we generalize upper bounds from the selection of multiple agents by parameterizing them by the girth of the independence system. We then focus on independence systems defined by knapsack and matroid constraints, giving impartial mechanisms that exploit a greedy order of the agents and achieve approximation ratios of $\frac{1}{3}$ and $\frac{1}{2}$, respectively, when agents cast a single nomination. For graphic matroids, we further devise an impartial and $\frac{1}{3}$-optimal mechanism for an arbitrary number of unweighted nominations.

This paper examines the development of the Artificial Intelligence (AI) meta-debate in Sweden before and after the release of ChatGPT. From the perspective of agenda-setting theory, we propose that it is an elite outside of party politics that is leading the debate -- i.e. that the politicians are relatively silent when it comes to this rapid development. We also suggest that the debate has become more substantive and risk-oriented in recent years. To investigate this claim, we draw on an original dataset of elite-level documents from the early 2010s to the present, using op-eds published in a number of leading Swedish newspapers. By conducting a qualitative content analysis of these materials, our preliminary findings lend support to the expectation that an academic, rather than a political elite is steering the debate., Comment: This paper is part of the Second AEQUITAS Workshop on Fairness and Bias in AI | co-located with ECAI 2024, October 19--24, 2024, Santiago de Compostela, Spain

We provide a cyclone model for dynamical simulations in the pyro-process of cement production. The model is given as an index-1 differential-algebraic equation (DAE) model based on first engineering principle. Using a systematic approach, the model integrates cyclone geometry, thermo-physical aspects, stoichiometry and kinetics, mass and energy balances, and algebraic equations for volume and internal energy. The paper provides simulation results that fit expected dynamics. The cyclone model is part of an overall model for dynamical simulations of the pyro-process in a cement plant. This model can be used in the design of control and optimization systems to improve energy efficiency and reduce CO2 emission., Comment: 7 pages, 6 figures, 8 Tables

The topics of interest are location analysis and related problems. This includes location models, networks, transportation, logistics, exact and heuristic solution methods, and computational geometry, among many others., Comment: The proceedings book of the previous editions can be found at arXiv:2002.08287 arXiv:2002.08293 arXiv:2002.08300 arXiv:2002.01702 arXiv:2202.13878 . arXiv:2309.08337 . The XIII International Workshop on Locational Analysis and Related Problems will take place during September 4--6, 2024 in Granada (Spain). It is organized by the Spanish Location Network, REDLOCA, and the Location Group, GELOCA, from the Spanish Society of Statistics and Operations Research (SEIO). The Spanish Location Network is a group of 100+ researchers from several Spanish universities organized into 7 thematic groups. The Network has been funded by the Spanish Government since 2003

We present a 2D model for a grate belt cooler in the pyro-section of a cement plant. The model is formulated as an index-1 differential-algebraic equation (DAE) model based on first engineering principles. The model systematically integrates thermo-physical aspects, transport phenomena, reaction kinetics, mass and energy balances, and algebraic volume and energy relations. The model is used for dynamic simulation of the cooler and the paper provides dynamic and steady-state simulation results matching the expected behavior. The cooler model is one part of a full pyro-section model for dynamical simulations. The model can serve as a basis for the design of optimization and control systems towards improving energy efficiency and CO2 emission., Comment: 7 pages, 6 figures, 4 tables

Large Language Models (LLMs) have been profusely evaluated on their ability to answer questions on many topics and their performance on different natural language understanding tasks. Those tests are usually conducted in English, but most LLM users are not native English speakers. Therefore, it is of interest to analyze how LLMs understand other languages at different levels: from paragraphs to morphems. In this paper, we evaluate the performance of state-of-the-art LLMs in TELEIA, a recently released benchmark with similar questions to those of Spanish exams for foreign students, covering topics such as reading comprehension, word formation, meaning and compositional semantics, and grammar. The results show that LLMs perform well at understanding Spanish but are still far from achieving the level of a native speaker in terms of grammatical competence.

Fast and accurate detection of light in the near-infrared (NIR) spectral range plays a crucial role in modern society, from alleviating speed and capacity bottlenecks in optical communications to enhancing the control and safety of autonomous vehicles through NIR imaging systems. Several technological platforms are currently under investigation to improve NIR photodetection, aiming to surpass the performance of established III-V semiconductor p-i-n (PIN) junction technology. These platforms include in situ-grown inorganic nanocrystals and nanowire arrays, as well as hybrid organic-inorganic materials such as graphene-perovskite heterostructures. However, challenges remain in nanocrystal and nanowire growth, large-area fabrication of high-quality 2D materials, and the fabrication of devices for practical applications. Here, we explore the potential for tailored semiconductor nanocrystals to enhance the responsivity of planar metal-semiconductor-metal (MSM) photodetectors. MSM technology offers ease of fabrication and fast response times compared to PIN detectors. We observe enhancement of the optical-to-electric conversion efficiency by up to a factor of ~2.5 through the application of plasmonically-active semiconductor nanorods and nanocrystals. We present a protocol for synthesizing and rapidly testing the performance of non-stoichiometric tungsten oxide (WO$_{3-x}$) nanorods and cesium-doped tungsten oxide (Cs$_y$WO$_{3-x}$) hexagonal nanoprisms prepared in colloidal suspensions and drop-cast onto photodetector surfaces. The results demonstrate the potential for a cost-effective and scalable method exploiting tailored nanocrystals to improve the performance of NIR optoelectronic devices.

Procedural Content Generation via Machine Learning (PCGML) has enhanced game content creation, yet challenges in controllability and limited training data persist. This study addresses these issues by distilling a constructive PCG algorithm into a controllable PCGML model. We first generate a large amount of content with a constructive algorithm and label it using a Large Language Model (LLM). We use these synthetic labels to condition two PCGML models for content-specific generation, a diffusion model and the five-dollar model. This neural network distillation process ensures that the generation aligns with the original algorithm while introducing controllability through plain text. We define this text-conditioned PCGML as a Text-to-game-Map (T2M) task, offering an alternative to prevalent text-to-image multi-modal tasks. We compare our distilled models with the baseline constructive algorithm. Our analysis of the variety, accuracy, and quality of our generation demonstrates the efficacy of distilling constructive methods into controllable text-conditioned PCGML models.

The weighted transition polynomial of a multimatroid is a generalization of the Tutte polynomial. By defining the activity of a skew class with respect to a basis in a multimatroid, we obtain an activities expansion for the weighted transition polynomial. We also decompose the set of all transversals of a multimatroid as a union of subsets of transversals. Each term in the decomposition has the structure of a boolean lattice, and each transversal belongs to a number of terms depending only on the sizes of some of its skew classes. Further expressions for the transition polynomial of a multimatroid are obtained via an equivalence relation on its bases and by extending Kochol's theory of compatible sets. We apply our multimatroid results to obtain a result of Morse about the transition polynomial of a delta-matroid and get a partition of the boolean lattice of subsets of elements of a delta-matroid determined by the feasible sets. Finally, we describe how multimatroids arise from graphs embedded in surfaces and apply our results to obtain an activities expansion for the topological transition polynomial. Our work extends results for the Tutte polynomial of a matroid.

We propose a novel randomization approach for randomized controlled trials (RCTs), named the cube method. The cube method allows for the selection of balanced samples across various covariate types, ensuring consistent adherence to balance tests and, whence, substantial precision gains when estimating treatment effects. We establish several statistical properties for the population and sample average treatment effects (PATE and SATE, respectively) under randomization using the cube method. The relevance of the cube method is particularly striking when comparing the behavior of prevailing methods employed for treatment allocation when the number of covariates to balance is increasing. We formally derive and compare bounds of balancing adjustments depending on the number of units $n$ and the number of covariates $p$ and show that our randomization approach outperforms methods proposed in the literature when $p$ is large and $p/n$ tends to 0. We run simulation studies to illustrate the substantial gains from the cube method for a large set of covariates., Comment: 62 pages (appendix starting at p.41), 3 figures

The Connections puzzle is a word association game published daily by The New York Times (NYT). In this game, players are asked to find groups of four words that are connected by a common theme. While solving a given Connections puzzle requires both semantic knowledge and abstract reasoning, generating novel puzzles additionally requires a form of metacognition: generators must be able to accurately model the downstream reasoning of potential solvers. In this paper, we investigate the ability of the GPT family of Large Language Models (LLMs) to generate challenging and creative word games for human players. We start with an analysis of the word game Connections and the unique challenges it poses as a Procedural Content Generation (PCG) domain. We then propose a method for generating Connections puzzles using LLMs by adapting a Tree of Thoughts (ToT) prompting approach. We evaluate this method by conducting a user study, asking human players to compare AI-generated puzzles against published Connections puzzles. Our findings show that LLMs are capable puzzle creators, and can generate diverse sets of enjoyable, challenging, and creative Connections puzzles as judged by human users.

Generative Artificial Intelligence image models have achieved outstanding performance in text-to-image generation and other tasks, such as inpainting that completes images with missing fragments. The performance of inpainting can be accurately measured by taking an image, removing some fragments, performing the inpainting to restore them, and comparing the results with the original image. Interestingly, inpainting can also be applied recursively, starting from an image, removing some parts, applying inpainting to reconstruct the image, and then starting the inpainting process again on the reconstructed image, and so forth. This process of recursively applying inpainting can lead to an image that is similar or completely different from the original one, depending on the fragments that are removed and the ability of the model to reconstruct them. Intuitively, stability, understood as the capability to recover an image that is similar to the original one even after many recursive inpainting operations, is a desirable feature and can be used as an additional performance metric for inpainting. The concept of stability is also being studied in the context of recursive training of generative AI models with their own data. Recursive inpainting is an inference-only recursive process whose understanding may complement ongoing efforts to study the behavior of generative AI models under training recursion. In this paper, the impact of recursive inpainting is studied for one of the most widely used image models: Stable Diffusion. The results show that recursive inpainting can lead to image collapse, so ending with a nonmeaningful image, and that the outcome depends on several factors such as the type of image, the size of the inpainting masks, and the number of iterations.

Orthogonal arrays play a fundamental role in many applications. However, constructing orthogonal arrays with the required parameters for an application usually is extremely difficult and, sometimes, even impossible. Hence there is an increasing need for a relaxation of orthogonal arrays to allow a wider flexibility. The latter has lead to various types of arrays under the name of ``nearly-orthogonal arrays'', and less often ``almost orthogonal arrays''. The aim of this paper is twofold. On the one hand, we review all the existing relaxations, comparing and discussing them in depth. On the other hand, we explore how to find almost orthogonal arrays three ways: using integer programming, local search meta-heuristics and algebraic methods. We compare all our search results with the ones existing in the literature, and we show that they are competitive, improving some of the existing arrays for many non-orthogonality measures. All our found almost orthogonal arrays are available at a public repository., Comment: 59 pages

In this work we performed numerical simulations for the Ising model on three dimensional lattices with coordination number equal 5. With Monte Carlo simulations in the static case we evaluated the critical temperature and the static critical exponents $\nu$, $\gamma$ and $\beta$. Once that we have the critical temperature value we investigated the dynamical critical behavior with Glauber dynamics, starting from disordered states. From our simulations we obtained the values for the dynamic exponent $z=2.037(8)$, the exponent for the autocorrelation $\lambda/z=1.364(5)$, the exponent of the critical initial increase $\theta'=0.109(8)$ and the asymptotic value of the fluctuation-dissipation ratio $X^\infty=0.433(1)$. All of these results are in good agreement to the previous values reported for the 3D Ising model universality class., Comment: 7 pages, 8 figures

We consider Abelson's model for opinion dynamics, where individuals interact if they are connected via a fixed network. Our aim is to develop a continuous description for these dynamics that captures well the global dynamics when the number of individuals grows to infinity. We aim at having a simple continuum description on which computations and comparison with the discrete dynamics are feasible. The difficulty lies in the network of connections being described through the labeling of the individuals: this makes the system not amenable to standard mean-field limits. We overcome this difficulty by introducing an evolving label-free network description. We compare the discrete model considered, and the continuum model proposed in the case of consensus dynamics, and carry out simulations for a system with three communities. Moreover, we propose extensions of the model to incorporate phenomena like creation and destruction of connections (dynamical networks), noise, and directional networks.

Motivated by the possibility of finding a bosonic quantum spin liquid in the integer spin-$S$ Heisenberg-Kitaev model on the honeycomb lattice, we derive a Schwinger boson mean field theory involving both singlet and triplet pairing channels which includes hopping and pairing operators on equal footing. The mixed construction introduced here is justified by the good comparison with exact diagonalization energies of the $S \leq 3/2$ Heisenberg-Kitaev model and the perfect match with the Luttinger-Tisza semiclassical energies obtained at large-$S$. We find various competing gapped quantum spin liquids close to the Kitaev point. A comparison of their spin excitation spectrum with the dynamical structure factor obtained from exact diagonalizations allows us to identify the physical spin liquid $ans\"atz$ of the model. In particular, we identify a chiral quantum spin liquid state whose spin excitation spectrum follows closely the exact diagonalization data and survives up to large spin $S \lesssim 2$. We propose this state as a promising quantum spin liquid candidate for the integer spin-$S$ antiferromagnetic Kitaev model which may be realized in $S=1$ Kitaev materials A$_3$Ni$_2$XO$_6$ and KNiAsO$_4$., Comment: 13 pages, 11 figures

This study provides a systematic description and results of a dynamical simulation model of a rotary kiln for clinker, based on first engineering principles. The model is built upon thermophysical, chemical, and transportation models for both the formation of clinker phases and fuel combustion in the kiln. The model is presented as a 1D model with counter-flow between gas and clinker phases and is demonstrated by a simulation using industrially relevant input. An advantage of the proposed model is that it provides the evolution of the individual compounds for both the fuel and clinker. As such, the model comprises a stepping stone for evaluating the development of process control systems for existing cement plants., Comment: 7 pages, 6 figures, 5 tables, Accepted for European Control Conference 2024

We show that all invertible $n \times n$ matrices over any finite field $\mathbb{F}_q$ can be generated in a Gray code fashion. More specifically, there exists a listing such that (1) each matrix appears exactly once, and (2) two consecutive matrices differ by adding or subtracting one row from a previous or subsequent row, or by multiplying or diving a row by the generator of the multiplicative group of $\mathbb{F}_q$. This even holds if the addition and subtraction of each row is allowed to some specific rows satisfying a certain mild condition. Moreover, we can prescribe the first and the last matrix if $n\ge 3$, or $n=2$ and $q>2$. In other words, the corresponding flip graph on all invertible $n \times n$ matrices over $\mathbb{F}_q$ is Hamilton connected if it is not a cycle. This solves yet another special case of Lov\'{a}sz conjecture on Hamiltonicity of vertex-transitive graphs., Comment: 23 pages, 7 figures, extended abstract in ISAAC 2024

Atomically precise graphene nanoribbons (GNRs) have a wide range of electronic properties that depend sensitively on their chemical structure. Several types of GNRs have been synthesized on metal surfaces through selective surface-catalyzed reactions. The resulting GNRs are adsorbed on the metal surface, which may lead to hybridization between the GNR orbitals and those of the substrate. This makes investigation of the intrinsic electronic properties of GNRs more difficult, and also rules out capacitive gating. Here we demonstrate the formation of a dielectric gold chloride adlayer that can intercalate underneath GNRs on the Au(111) surface. The intercalated gold chloride adlayer electronically decouples the GNRs from the metal and leads to a substantial hole doping of the GNRs. Our results introduce an easily accessible tool in the in situ characterization of GNRs grown on Au(111) that allows for exploration of their electronic properties in a heavily hole-doped regime., Comment: Supporting information follows the main text in the same file

We study set selection problems where the weights are uncertain. Instead of its exact weight, only an uncertainty interval containing its true weight is available for each element. In some cases, some solutions are universally optimal; i.e., they are optimal for every weight that lies within the uncertainty intervals. However, it may be that no universal optimal solution exists, unless we are revealed additional information on the precise values of some elements. In the minimum cost admissible query problem, we are tasked to (non-adaptively) find a minimum-cost subset of elements that, no matter how they are revealed, guarantee the existence of a universally optimal solution. We introduce thresholds under uncertainty to analyze problems of minimum cost admissible queries. Roughly speaking, for every element e, there is a threshold for its weight, below which e is included in all optimal solutions and a second threshold above which e is excluded from all optimal solutions. We show that computing thresholds and finding minimum cost admissible queries are essentially equivalent problems. Thus, the analysis of the minimum admissible query problem reduces to the problem of computing thresholds. We provide efficient algorithms for computing thresholds in the settings of minimum spanning trees, matroids, and matchings in trees; and NP-hardness results in the settings of s-t shortest paths and bipartite matching. By making use of the equivalence between the two problems these results translate into efficient algorithms for minimum cost admissible queries in the settings of minimum spanning trees, matroids, and matchings in trees; and NP-hardness results in the settings of s-t shortest paths and bipartite matching.

Human-aware navigation is a complex task for mobile robots, requiring an autonomous navigation system capable of achieving efficient path planning together with socially compliant behaviors. Social planners usually add costs or constraints to the objective function, leading to intricate tuning processes or tailoring the solution to the specific social scenario. Machine Learning can enhance planners' versatility and help them learn complex social behaviors from data. This work proposes an adaptive social planner, using a Deep Reinforcement Learning agent to dynamically adjust the weighting parameters of the cost function used to evaluate trajectories. The resulting planner combines the robustness of the classic Dynamic Window Approach, integrated with a social cost based on the Social Force Model, and the flexibility of learning methods to boost the overall performance on social navigation tasks. Our extensive experimentation on different environments demonstrates the general advantage of the proposed method over static cost planners.

Online voting is attractive for convenience and accessibility, but is more susceptible to voter coercion and vote buying than in-person voting. One mitigation is to give voters fake voting credentials that they can yield to a coercer. Fake credentials appear identical to real ones, but cast votes that are silently omitted from the final tally. An important unanswered question is how ordinary voters perceive such a mitigation: whether they could understand and use fake credentials, and whether the coercion risks justify the costs of mitigation. We present the first systematic study of these questions, involving 150 diverse individuals in Boston, Massachusetts. All participants "registered" and "voted" in a mock election: 120 were exposed to coercion resistance via fake credentials, the rest forming a control group. Of the 120 participants exposed to fake credentials, 96% understood their use. 53% reported that they would create fake credentials in a real-world voting scenario, given the opportunity. 10% mistakenly voted with a fake credential, however. 22% reported either personal experience with or direct knowledge of coercion or vote-buying incidents. These latter participants rated the coercion-resistant system essentially as trustworthy as in-person voting via hand-marked paper ballots. Of the 150 total participants to use the system, 87% successfully created their credentials without assistance; 83% both successfully created and properly used their credentials. Participants give a System Usability Scale score of 70.4, which is slightly above the industry's average score of 68. Our findings appear to support the importance of the coercion problem in general, and the promise of fake credentials as a possible mitigation, but user error rates remain an important usability challenge for future work., Comment: 23 pages, 2024 IEEE Symposium on Security and Privacy

The Connections puzzle published each day by the New York Times tasks players with dividing a bank of sixteen words into four groups of four words that each relate to a common theme. Solving the puzzle requires both common linguistic knowledge (i.e. definitions and typical usage) as well as, in many cases, lateral or abstract thinking. This is because the four categories ascend in complexity, with the most challenging category often requiring thinking about words in uncommon ways or as parts of larger phrases. We investigate the capacity for automated AI systems to play Connections and explore the game's potential as an automated benchmark for abstract reasoning and a way to measure the semantic information encoded by data-driven linguistic systems. In particular, we study both a sentence-embedding baseline and modern large language models (LLMs). We report their accuracy on the task, measure the impacts of chain-of-thought prompting, and discuss their failure modes. Overall, we find that the Connections task is challenging yet feasible, and a strong test-bed for future work., Comment: 8 pages, 3 figures

The ARS 548 RDI Radar is a premium model of the fifth generation of 77 GHz long range radar sensors with new RF antenna arrays, which offer digital beam forming. This radar measures independently the distance, speed and angle of objects without any reflectors in one measurement cycle based on Pulse Compression with New Frequency Modulation. Unfortunately, to the best of our knowledge, there are no open source drivers available for Linux systems to enable users to analyze the data acquired by the sensor. In this paper, we present a driver that can interpret the data from the ARS 548 RDI sensor and make it available over the Robot Operating System versions 1 and 2 (ROS and ROS2). Thus, these data can be stored, represented, and analyzed using the powerful tools offered by ROS. Besides, our driver offers advanced object features provided by the sensor, such as relative estimated velocity and acceleration of each object, its orientation and angular velocity. We focus on the configuration of the sensor and the use of our driver including its filtering and representation tools. Besides, we offer a video tutorial to help in its configuration process. Finally, a dataset acquired with this sensor and an Ouster OS1-32 LiDAR sensor, to have baseline measurements, is available, so that the user can check the correctness of our driver., Comment: 19 pages, 6 figures and 22 references

Mid-infrared emission features probe the properties of ionized gas, and hot or warm molecular gas. The Orion Bar is a frequently studied photodissociation region (PDR) containing large amounts of gas under these conditions, and was observed with the MIRI IFU aboard JWST as part of the "PDRs4All" program. The resulting IR spectroscopic images of high angular resolution (0.2") reveal a rich observational inventory of mid-IR emission lines, and spatially resolve the substructure of the PDR, with a mosaic cutting perpendicularly across the ionization front and three dissociation fronts. We extracted five spectra that represent the ionized, atomic, and molecular gas layers, and measured the most prominent gas emission lines. An initial analysis summarizes the physical conditions of the gas and the potential of these data. We identified around 100 lines, report an additional 18 lines that remain unidentified, and measured the line intensities and central wavelengths. The H I recombination lines originating from the ionized gas layer bordering the PDR, have intensity ratios that are well matched by emissivity coefficients from H recombination theory, but deviate up to 10% due contamination by He I lines. We report the observed emission lines of various ionization stages of Ne, P, S, Cl, Ar, Fe, and Ni, and show how certain line ratios vary between the five regions. We observe the pure-rotational H$_2$ lines in the vibrational ground state from 0-0 S(1) to 0-0 S(8), and in the first vibrationally excited state from 1-1 S(5) to 1-1 S(9). We derive H$_2$ excitation diagrams, and approximate the excitation with one thermal (~700 K) component representative of an average gas temperature, and one non-thermal component (~2700 K) probing the effect of UV pumping. We compare these results to an existing model for the Orion Bar PDR and highlight the differences with the observations., Comment: 26 pages, 12 figures, 3 tables. Submitted to A&A, under review (1st revision)

In this paper, we present a new method for pricing CMS derivatives. We use Mallaivin's calculus to establish a model-free connection between the price of a CMS derivative and a quadratic payoff. Then, we apply Watanabe's expansions to quadratic payoffs case under local and stochastic local volatility. Our approximations are generic. To evaluate their accuracy, we will compare the approximations numerically under the normal SABR model against the market standards: Hagan's approximation, and a Monte Carlo simulation.

The Vicsek-BGK equation is a kinetic model for alignment of particles moving with constant speed between stochastic reorientation events with sampling from a von Mises distribution. The spatially homogeneous model shows a steady state bifurcation with exchange of stability. The main result of this work is an extension of the bifurcation result to the spatially inhomogeneous problem under the additional assumption of a sufficiently large Knudsen number, which is shown to be necessary. A counterexample is derived in the form of an exponentially increasing travelling wave solution of the linearized equation, indicating a possible explanation of traveling bands, which have been observed in the literature in simulations with an individual based model. The mathematical core is the proof of linearized stability, which employs a new hypocoercivity approach based on Laplace-Fourier transformation. The bifurcation result includes global existence of smooth solutions for close-to-equilibrium initial data. For large data smooth solutions might blow up in finite time whereas weak solutions with bounded Boltzmann entropy are shown to exist globally., Comment: 22 pages

This paper compares different exact approaches to solve the Discrete Ordered Median Problem (DOMP). In recent years, DOMP has been formulated using set packing constraints giving rise to one of its most promising formulations. The use of this family of constraints, known as strong order constraints (SOC), has been validated in the literature by its theoretical properties and because their linear relaxation provides very good lower bounds. Furthermore, embedded in branch-and-cut or branch-price-and-cut procedures as valid inequalities, they allow one to improve computational aspects of solution methods such as CPU time and use of memory. In spite of that, the above mentioned formulations require to include another family of order constraints, e.g., the weak order constraints (WOC), which leads to coefficient matrices with elements other than {0,1}. In this work, we develop a new approach that does not consider extra families of order constraints and furthermore relaxes SOC -- in a branch-and-cut procedure that does not start with a complete formulation -- to add them iteratively using row generation techniques to certify feasibility and optimality. Exhaustive computational experiments show that it is advisable to use row generation techniques in order to only consider {0,1}-coefficient matrices modeling the DOMP. Moreover, we test how to exploit the problem structure. Implementing an efficient separation of SOC using callbacks improves the solution performance. This allows us to deal with bigger instances than using fixed cuts/constraints pools automatically added by the solver in the branch-and-cut for SOC, concerning both the formulation based on WOC and the row generation procedure.

This paper introduces a new hierarchical facility location model with three levels: first-level facilities which manufacture different products, second-level facilities which act as warehouses and a third-level consisting of the clients who demand the products that have been manufactured in the first level and stored in the second level. In this model, called multi-product maximal covering second-level facility location problem (SL-MCFLP), the aim is to decide the location of the second-level facilities and the products to be stored in each of them maximizing the overall clients' satisfaction with respect their coverage. To deal with this model, we introduce a Mixed Integer Linear Program (MILP) which is reinforced by some families of valid inequalities. Since some of these families have an exponential number of constraints, separation algorithms are proposed. In addition, three variants of a matheuristic procedure are developed. Computational studies are included, showing the potentials and limits of the formulation and the effectiveness of the heuristic.

This paper deals with an extension of the hub line location problem considering demand elasticity with respect to travel times. The proposed model aims to capture the impact the hub network topology has on demand. The objective is to maximize the total revenue generated by each unit of demand using the hub line. We propose mixed-integer nonlinear formulations to model this problem. We study some properties of the nonlinear objective function associated with these formulations. Due to the inherent complexity involved in solving these nonlinear formulations with state-of-the-art solvers, we also present alternative mixed-integer linear programming formulations. Computational results compare the proposed formulations and the benefits of the presented model using benchmark instances commonly used in hub location. Moreover, a sensitivity analysis study is carried out with real data from the city of Montreal, Canada, to demonstrate the added value of incorporating demand elasticity when using the proposed model for public transportation planning.

The growing interest in Large Language Models (LLMs) and in particular in conversational models with which users can interact has led to the development of a large number of open-source chat LLMs. These models are evaluated on a wide range of benchmarks to assess their capabilities in answering questions or solving problems on almost any possible topic or to test their ability to reason or interpret texts. Instead, the evaluation of the knowledge that these models have of the languages has received much less attention. For example, the words that they can recognize and use in different languages. In this paper, we evaluate the knowledge that open-source chat LLMs have of Spanish words by testing a sample of words in a reference dictionary. The results show that open-source chat LLMs produce incorrect meanings for an important fraction of the words and are not able to use most of the words correctly to write sentences with context. These results show how Spanish is left behind in the open-source LLM race and highlight the need to push for linguistic fairness in conversational LLMs ensuring that they provide similar performance across languages., Comment: Procesamiento del Lenguaje Natural, 73, 95-108

We consider a ring-shaped triple-well potential with few polar bosons with in-plane dipole orientation. By diagonalizing the extended Bose-Hubbard Hamiltonian, we investigate the ground state properties of the system as we rotate the dipole angle and vary the on-site and dipole-dipole interaction strengths. We find that the anisotropic character of the dipolar interactions, as well as the competition between dipole and on-site interactions lead to different ground states and that the entanglement between sites also depends on the number of particles. We further characterize the system by studying the condensed fraction and coherence properties for different polarization angles, highlighting the possible effect of the dipolar interaction as manipulation tool., Comment: 8 pages, 6 figures

This paper introduces a very general discrete covering location model that accounts for uncertainty and time-dependent aspects. A MILP formulation is proposed for the problem. Afterwards, it is observed that most of the models existing in the literature related with covering location can be considered as particular cases of this formulation. In order to tackle large instances of this problem a Lagrangian relaxation based heuristic is developed. A computational study is addressed to check the potentials and limits of the formulation and some variants proposed for the problem, as well as to evaluate the heuristic. Finally, different measures to report the relevance of considering a multi-period stochastic setting are studied.

This work deals with the probabilistic p-center problem, which aims at minimizing the expected maximum distance between any site with demand and its center, considering that each site has demand with a specific probability. The problem is of interest when emergencies may occur at predefined sites with known probabilities. For this problem we propose and analyze different formulations as well as a Variable Neighborhood Search heuristic. Computational tests are reported, showing the potentials and limits of each formulation, the impact of their enhancements, and the effectiveness of the heuristic.

This paper proposes a robust classification model, based on support vector machine (SVM), which simultaneously deals with outliers detection and feature selection. The classifier is built considering the ramp loss margin error and it includes a budget constraint to limit the number of selected features. The search of this classifier is modeled using a mixed-integer formulation with big M parameters. Two different approaches (exact and heuristic) are proposed to solve the model. The heuristic approach is validated by comparing the quality of the solutions provided by this approach with the exact approach. In addition, the classifiers obtained with the heuristic method are tested and compared with existing SVM-based models to demonstrate their efficiency.

This paper considers various models of support vector machines with ramp loss, these being an efficient and robust tool in supervised classification for the detection of outliers. The exact solution approaches for the resulting optimization problem are of high demand for large datasets. Hence, the goal of this paper is to develop algorithms that provide efficient methodologies to exactly solve these optimization problems. These approaches are based on three strategies for obtaining tightened values of the big M parameters included in the formulation of the problem. Two of them require solving a sequence of continuous problems, while the third uses the Lagrangian relaxation to tighten the bounds. The proposed resolution methods are valid for the l1-norm and l2-norm ramp loss formulations. They were tested and compared with existing solution methods in simulated and real-life datasets, showing the efficiency of the developed methodology.

An algorithm to obtain data-driven models of oscillatory phenomena in plasma space propulsion systems is presented, based on sparse regression (SINDy) and Pareto front analysis. The algorithm can incorporate physical constraints, use data bootstrapping for additional robustness, and fine-tuning to different metrics. Standard, weak and integral SINDy formulations are discussed and compared. The scheme is benchmarked in the case of breathing-mode oscillations in Hall effect thrusters, using PIC/fluid simulation data. Models of varying complexity are obtained for the average plasma properties, and shown to have a clear physical interpretability and agreement with existing 0D models in the literature. Lastly, the algorithm applied is also shown to enable the identification of physical subdomains with qualitatively different plasma dynamics, providing valuable information for more advanced modeling approaches.