Search

Disease detection in sugarcane, particularly the identification of asymptomatic infectious diseases such as Ratoon Stunting Disease (RSD), is critical for effective crop management. This study employed various machine learning techniques to detect the presence of RSD in different sugarcane varieties, using vegetation indices derived from freely available satellite-based spectral data. Our results show that the Support Vector Machine with a Radial Basis Function Kernel (SVM-RBF) was the most effective algorithm, achieving classification accuracy between 85.64\% and 96.55\%, depending on the variety. Gradient Boosting and Random Forest also demonstrated high performance achieving accuracy between 83.33\% to 96.55\%, while Logistic Regression and Quadratic Discriminant Analysis showed variable results across different varieties. The inclusion of sugarcane variety and vegetation indices was important in the detection of RSD. This agreed with what was identified in the current literature. Our study highlights the potential of satellite-based remote sensing as a cost-effective and efficient method for large-scale sugarcane disease detection alternative to traditional manual laboratory testing methods., Comment: 13 pages, 1 figure and 2 tables (main text), 1 figure and 3 tables (appendices). Submitted to "Computers and Electronics in Agriculture"

Motivated by the proliferation of Internet-of-Thing (IoT) devices and the rapid advances in the field of deep learning, there is a growing interest in pushing deep learning computations, conventionally handled by the cloud, to the edge of the network to deliver faster responses to end users, reduce bandwidth consumption to the cloud, and address privacy concerns. However, to fully realize deep learning at the edge, two main challenges still need to be addressed: (i) how to meet the high resource requirements of deep learning on resource-constrained devices, and (ii) how to leverage the availability of multiple streams of spatially correlated data, to increase the effectiveness of deep learning and improve application-level performance. To address the above challenges, we explore collaborative inference at the edge, in which edge nodes and end devices share correlated data and the inference computational burden by leveraging different ways to split computation and fuse data. Besides traditional centralized and distributed schemes for edge-end device collaborative inference, we introduce selective schemes that decrease bandwidth resource consumption by effectively reducing data redundancy. As a reference scenario, we focus on multi-view classification in a networked system in which sensing nodes can capture overlapping fields of view. The proposed schemes are compared in terms of accuracy, computational expenditure at the nodes, communication overhead, inference latency, robustness, and noise sensitivity. Experimental results highlight that selective collaborative schemes can achieve different trade-offs between the above performance metrics, with some of them bringing substantial communication savings (from 18% to 74% of the transmitted data with respect to centralized inference) while still keeping the inference accuracy well above 90%.

The ability to form, retrieve, and reason about memories in response to stimuli serves as the cornerstone for general intelligence - shaping entities capable of learning, adaptation, and intuitive insight. Large Language Models (LLMs) have proven their ability, given the proper memories or context, to reason and respond meaningfully to stimuli. However, they are still unable to optimally encode, store, and retrieve memories - the ability to do this would unlock their full ability to operate as AI agents, and to specialize to niche domains. To remedy this, one promising area of research is Retrieval Augmented Generation (RAG), which aims to augment LLMs by providing them with rich in-context examples and information. In question-answering (QA) applications, RAG methods embed the text of interest in chunks, and retrieve the most relevant chunks for a prompt using text embeddings. Motivated by human memory encoding and retrieval, we aim to improve over standard RAG methods by generating and encoding higher-level information and tagging the chunks by their utility to answer questions. We introduce Graphical Eigen Memories For Retrieval Augmented Generation (GEM-RAG). GEM-RAG works by tagging each chunk of text in a given text corpus with LLM generated ``utility'' questions, connecting chunks in a graph based on the similarity of both their text and utility questions, and then using the eigendecomposition of the memory graph to build higher level summary nodes that capture the main themes of the text. We evaluate GEM-RAG, using both UnifiedQA and GPT-3.5 Turbo as the LLMs, with SBERT, and OpenAI's text encoders on two standard QA tasks, showing that GEM-RAG outperforms other state-of-the-art RAG methods on these tasks. We also discuss the implications of having a robust RAG system and future directions., Comment: 8 pages

Modern neural network classifiers achieve remarkable performance across a variety of tasks; however, they frequently exhibit overconfidence in their predictions due to the cross-entropy loss. Inspired by this problem, we propose the \textbf{Cr}i\textbf{t}ic Loss for Image \textbf{Cl}assification (CrtCl, pronounced Critical). CrtCl formulates image classification training in a generator-critic framework, with a base classifier acting as a generator, and a correctness critic imposing a loss on the classifier. The base classifier, acting as the generator, given images, generates the probability distribution over classes and intermediate embeddings. The critic model, given the image, intermediate embeddings, and output predictions of the base model, predicts the probability that the base model has produced the correct classification, which then can be back propagated as a self supervision signal. Notably, the critic does not use the label as input, meaning that the critic can train the base model on both labeled and unlabeled data in semi-supervised learning settings. CrtCl represents a learned loss method for accuracy, alleviating the negative side effects of using cross-entropy loss. Additionally, CrtCl provides a powerful way to select data to be labeled in an active learning setting, by estimating the classification ability of the base model on unlabeled data. We study the effectiveness of CrtCl in low-labeled data regimes, and in the context of active learning. In classification, we find that CrtCl, compared to recent baselines, increases classifier generalization and calibration with various amounts of labeled data. In active learning, we show our method outperforms baselines in accuracy and calibration. We observe consistent results across three image classification datasets., Comment: 8 pages

In this paper, we consider partially observable timed automata endowed with a single clock. A time interval is associated with each transition specifying at which clock values it may occur. In addition, a resetting condition associated to a transition specifies how the clock value is updated upon its occurrence. This work deals with the estimation of the current state given a timed observation, i.e., a succession of pairs of an observable event and the time instant at which the event has occurred. The problem of state reachability in the timed automaton is reduced to the reachability analysis of the associated zone automaton, which provides a purely discrete event description of the behaviour of the timed automaton. An algorithm is formulated to provide an offline approach for state estimation of a timed automaton based on the assumption that the clock is reset upon the occurrence of each observable transition., Comment: This is the arXiv version of a manuscript that has been conditionally accepted for publication in the IEEE Transactions on Automatic Control in 2023

Single photons emitters (SPEs) are key components in quantum information applications and are commonly generated in 2D materials by inhomogeneous strain engineering. Here, we report an alternative approach that involves a 2D semiconductor/2D magnet heterostructure. The optical study of the WSe2/CrSBr heterostructures reveals several new emission lines at lower energies compared to characteristic WSe2 emissions, that are assigned to localized excitons. Further investigation demonstrates that one of these emergent lines is an SPE with a strong valley polarization response and large energy shift with the field-induced metamagnetic transition in CrSBr, linking it to the magnetic proximity effect of the adjacent CrSBr layer. In contrast to previous reports on WSe2 that only allow tuning of the SPEs by out-of-plane magnetic field, our emitter is sensitive to both in- and out-of-plane fields. Our findings demonstrate the potential of this approach for improved control and polarization of SPEs in 2D materials., Comment: 17 pages, 4 figures, plus suporting information

Ionic liquids have proved to be excellent heat transfer fluids and alternatives to common HTFs used in industries for heat exchangers and other heat transfer equipment. However, its industrial utilization depends on the cost per kg of its production, to be competitive for industrial applications with biphenyl and diphenyl oxide, alkylated aromatics, and dimethyl polysiloxane oils, which degrade above 200 {\deg}C and possess some environmental problems. The efficiency of a heat transfer fluid depends on the fundamental thermophysical properties influencing convective heat transfer (density, heat capacity, thermal conductivity, and viscosity), as these properties are necessary to calculate the heat transfer coefficients for different heat exchanger geometries. In Part 1, the thermophysical properties of pure 1-ethyl-3-methylimidazolium methanesulfonate $[C_{2}mim][CH_{3}SO_{3}]$ (CAS no. 145022-45-3), (ECOENG 110), produced by BASF, under the trade name of Basionics ST35, with an assay $\geq$97% with $\leq$0.5% water and $\leq$2% chloride ($Cl^{-}$), were presented, for temperatures slightly below room temperature and up to 355 K. In this paper, we report the thermophysical properties of mixtures of [C2mim][CH3SO3] with water, in the whole concentration range, at $P$ = 0.1 MPa. The properties measured were density and speed of sound (293.15 < $T$/K < 343.15), viscosity, electrical and thermal conductivities, refractive index (293.15 < $T$/K < 353.15), and infinite dilution diffusion coefficient of the ionic liquid in water (298.15 K).

Designing well-defined magnetic nanomaterials is crucial for various applications and demands a comprehensive understanding of their magnetic properties at the microscopic level. In this study, we investigate the contributions to the total anisotropy of Mn-Co mixed spinel nanoparticles. By employing neutron measurements sensitive to the spatially resolved surface anisotropy with sub-A resolution, we reveal the discrepancy between the excess anisotropy that can be explained by the shape anisotropy and interparticle interactions. Our findings shed light on the intricate interplay between chemical composition, microstructure, morphology, and surface effects and provide valuable insights for the design of advanced magnetic nanomaterials., Comment: main manuscript 19 pages, 3 figures, supplemental: 11 pages, 4 figures

We develop the bialgebra theory for two classes of non-associative algebras: nearly associative algebras and $LR$-algebras. In particular, building on recent studies that reveal connections between these algebraic structures, we establish that nearly associative bialgebras and $LR$-bialgebras are, in fact, equivalent concepts. We also provide a characterization of these bialgebra classes based on the coproduct. Moreover, since the development of nearly associative bialgebras - and by extension, $LR$-bialgebras - requires the framework of nearly associative $L$-algebras, we introduce this class of non-associative algebras and explore their fundamental properties. Furthermore, we identify and characterize a special class of nearly associative bialgebras, the coboundary nearly associative bialgebras, which provides a natural framework for studying the Yang-Baxter equation (YBE) within this context., Comment: 17 pages

State-estimation-based properties are central properties in discrete-event systems modeled by labeled finite-state automata studied over the past 3 decades. Most existing results are based on a single agent who knows the structure of a system and can observe a subset of events and estimate the system's state based on the system's structure and the agent's observation to the system. The main tool used to do state estimation and verify state-estimation-based properties is called \emph{observer} which is the powerset construction originally proposed by Rabin and Scott in 1959, used to determinize a nondeterministic finite automaton with $\varepsilon$-transitions. In this paper, we consider labeled finite-state automata, extend the state-estimation-based properties from a single agent to a finite ordered set of agents and also extend the original observer to \emph{high-order observer} based on the original observer and our \emph{concurrent composition}. As a result, a general framework on high-order state-estimation-based properties have been built and a basic tool has also been built to verify such properties. This general framework contains many basic properties as its members such as state-based opacity, critical observability, determinism, high-order opacity, etc. Special cases for which verification can be done more efficiently are also discussed. In our general framework, the system's structure is publicly known to all agents $A_1,\dots,A_n$, each agent $A_i$ has its own observable event set $E_i$, and additionally knows all its preceding agents' observable events but can only observe its own observable events. The intuitive meaning of our high-order observer is what agent $A_n$ knows about what $A_{n-1}$ knows about \dots what $A_2$ knows about $A_1$'s state estimate of the system., Comment: 32 pages, 38 figures

A velocity field characterized by chaotic advection induces stretching and folding processes that increase the solute-solvent interface available for diffusion. Identifying chaotic flow fields with optimized mixing enhancement is relevant for applications like groundwater remediation, microfluidics, and many more. This work uses the dilution index to quantify the temporal increase in mixing of a solute within its solvent. We introduce a new approach to select a suitable grid size for each time step in the dilution index approximation, motivated by the theory of representative elementary volumes. It preserves the central feature of the dilution index, which is monotonically increasing in time and hence leads to reliable results. Our analysis highlights the importance of a suitable choice for the grid size in the dilution index approximation. We use this approach to demonstrate the mixing enhancement for two chaotic injection-extraction systems that exhibit chaotic structures: a source-sink dipole and a rotated potential mixing. By analyzing the chaotic flow fields, we identify Kolmogorov--Arnold--Moser (KAM) islands, non-mixing regions that limit the chaotic area in the domain and, thereby, the mixing enhancement. Using our new approach, we assess the choice of design parameters of the injection-extraction systems to effectively engineer chaotic mixing. We demonstrate the important role of diffusion in filling the KAM islands and reaching complete mixing in the systems., Comment: paper: 17 pages, 15 figures. supplemental material: 4 pages, 3 figures, submitted to Physical Review E

Introduction. Here we reported the virological, entomological and epidemiological characteristics of the large autochthonous outbreak of dengue (DENV) occurred in a small village of the Lombardy region (Northern Italy) during summer 2023. Methods. After the diagnosis of the first autochthonous case on 18 August 2023, public health measures, including epidemiological investigation and vector control measures, were carried out. A serological screening for DENV antibodies detection was offered to the population. In the case of positive DENV IgM, a second sample was collected to detect DENV RNA and verify seroconversion. Entomological and epidemiological investigations were also performed. A modeling analysis was conducted to estimate the dengue generation time, transmission potential, distance of transmission, and assess diagnostic delays. Results. Overall, 416 subjects participated to the screening program and 20 were identified as DENV-1 cases (15 confirmed and 5 probable). In addition, DENV-1 infection was diagnosed in 24 symptomatic subjects referred to the local Emergency Room Department for suggestive symptoms and 1 case was identified through blood donation screening. The average generation time was estimated to be 18.3 days (95% CI: 13.1-23.5 days). R0 was estimated at 1.31 (95% CI: 0.76-1.98); 90% of transmission occurred within 500m. Entomological investigations performed in 46 pools of mosquitoes revealed the presence of only one positive pool for DENV-1. Discussion. This report highlights the importance of synergic surveillance, including virological, entomological and public health measures to control the spread of arboviral infections.

We present progress on two old conjectures about longest cycles in graphs. The first conjecture, due to Thomassen from 1978, states that apart from a finite number of exceptions, all connected vertex-transitive graphs contain a Hamiltonian cycle. The second conjecture, due to Smith from 1984, states that for $r\ge 2$ in every $r$-connected graph any two longest cycles intersect in at least $r$ vertices. In this paper, we prove a new lemma about the intersection of longest cycles in a graph which can be used to improve the best known bounds towards both of the aforementioned conjectures: First, we show that every connected vertex-transitive graph on $n\geq 3$ vertices contains a cycle of length at least $\Omega(n^{13/21})$, improving on $\Omega(n^{3/5})$ from [De Vos, arXiv:2302:04255, 2023]. Second, we show that in every $r$-connected graph with $r\geq 2$, any two longest cycles meet in at least $\Omega(r^{5/8})$ vertices, improving on $\Omega(r^{3/5})$ from [Chen, Faudree and Gould, J. Combin. Theory, Ser.~ B, 1998]. Our proof combines combinatorial arguments, computer-search and linear programming., Comment: 13 pages, 3 figures. Code available at https://github.com/tjeremie/Long-cycles

Occupational exoskeletons promise to alleviate musculoskeletal injuries among industrial workers. Knowledge of the usability of the exoskeleton designs with respect to the user device interaction points, and the problems in design features, functions and parts, evaluated and rated using design principles is still limited. Further, the usability of exoskeletons when assembling, donning, doffing and disassembling them, tasks that can be considered pre and post use tasks are also critical to evaluate, especially from a device design standpoint. We conducted a heuristic evaluation of the usability of three popular exoskeletons, a back support device, a shoulder support device, and a sit stand exoskeleton when assembling, donning, doffing and disassembling them. Seven evaluators used Nielsen and Shneiderman usability heuristics to evaluate the devices. Results indicate that none of the three exoskeletons had any catastrophic usability problems, but all three had major usability problems including accommodating diverse users, the assembly, donning and doffing being a two person operation, poor documentation, a lack of sequence indicators during assembly of the devices, presence of safety hazards while donning and doffing the devices, and manual strength requirements. Further, the assembly task is the most difficult task resulting in the most violations of usability heuristics. The exoskeleton human factors research community should include diverse users in their evaluations and conduct usability, accessibility, and safety evaluations of these devices to provide design feedback to device designers.

We present different proofs of the uniqueness of 4-dimensional static vacuum asymptotically flat spacetimes containing a connected equipotential photon surface or in particular a connected photon sphere. We do not assume that the equipotential photon surface is outward directed or non-degenerate and hence cover not only the positive but also the negative and the zero mass case which has not yet been treated in the literature. Our results partially reproduce and extend beyond results by Cederbaum and by Cederbaum and Galloway. In the positive and negative mass cases, we give three proofs which are based on the approaches to proving black hole uniqueness by Israel, Robinson, and Agostiniani--Mazzieri, respectively. In the zero mass case, we give four proofs. One is based on the positive mass theorem, the second one is inspired by Israel's approach and in particular leads to a new proof of the Willmore inequality in $(\mathbb{R}^3, \delta)$, under a technical assumption. The remaining two proofs are inspired by proofs of the Willmore inequality by Cederbaum and Miehe and by Agostiniani and Mazzieri, respectively. In particular, this suggests to view the Willmore inequality and its rigidity case as a zero mass version of equipotential photon surface uniqueness.

MOCAT-SSEM is a Source-Sink model that predicts the Low Earth Orbit (LEO) space population divided into families using a predefined set of interaction parameters. Thanks to data from the Monte Carlo version of the model (MOCAT-MC), which propagates singularly every object, it is possible to estimate such parameters, assumed as additional stochastic variables. Thus, this paper proposed a new set of parameters so that the new Source-Sink model prediction better fits the computationally expensive and accurate MOCAT-MC simulation. Estimation is performed by extracting stochastic quantities from the space population, which has been analyzed to fit common probability density functions., Comment: American Astronautical Society 2024 Conference - Space Domain Awareness Section

Accurately predicting carrier mobility in strongly anharmonic solids necessitates a precise characterization of lattice dyndamics as a function of temperature. We achieve consistency with experimental electron mobility data for bulk KTaO$_3$ and SrTiO$_3$ above 150 K by refining the Boltzmann transport equations. This refinement includes incorporating temperature-dependent anharmonic phonon eigenfrequencies and eigenmodes into the electron-phonon interaction tensor, while maintaining the derivatives of the Kohn-Sham potential as computed in density functional perturbation theory. Using efficient machine-learned force fields and the stochastic self-consistent harmonic approximation, we accurately compute the dynamical matrices. At room temperature, the calculated mobility for SrTiO$_3$ exceeds experimental values by an order of magnitude, whereas the overestimation for KTaO$_3$ is way less pronounced. This discrepancy is explained through the more significant electron mass renormalization near the conduction band bottom due to anharmonic electron-phonon coupling and the presence of local disorder in SrTiO$_3$.

Smart contracts are central to a myriad of critical blockchain applications, from financial transactions to supply chain management. However, their adoption is hindered by security vulnerabilities that can result in significant financial losses. Most vulnerability detection tools and methods available nowadays leverage either static analysis methods or machine learning. Unfortunately, as valuable as they are, both approaches suffer from limitations that make them only partially effective. In this survey, we analyze the state of the art in machine-learning vulnerability detection for Ethereum smart contracts, by categorizing existing tools and methodologies, evaluating them, and highlighting their limitations. Our critical assessment unveils issues such as restricted vulnerability coverage and dataset construction flaws, providing us with new metrics to overcome the difficulties that restrain a sound comparison of existing solutions. Driven by our findings, we discuss best practices to enhance the accuracy, scope, and efficiency of vulnerability detection in smart contracts. Our guidelines address the known flaws while at the same time opening new avenues for research and development. By shedding light on current challenges and offering novel directions for improvement, we contribute to the advancement of secure smart contract development and blockchain technology as a whole.

Conventional route planning services typically offer the same routes to all drivers, focusing primarily on a few standardized factors such as travel distance or time, overlooking individual driver preferences. With the inception of autonomous vehicles expected in the coming years, where vehicles will rely on routes decided by such planners, there arises a need to incorporate the specific preferences of each driver, ensuring personalized navigation experiences. In this work, we propose a novel approach based on graph neural networks (GNNs) and deep reinforcement learning (DRL), aimed at customizing routes to suit individual preferences. By analyzing the historical trajectories of individual drivers, we classify their driving behavior and associate it with relevant road attributes as indicators of driver preferences. The GNN is capable of representing the road network as graph-structured data effectively, while DRL is capable of making decisions utilizing reward mechanisms to optimize route selection with factors such as travel costs, congestion level, and driver satisfaction. We evaluate our proposed GNN-based DRL framework using a real-world road network and demonstrate its ability to accommodate driver preferences, offering a range of route options tailored to individual drivers. The results indicate that our framework can select routes that accommodate driver's preferences with up to a 17% improvement compared to a generic route planner, and reduce the travel time by 33% (afternoon) and 46% (evening) relatively to the shortest distance-based approach.

Sign Language Recognition has been studied and developed throughout the years to help the deaf and hard-of-hearing people in their day-to-day lives. These technologies leverage manual sign recognition algorithms, however, most of them lack the recognition of facial expressions, which are also an essential part of Sign Language as they allow the speaker to add expressiveness to their dialogue or even change the meaning of certain manual signs. SLVideo is a video moment retrieval software for Sign Language videos with a focus on both hands and facial signs. The system extracts embedding representations for the hand and face signs from video frames to capture the language signs in full. This will then allow the user to search for a specific sign language video segment with text queries, or to search by similar sign language videos. To test this system, a collection of five hours of annotated Sign Language videos is used as the dataset, and the initial results are promising in a zero-shot setting.SLVideo is shown to not only address the problem of searching sign language videos but also supports a Sign Language thesaurus with a search by similarity technique. Project web page: https://novasearch.github.io/SLVideo/, Comment: 5 pages, 3 figures, 1 table

The enormous scale of state-of-the-art foundation models has limited their accessibility to scientists, because customized experiments at large model sizes require costly hardware and complex engineering that is impractical for most researchers. To alleviate these problems, we introduce NNsight, an open-source Python package with a simple, flexible API that can express interventions on any PyTorch model by building computation graphs. We also introduce NDIF, a collaborative research platform providing researchers access to foundation-scale LLMs via the NNsight API. Code, documentation, and tutorials are available at https://www.nnsight.net., Comment: Code at https://nnsight.net

Controlling light propagation in photonic systems fosters fundamental research and practical application. Particularly, photonic lattices allow engineering band dispersions and tailor transport features through their geometry. However, complete controllability requires external manipulation of the propagating light. Here, we present a resonant excitation scheme to observe quasi-1D and uni-directional propagation of light through the bulk of two-dimensional lattices. To this end, we use the highly anisotropic light propagation exhibited at the energy of saddle points in photonic bands. When multiple drives with judicious amplitudes and phases are tuned to such energy, interference effects between these drives and photonic modes result in controllable directional propagation through the bulk. Similarly, one can formed localized states with controllable localization degrees. We illustrate these effects with driven-dissipative photonic lattices. Our work highlights the importance of external drives for dynamically controlling directional light transport in lattices, a relevant feature for all-optical routing and processing in photonics., Comment: 7 pages, 5 figures

The European Committee for Future Accelerators (ECFA) Early-Career Researcher (ECR) panel, which represents the interests of the ECR community to ECFA, presents in this document its initiatives and activities in the year 2023. This report summarises the process of the first big turnover in the panel composition at the start of 2023 and reports on the activities of the active working groups - either pursued from before or newly established. The overarching goal of the ECFA-ECR panel is to better understand and support the diverse interests of early-career researchers in the ECFA community and beyond., Comment: Editors: Jan-Hendrik Arling, Cecilia Borca, Armin Ilg, Arnau Morancho Tarda, Holly Pacey, Marko Pesut, Elisabetta Spadaro Norella and Marta Urbaniak. arXiv admin note: substantial text overlap with arXiv:2212.11238

Augmented Reality (AR) allows us to represent information in the user's own environment and, therefore, convey a visceral feeling of its true physical scale. Journalists increasingly leverage this opportunity through immersive infographics, an extension of conventional infographics reliant on familiar references to convey volumes, heights, weights, and sizes. Our goal is to measure the contribution of immersive mobile AR concrete scales infographics to the user's understanding of the information scale. We focus on infographics powered by tablet-based mobile AR, given its current much more widespread use for news consumption compared to headset-based AR. We designed and implemented a study apparatus containing three alternative representation methods (textual analogies, image infographic, and AR infographic) for three different pieces of news with different characteristics and scales. In a controlled user study, we asked 26 participants to represent the expected volume of the information in the real world with the help of an AR mobile application. We also compared their subjective feelings when interacting with the different representations. While both image and AR infographics led to significantly better comprehension than textual analogies alone across different kinds of news, AR infographics led, on average, to a 31.8% smaller volume estimation error than static ones. Our findings indicate that mobile AR concrete scales infographics can contribute to news reporting by increasing readers' abilities to comprehend volume information.

Developing prompt-based methods with Large Language Models (LLMs) requires making numerous decisions, which give rise to a combinatorial search problem. For example, selecting the right pre-trained LLM, prompt, and hyperparameters to attain the best performance for a task typically necessitates evaluating an expoential number of candidates on large validation sets. This exhaustive evaluation can be time-consuming and costly, as both inference and evaluation of LLM-based approaches are resource-intensive. Worse, a lot of computation is wasted: Many hyper-parameter settings are non-competitive, and many samples from the validation set are highly correlated - providing little or no new information. So, if the goal is to identify the best method, it can be done far more efficiently if the validation samples and methods are selected adaptively. In this paper, we propose a novel method to address this challenge. We lean on low-rank matrix factorization to fill in missing evaluations and on multi-armed bandits to sequentially identify the next (method, validation sample)-pair to evaluate. We carefully assess the efficacy of our approach on several competitive benchmark problems and show that it can identify the top-performing method using only 5-15% of the typically needed resources -- resulting in a staggering 85-95% LLM cost savings.

High kinetic inductance superconductors are gaining increasing interest for the realisation of qubits, amplifiers and detectors. Moreover, thanks to their high impedance, quantum buses made of such materials enable large zero-point fluctuations of the voltage, boosting the coupling rates to spin and charge qubits. However, fully exploiting the potential of disordered or granular superconductors is challenging, as their inductance and, therefore, impedance at high values are difficult to control. Here we have integrated a granular aluminium resonator, having a characteristic impedance exceeding the resistance quantum, with a germanium double quantum dot and demonstrate strong charge-photon coupling with a rate of $g_\text{c}/2\pi= (566 \pm 2)$ MHz. This was achieved due to the realisation of a wireless ohmmeter, which allows \emph{in situ} measurements during film deposition and, therefore, control of the kinetic inductance of granular aluminium films. Reproducible fabrication of circuits with impedances (inductances) exceeding 13 k$\Omega$ (1 nH per square) is now possible. This broadly applicable method opens the path for novel qubits and high-fidelity, long-distance two-qubit gates.

In pursuit of autonomous vehicles, achieving human-like driving behavior is vital. This study introduces adaptive autopilot (AA), a unique framework utilizing constrained-deep reinforcement learning (C-DRL). AA aims to safely emulate human driving to reduce the necessity for driver intervention. Focusing on the car-following scenario, the process involves (i) extracting data from the highD natural driving study and categorizing it into three driving styles using a rule-based classifier; (ii) employing deep neural network (DNN) regressors to predict human-like acceleration across styles; and (iii) using C-DRL, specifically the soft actor-critic Lagrangian technique, to learn human-like safe driving policies. Results indicate effectiveness in each step, with the rule-based classifier distinguishing driving styles, the regressor model accurately predicting acceleration, outperforming traditional car-following models, and C-DRL agents learning optimal policies for humanlike driving across styles., Comment: 8 pages, 9 figures

Tensor factorizations have been widely used for the task of uncovering patterns in various domains. Often, the input is time-evolving, shifting the goal to tracking the evolution of underlying patterns instead. To adapt to this more complex setting, existing methods incorporate temporal regularization but they either have overly constrained structural requirements or lack uniqueness which is crucial for interpretation. In this paper, in order to capture the underlying evolving patterns, we introduce t(emporal)PARAFAC2 which utilizes temporal smoothness regularization on the evolving factors. We propose an algorithmic framework that employs Alternating Optimization (AO) and the Alternating Direction Method of Multipliers (ADMM) to fit the model. Furthermore, we extend the algorithmic framework to the case of partially observed data. Our numerical experiments on both simulated and real datasets demonstrate the effectiveness of the temporal smoothness regularization, in particular, in the case of data with missing entries. We also provide an extensive comparison of different approaches for handling missing data within the proposed framework., Comment: 14 pages, 11 figures

Recent advances in Natural Language Processing have demonstrated the effectiveness of pretrained language models like BERT for a variety of downstream tasks. We present GiusBERTo, the first BERT-based model specialized for anonymizing personal data in Italian legal documents. GiusBERTo is trained on a large dataset of Court of Auditors decisions to recognize entities to anonymize, including names, dates, locations, while retaining contextual relevance. We evaluate GiusBERTo on a held-out test set and achieve 97% token-level accuracy. GiusBERTo provides the Italian legal community with an accurate and tailored BERT model for de-identification, balancing privacy and data protection., Comment: 14 pages, 4 figures, 6 Tables

Data fusion models based on Coupled Matrix and Tensor Factorizations (CMTF) have been effective tools for joint analysis of data from multiple sources. While the vast majority of CMTF models are based on the strictly multilinear CANDECOMP/PARAFAC (CP) tensor model, recently also the more flexible PARAFAC2 model has been integrated into CMTF models. PARAFAC2 tensor models can handle irregular/ragged tensors and have shown to be especially useful for modelling dynamic data with unaligned or irregular time profiles. However, existing PARAFAC2-based CMTF models have limitations in terms of possible regularizations on the factors and/or types of coupling between datasets. To address these limitations, in this paper we introduce a flexible algorithmic framework that fits PARAFAC2-based CMTF models using Alternating Optimization (AO) and the Alternating Direction Method of Multipliers (ADMM). The proposed framework allows to impose various constraints on all modes and linear couplings to other matrix-, CP- or PARAFAC2-models. Experiments on various simulated and a real dataset demonstrate the utility and versatility of the proposed framework as well as its benefits in terms of accuracy and efficiency in comparison with state-of-the-art methods., Comment: 15 pages, 15 figures,1 table

Large language models (LLMs) often lack culture-specific knowledge of daily life, especially across diverse regions and non-English languages. Existing benchmarks for evaluating LLMs' cultural sensitivities are limited to a single language or collected from online sources such as Wikipedia, which do not reflect the mundane everyday lifestyles of diverse regions. That is, information about the food people eat for their birthday celebrations, spices they typically use, musical instruments youngsters play, or the sports they practice in school is common cultural knowledge but uncommon in easily collected online sources, especially for underrepresented cultures. To address this issue, we introduce BLEnD, a hand-crafted benchmark designed to evaluate LLMs' everyday knowledge across diverse cultures and languages. BLEnD comprises 52.6k question-answer pairs from 16 countries/regions, in 13 different languages, including low-resource ones such as Amharic, Assamese, Azerbaijani, Hausa, and Sundanese. We construct the benchmark to include two formats of questions: short-answer and multiple-choice. We show that LLMs perform better for cultures that are highly represented online, with a maximum 57.34% difference in GPT-4, the best-performing model, in the short-answer format. For cultures represented by mid-to-high-resource languages, LLMs perform better in their local languages, but for cultures represented by low-resource languages, LLMs perform better in English than the local languages. We make our dataset publicly available at: https://github.com/nlee0212/BLEnD.

PLATO (PLAnetary Transits and Oscillations of stars) is ESA's M3 mission designed to detect and characterise extrasolar planets and perform asteroseismic monitoring of a large number of stars. PLATO will detect small planets (down to <2 R_(Earth)) around bright stars (<11 mag), including terrestrial planets in the habitable zone of solar-like stars. With the complement of radial velocity observations from the ground, planets will be characterised for their radius, mass, and age with high accuracy (5 %, 10 %, 10 % for an Earth-Sun combination respectively). PLATO will provide us with a large-scale catalogue of well-characterised small planets up to intermediate orbital periods, relevant for a meaningful comparison to planet formation theories and to better understand planet evolution. It will make possible comparative exoplanetology to place our Solar System planets in a broader context. In parallel, PLATO will study (host) stars using asteroseismology, allowing us to determine the stellar properties with high accuracy, substantially enhancing our knowledge of stellar structure and evolution. The payload instrument consists of 26 cameras with 12cm aperture each. For at least four years, the mission will perform high-precision photometric measurements. Here we review the science objectives, present PLATO's target samples and fields, provide an overview of expected core science performance as well as a description of the instrument and the mission profile at the beginning of the serial production of the flight cameras. PLATO is scheduled for a launch date end 2026. This overview therefore provides a summary of the mission to the community in preparation of the upcoming operational phases.

This paper presents a solver using the Level-Set method for incompressible two phase flows with surface tension. A one fluid approach is adopted where both phases share the same velocity and pressure field. The Level Set method has been coupled with the Ghost Fluid Method. An efficient and pragmatic solution is proposed to avoid interface displacement during the reinitialization of the level-Set fields. A solver called LSFoam has been implemented in the OpenFOAM framework with consistent Rhie & Chow interpolation. This solver has been tested on several test cases covering different scales and flow configurations: rising bubble test case, Rayleigh-Taylor instability simulations, Ogee spillway flow, 3D dambreak simulation with a square cylinder obstacle and KVLCC2 steady resistance calculations. Overall results are in excellent agreement with reference data and the present approach is very promising for moderate free surface deformations.

Occupational exoskeletons promise to reduce the incidence of musculoskeletal injuries; however, we do not know if their designs allow universal use by all workers. We also do not know how easy the tasks of assembling, donning, doffing, and disassembling exoskeletons are. The purpose of our study was to heuristically evaluate a back support, a shoulder support, a handgrip strength support, and a sit-stand exoskeleton for how well they are designed for universal use when assembling, donning, doffing, and disassembling the exoskeleton. Seven evaluators used universal design principles and associated criteria to independently evaluate and rate four exoskeletons when assembling, donning, doffing, and disassembling the devices. The rating scale was a Likert-type scale, where a rating of 1 represented not at all, and a rating of 5 represented an excellent design with respect to the universal design criteria for the task. The results indicate that providing perceptible information to the user, making the design equitable to use for a diverse set of users, making the design simple and intuitive to use with adequate feedback, and designing to prevent user errors, and when errors are made, allowing the user to recover quickly from the errors, were rated poorly. Assembling and donning tasks presented the most challenges.

The layered metamagnet CrSBr offers a rich interplay between magnetic, optical and electrical properties that can be extended down to the two-dimensional (2D) limit. Despite the extensive research regarding the long-range magnetic order in magnetic van der Waals materials, short-range correlations have been loosely investigated. By using Small-Angle Neutron Scattering (SANS) we show the formation of short-range magnetic regions in CrSBr with correlation lengths that increase upon cooling up to ca. 3 nm at the antiferromagnetic ordering temperature (TN ~ 140 K). Interestingly, these ferromagnetic correlations start developing below 200 K, i.e., well above TN. Below TN, these correlations rapidly decrease and are negligible at low-temperatures. The experimental results are well-reproduced by an effective spin Hamiltonian, which pinpoints that the short-range correlations in CrSBr are intrinsic to the monolayer limit, and discard the appearance of any frustrated phase in CrSBr at low-temperatures within our experimental window between 2 and 200 nm. Overall, our results are compatible with a spin freezing scenario of the magnetic fluctuations in CrSBr and highlight SANS as a powerful technique for characterizing the rich physical phenomenology beyond the long-range order paradigm offered by van der Waals magnets., Comment: Main Text + Supplementary Information

The Open Radio Access Network (O-RAN) architecture aims to support a plethora of network services, such as beam management and network slicing, through the use of third-party applications called xApps. To efficiently provide network services at the radio interface, it is thus essential that the deployment of the xApps is carefully orchestrated. In this paper, we introduce OREO, an O-RAN xApp orchestrator, designed to maximize the offered services. OREO's key idea is that services can share xApps whenever they correspond to semantically equivalent functions, and the xApp output is of sufficient quality to fulfill the service requirements. By leveraging a multi-layer graph model that captures all the system components, from services to xApps, OREO implements an algorithmic solution that selects the best service configuration, maximizes the number of shared xApps, and efficiently and dynamically allocates resources to them. Numerical results as well as experimental tests performed using our proof-of-concept implementation, demonstrate that OREO closely matches the optimum, obtained by solving an NP-hard problem. Further, it outperforms the state of the art, deploying up to 35% more services with an average of 30% fewer xApps and a similar reduction in the resource consumption., Comment: 10 pages, 7 figures, 3 tables

Given a set of customers, the Flying Sidekick Traveling Salesman Problem (FSTSP) consists of using one truck and one drone to perform deliveries to them. The drone is limited to delivering to one customer at a time, after which it returns to the truck, from where it can be launched again. The goal is to minimize the time required to service all customers and return both vehicles to the depot. In the literature, we can find heuristics for this problem that follow the order-first split-second approach: find a Hamiltonian cycle h with all customers, and then remove some customers to be handled by the drone while deciding from where the drone will be launched and where it will be retrieved. Indeed, they optimally solve the h-FSTSP, which is a variation that consists of solving the FSTSP while respecting a given initial cycle h. We present the Lazy Drone Property, which guarantees that only some combinations of nodes for launch and retrieval of the drone need to be considered by algorithms for the h-FSTSP. We also present an algorithm that uses the property, and we show experimental results which corroborate its effectiveness in decreasing the running time of such algorithms. Our algorithm was shown to be more than 84 times faster than the previously best-known ones over the literature benchmark. Moreover, on average, it considered a number of launch and retrieval pairs that is linear on the number of customers, indicating that the algorithm's performance should be sustainable for larger instances.

Millicharged particles, proposed by various extensions of the standard model, can be created in pairs by high-energy photons within nuclear reactors and can interact electromagnetically with electrons in matter. Recently, the existence of a plasmon peak in the interaction cross-section with silicon in the eV range was highlighted as a promising approach to enhance low-energy sensitivities. The CONNIE and Atucha-II reactor neutrino experiments utilize Skipper-CCD sensors, which enable the detection of interactions in the eV range. We present world-leading limits on the charge of millicharged particles within a mass range spanning six orders of magnitude, derived through a comprehensive analysis and the combination of data from both experiments., Comment: 9 pages, 3 figures

Databases are an essential component of modern computing infrastructures and allow efficient access to data stored persistently. Their structure depends on the type and relationships of the stored data elements and on the access pattern. Extending the concept of databases to the quantum domain is expected to increase both the storage efficiency and the access parallelism through quantum superposition. In addition, quantum databases may be seen as the result of a prior state preparation ready to be used by quantum algorithms when needed. On the other hand, limiting factors exist and include entanglement creation, the impossibility of perfect copying due to the no-cloning theorem, and the impossibility of coherently erasing a quantum state. In this work, we introduce quantum databases within the broader context of data structures using classical and quantum data and indexing. In particular, we are interested in quantum databases practical implementation and usability, focusing on the definition of the basic operations needed to create and manipulate data stored in a superposition state. Specifically, we address the case of quantum indexing in combination with classical data. For this scenario, we define the operations for database preparation, extension, removal of indices, writing, and read-out of data, as well as index permutation. We present their algorithmic implementation and highlight their advantages and limitations. Finally, we introduce steps toward defining the same operations in the more general context of quantum indexing and quantum data., Comment: 26 pages, 4 figures

Pruning neural networks, i.e., removing some of their parameters whilst retaining their accuracy, is one of the main ways to reduce the latency of a machine learning pipeline, especially in resource- and/or bandwidth-constrained scenarios. In this context, the pruning technique, i.e., how to choose the parameters to remove, is critical to the system performance. In this paper, we propose a novel pruning approach, called FlexRel and predicated upon combining training-time and inference-time information, namely, parameter magnitude and relevance, in order to improve the resulting accuracy whilst saving both computational resources and bandwidth. Our performance evaluation shows that FlexRel is able to achieve higher pruning factors, saving over 35% bandwidth for typical accuracy targets.

Continual learning focuses on learning non-stationary data distribution without forgetting previous knowledge. Rehearsal-based approaches are commonly used to combat catastrophic forgetting. However, these approaches suffer from a problem called "rehearsal memory overfitting, " where the model becomes too specialized on limited memory samples and loses its ability to generalize effectively. As a result, the effectiveness of the rehearsal memory progressively decays, ultimately resulting in catastrophic forgetting of the learned tasks. We introduce the Adversarially Diversified Rehearsal Memory (ADRM) to address the memory overfitting challenge. This novel method is designed to enrich memory sample diversity and bolster resistance against natural and adversarial noise disruptions. ADRM employs the FGSM attacks to introduce adversarially modified memory samples, achieving two primary objectives: enhancing memory diversity and fostering a robust response to continual feature drifts in memory samples. Our contributions are as follows: Firstly, ADRM addresses overfitting in rehearsal memory by employing FGSM to diversify and increase the complexity of the memory buffer. Secondly, we demonstrate that ADRM mitigates memory overfitting and significantly improves the robustness of CL models, which is crucial for safety-critical applications. Finally, our detailed analysis of features and visualization demonstrates that ADRM mitigates feature drifts in CL memory samples, significantly reducing catastrophic forgetting and resulting in a more resilient CL model. Additionally, our in-depth t-SNE visualizations of feature distribution and the quantification of the feature similarity further enrich our understanding of feature representation in existing CL approaches. Our code is publically available at https://github.com/hikmatkhan/ADRM.

Trigger points are a concept introduced by Mau, Lux, and Westheuser (2023) to study qualitative focus group interviews and understand polarisation in Germany. When people communicate, trigger points represent moments when individuals feel that their understanding of what is fair, normal, or appropriate in society is questioned. In the original studies, individuals react affectively to such triggers and show strong and negative emotional responses. In this paper, we introduce the first systematic study of the large-scale effect of individual words as trigger points by analysing a large amount of social media posts. We examine online deliberations on Reddit between 2020 and 2022 and collect >100 million posts from subreddits related to a set of words identified as trigger points in UK politics. We find that such trigger words affect user engagement and have noticeable consequences on animosity in online discussions. We share empirical evidence of trigger words causing animosity, and how they provide incentives for hate speech, adversarial debates, and disagreements. Our work is the first to introduce trigger points to computational studies of online communication. Our findings are relevant to researchers interested in online harms and who examine how citizens debate politics and society in light of affective polarisation.

This paper aims to enrich the capabilities of existing deep learning-based automated valuation models through an efficient graph representation of peer dependencies, thus capturing intricate spatial relationships. In particular, we develop two novel graph neural network models that effectively identify sequences of neighboring houses with similar features, employing different message passing algorithms. The first strategy consider standard spatial graph convolutions, while the second one utilizes transformer graph convolutions. This approach confers scalability to the modeling process. The experimental evaluation is conducted using a proprietary dataset comprising approximately 200,000 houses located in Santiago, Chile. We show that employing tailored graph neural networks significantly improves the accuracy of house price prediction, especially when utilizing transformer convolutional message passing layers., Comment: 18 pages, 3 figures, Submitted to Expert Systems with Applications

Information literacy (IL) involves a group of competences and fundamental skills in the 21st century. Today, society operates around information, which is challenging considering the vast amount of content available online. People must be capable of searching, critically assessing, making sense of, and communicating information. This set of competences must be properly developed since childhood, especially if considering early age access to online resources. To better understand the evolution and current status of IL development and assessment at school (K-12) level, we conducted a systematic literature review based on the guidelines established by the PRISMA statement. Our review led us to an initial set of 1,234 articles, from which 53 passed the inclusion criteria. These articles were used to address six research questions focused on IL definitions, skills, standards, and assessment tools. Our review shows IL evolution over the years and how it has been formalisedthrough definitions and standards. These findings reveal key gaps that must be addressed in order to advance the field further. Keywords: Elementary education, Information literacy, Secondary education, 21st Century abilities.

For at least 40 years, there has been debate and disagreement as to the role of mathematics in the computer science curriculum. This paper presents the results of an analysis of the math requirements of 199 Computer Science BS/BA degrees from 158 U.S. universities, looking not only at which math courses are required, but how they are used as prerequisites (and corequisites) for computer science (CS) courses. Our analysis shows that while there is consensus that discrete math is critical for a CS degree, and further that calculus is almost always required for the BS in CS, there is little consensus as to when a student should have mastered these subjects. Based on our analysis of how math requirements impact access, retention and on-time degree completion for the BS and the BA in CS, we provide several recommendations for CS departments to consider., Comment: 13 pages, accepted to Communications of the ACM

Intersection crossing represents one of the most dangerous sections of the road infrastructure and Connected Vehicles (CVs) can serve as a revolutionary solution to the problem. In this work, we present a novel framework that detects preemptively collisions at urban crossroads, exploiting the Multi-access Edge Computing (MEC) platform of 5G networks. At the MEC, an Intersection Manager (IM) collects information from both vehicles and the road infrastructure to create a holistic view of the area of interest. Based on the historical data collected, the IM leverages the capabilities of an encoder-decoder recurrent neural network to predict, with high accuracy, the future vehicles' trajectories. As, however, accuracy is not a sufficient measure of how much we can trust a model, trajectory predictions are additionally associated with a measure of uncertainty towards confident collision forecasting and avoidance. Hence, contrary to any other approach in the state of the art, an uncertainty-aware collision prediction framework is developed that is shown to detect well in advance (and with high reliability) if two vehicles are on a collision course. Subsequently, collision detection triggers a number of alarms that signal the colliding vehicles to brake. Under real-world settings, thanks to the preemptive capabilities of the proposed approach, all the simulated imminent dangers are averted., Comment: Accepted in IEEE Transactions on Intelligent Vehicles

The efforts on the development, standardization and improvements to communication systems towards 5G Advanced and 6G are on track to provide benefits such as an unprecedented level of connectivity and performance, enabling a diverse range of vertical services. The full integration of non-terrestrial components into 6G plays a pivotal role in realizing this paradigm shift towards ubiquitous communication and global coverage. However, this integration into 6G brings forth a set of its own challenges, particularly in Radio Access Technologies (RATs). To this end, this paper comprehensively discusses those challenges at different levels of RATs and proposes the corresponding potential emerging advancements in the realm of 6G NTN. In particular, the focus is on advancing the prospective aspects of Radio Resource Management (RRM), spectral coexistence in terrestrial and non-terrestrial components and flexible waveform design solutions to combat the impediments. This discussion with a specific focus on emerging advancements in 6G NTN RATs is critical for shaping the next generation networks and potentially relevant in contributing the part in standardization in forthcoming releases, Comment: accepted in 2024 EuCNC and 6G Summit, Antwerp, Belgium, 3_6 June 2024

Artificial intelligence (AI) and neuroscience share a rich history, with advancements in neuroscience shaping the development of AI systems capable of human-like knowledge retention. Leveraging insights from neuroscience and existing research in adversarial and continual learning, we introduce a novel framework comprising two core concepts: feature distillation and re-consolidation. Our framework, named Robust Rehearsal, addresses the challenge of catastrophic forgetting inherent in continual learning (CL) systems by distilling and rehearsing robust features. Inspired by the mammalian brain's memory consolidation process, Robust Rehearsal aims to emulate the rehearsal of distilled experiences during learning tasks. Additionally, it mimics memory re-consolidation, where new experiences influence the integration of past experiences to mitigate forgetting. Extensive experiments conducted on CIFAR10, CIFAR100, and real-world helicopter attitude datasets showcase the superior performance of CL models trained with Robust Rehearsal compared to baseline methods. Furthermore, examining different optimization training objectives-joint, continual, and adversarial learning-we highlight the crucial role of feature learning in model performance. This underscores the significance of rehearsing CL-robust samples in mitigating catastrophic forgetting. In conclusion, aligning CL approaches with neuroscience insights offers promising solutions to the challenge of catastrophic forgetting, paving the way for more robust and human-like AI systems.

Transition states (TSs) are transient structures that are key in understanding reaction mechanisms and designing catalysts but challenging to be captured in experiments. Alternatively, many optimization algorithms have been developed to search for TSs computationally. Yet the cost of these algorithms driven by quantum chemistry methods (usually density functional theory) is still high, posing challenges for their applications in building large reaction networks for reaction exploration. Here we developed React-OT, an optimal transport approach for generating unique TS structures from reactants and products. React-OT generates highly accurate TS structures with a median structural root mean square deviation (RMSD) of 0.053{\AA} and median barrier height error of 1.06 kcal/mol requiring only 0.4 second per reaction. The RMSD and barrier height error is further improved by roughly 25% through pretraining React-OT on a large reaction dataset obtained with a lower level of theory, GFN2-xTB. We envision the great accuracy and fast inference of React-OT useful in targeting TSs when exploring chemical reactions with unknown mechanisms., Comment: 5 figures, 1 table

Establish optimal cut points plays a crucial role in epidemiology and biomarker discovery, enabling the development of effective and practical clinical decision criteria. While there is extensive literature to define optimal cut off over scalar biomarkers, there is a notable lack of general methodologies for analyzing statistical objects in more complex spaces of functions and graphs, which are increasingly relevant in digital health applications. This paper proposes a new general methodology to define optimal cut points for random objects in separable Hilbert spaces. The paper is motivated by the need for creating new clinical rules for diabetes mellitus disease, exploiting the functional information of a continuous diabetes monitor (CGM) as a digital biomarker. More specifically, we provide the functional cut off to identify diabetes cases with CGM information based on glucose distributional functional representations.