Search

Carrying the insights of conditional probability to the quantum realm is notoriously difficult due to the non-commutative nature of quantum observables. Nevertheless, conditional expectations on von Neumann algebras have played a significant role in the development of quantum information theory, and especially the study of quantum error correction. In quantum gravity, it has been suggested that conditional expectations may be used to implement the holographic map algebraically, with quantum error correction underlying the emergence of spacetime through the generalized entropy formula. However, the requirements for exact error correction are almost certainly too strong for realistic theories of quantum gravity. In this note, we present a relaxed notion of quantum conditional expectation which implements approximate error correction. We introduce a generalization of Connes' spatial theory adapted to completely positive maps, and derive a chain rule allowing for the non-commutative factorization of relative modular operators into a marginal and conditional part, constituting a quantum Bayes' law. This allows for an exact quantification of the information gap occurring in the data processing inequality for arbitrary quantum channels. When applied to algebraic inclusions, this also provides an approach to factorizing the entropy of states into a sum of terms which, in the gravitational context, may be interpreted as a generalized entropy. We illustrate that the emergent area operator is fully non-commutative rather than central, except under the conditions of exact error correction. We provide some comments on how this result may be used to construct a fully algebraic quantum extremal surface prescription and to probe the quantum nature of black holes., Comment: V1: 30 pages, 1 figure

In this paper, using the ensemble-averaged theory, we define the thermodynamic free energy of Einstein-Gauss-Bonnet (EGB) black holes in anti-de Sitter (AdS) spacetime. This approach derives the gravitational partition function by incorporating non-saddle geometries besides the classical solutions. Unlike the sharp transition points seen in free energy calculated via saddle-point approximation, the ensemble-averaged free energy plotted against temperature shows a smoother behavior, suggesting that black hole phase transitions may be viewed as a small $G_N$ (Newton's gravitational constant) limit of the ensemble theory. This is similar to the behavior of black hole solutions in Einstein's gravity theory in AdS spacetime. We have obtained an expression for the quantum-corrected free energy for EGB-AdS black holes, and in the six-dimensional case, we observe a well-defined local minimum after the transition temperature which was absent in the earlier analysis of the classical free energy landscape. Furthermore, we expand the ensemble-averaged free energy in powers of $G_N$ to identify non-classical contributions. Our findings indicate that the similarities in the thermodynamic behavior between five-dimensional EGB-AdS and Reissner-Nordstr\"om-AdS (RN-AdS) black holes, as well as between six-dimensional EGB-AdS and Schwarzschild-AdS black holes, extend beyond the classical regime., Comment: 8 pages, 9 figures

In this study, we investigate gravitational lensing within modified gravity frameworks, focusing on the Hu-Sawicki $f(R)$ and normal branch Dvali-Gabadadze-Porrati (nDGP) models, and we compare these results with those obtained from general relativity (GR). Our results reveal that both modified gravity models consistently enhance key lensing parameters relative to GR, including the Einstein radius, lensing optical depth, and time delays. Notably, we find that the Hu-Sawicki $f(R)$ and nDGP models yield significantly larger Einstein radii and higher lensing probabilities, especially at greater redshifts, indicating an increased likelihood of lensing events under modified gravity. Our analysis of time delays further shows that the broader mass distributions in these frameworks lead to pronounced differences in high-mass lens systems, providing potential observational markers of modified gravity. Additionally, we observe amplified magnification factors in wave optics regimes, highlighting the potential for gravitational wave (GW) lensing to differentiate modified gravity effects from GR predictions. Through these findings, we propose modified gravity theories as compelling alternatives to GR in explaining cosmic phenomena, with promising implications for future high-precision gravitational lensing surveys., Comment: 16 Pages; 6 Figures, Fixed some typos

Traditional machine learning approaches assume that data comes from a single generating mechanism, which may not hold for most real life data. In these cases, the single mechanism assumption can result in suboptimal performance. We introduce a clustering framework that eliminates this assumption by grouping the data according to the relations between the features and the target values and we obtain multiple separate models to learn different parts of the data. We further extend our framework to applications having streaming data where we produce outcomes using an ensemble of models. For this, the ensemble weights are updated based on the incoming data batches. We demonstrate the performance of our approach over the widely-studied real life datasets, showing significant improvements over the traditional single-model approaches.

Robotic platforms provide repeatable and precise tool positioning that significantly enhances retinal microsurgery. Integration of such systems with intraoperative optical coherence tomography (iOCT) enables image-guided robotic interventions, allowing to autonomously perform advanced treatment possibilities, such as injecting therapeutic agents into the subretinal space. Yet, tissue deformations due to tool-tissue interactions are a major challenge in autonomous iOCT-guided robotic subretinal injection, impacting correct needle positioning and, thus, the outcome of the procedure. This paper presents a novel method for autonomous subretinal injection under iOCT guidance that considers tissue deformations during the insertion procedure. This is achieved through real-time segmentation and 3D reconstruction of the surgical scene from densely sampled iOCT B-scans, which we refer to as B5-scans, to monitor the positioning of the instrument regarding a virtual target layer defined at a relative position between the ILM and RPE. Our experiments on ex-vivo porcine eyes demonstrate dynamic adjustment of the insertion depth and overall improved accuracy in needle positioning compared to previous autonomous insertion approaches. Compared to a 35% success rate in subretinal bleb generation with previous approaches, our proposed method reliably and robustly created subretinal blebs in all our experiments.

Graph convolutional networks (GCNs) are an effective skeleton-based human action recognition (HAR) technique. GCNs enable the specification of CNNs to a non-Euclidean frame that is more flexible. The previous GCN-based models still have a lot of issues: (I) The graph structure is the same for all model layers and input data., Comment: This paper accepted in Computers in Human Behavior Journal

The purpose of this study was to explore Moroccan pre-service elementary teachers' attitudes toward integrated science, technology, engineering, and mathematics (STEM) education and the use of mobile devices in integrated STEM education. The research sample was selected using convenience sampling. Data were collected from 226 pre-service teachers in the Bachelor of Education Elementary Specialty (BEES) using a 28-item questionnaire. The validity of the items was tested by factor analysis using the extraction method of principal component analysis with varimax rotation. Reliability tests for the different constructs were conducted by calculating Cronbach's alpha. Frequency, mean, standard deviation and Mann-Whitney tests were used to analyze the data. The results revealed that pre-service elementary teachers have generally neutral attitudes toward integrated STEM education, and they also showed that pre-service teachers' attitudes toward integrated STEM education do not depend on gender or grade level. However, these attitudes are dependent on pre-university studies. Pre-service teachers with a scientific background have significantly more positive attitudes toward integrated STEM education than their counterparts with a literary background. Furthermore, the results of this study also revealed that pre-service teachers have positive attitudes toward the use of mobile devices in integrated STEM education, and these attitudes are not dependent on gender, grade level, or pre-university studies.

The drive toward automating cellular network operations has grown with the increasing complexity of these systems. Despite advancements, full autonomy currently remains out of reach due to reliance on human intervention for modeling network behaviors and defining policies to meet target requirements. Network Digital Twins (NDTs) have shown promise in enhancing network intelligence, but the successful implementation of this technology is constrained by use case-specific architectures, limiting its role in advancing network autonomy. A more capable network intelligence, or "telecommunications brain", is needed to enable seamless, autonomous management of cellular network. Large Language Models (LLMs) have emerged as potential enablers for this vision but face challenges in network modeling, especially in reasoning and handling diverse data types. To address these gaps, we introduce Hermes, a chain of LLM agents that uses "blueprints" for constructing NDT instances through structured and explainable logical steps. Hermes allows automatic, reliable, and accurate network modeling of diverse use cases and configurations, thus marking progress toward fully autonomous network operations.

Detecting Beyond Standard Model (BSM) signals in high-energy particle collisions presents significant challenges due to complex data and the need to differentiate rare signal events from Standard Model (SM) backgrounds. This study investigates the efficacy of deep learning models, specifically Deep Neural Networks (DNNs) and Graph Neural Networks (GNNs), in classifying particle collision events as either BSM signal or background. The research utilized a dataset comprising 214,000 SM background and 10,755 BSM events. To address class imbalance, an undersampling method was employed, resulting in balanced classes. Three models were developed and compared: a DNN and two GNN variants with different graph construction methods. All models demonstrated high performance, achieving Area Under the Receiver Operating Characteristic curve (AUC) values exceeding $94\%$. While the DNN model slightly outperformed GNNs across various metrics, both GNN approaches showed comparable results despite different graph structures. The GNNs' ability to explicitly capture inter-particle relationships within events highlights their potential for BSM signal detection., Comment: Accepted for publication in APPB

The emergence of movable antenna (MA) technology has marked a significant advancement in the field of wireless communication research, paving the way for enhanced connectivity, improved signal quality, and adaptability across diverse environments. By allowing antennas to adjust positions dynamically within a finite area at transceivers, this technology enables more favourable channel conditions, optimizing performance across applications like mobile telecommunications and remote sensing. However, throughout history, the introduction of every new technology has presented opportunities for misuse by malicious individuals. Just as MAs can enhance connectivity, they may also be exploited for disruptive purposes such as jamming. In this paper, we examine the impact of an MA-enhanced jamming system equipped with $M$ antennas in a downlink multi-user communication scenario, where a base station (BS) with $N$ antennas transmits data to $K$ single-antenna users. Simulation results show that an adversary equipped with MAs reduce the system sum rate by $30\%$ more effectively than fixed-position antennas (FPAs). Additionally, MAs increase the outage probability by $25\%$ over FPAs, leading to a $20\%$ increase in the number of users experiencing outages. The highlighted risks posed by unauthorized use of this technology, underscore the urgent need for effective regulations and countermeasures to ensure its secure application., Comment: 6 pages, 4 figures, submitted to IEEE International Conference on Communications

Autism Spectrum Disorder (ASD) is often underdiagnosed in females due to gender-specific symptom differences overlooked by conventional diagnostics. This study evaluates machine learning models, particularly Random Forest and convolutional neural networks, for enhancing ASD diagnosis through structured data and facial image analysis. Random Forest achieved 100% validation accuracy across datasets, highlighting its ability to manage complex relationships and reduce false negatives, which is crucial for early intervention and addressing gender biases. In image-based analysis, MobileNet outperformed the baseline CNN, achieving 87% accuracy, though a 30% validation loss suggests possible overfitting, requiring further optimization for robustness in clinical settings. Future work will emphasize hyperparameter tuning, regularization, and transfer learning. Integrating behavioral data with facial analysis could improve diagnosis for underdiagnosed groups. These findings suggest Random Forest's high accuracy and balanced precision-recall metrics could enhance clinical workflows. MobileNet's lightweight structure also shows promise for resource-limited environments, enabling accessible ASD screening. Addressing model explainability and clinician trust will be vital.

Despite advances with deep learning (DL), automated airway segmentation from chest CT scans continues to face challenges in segmentation quality and generalization across cohorts. To address these, we propose integrating Curriculum Learning (CL) into airway segmentation networks, distributing the training set into batches according to ad-hoc complexity scores derived from CT scans and corresponding ground-truth tree features. We specifically investigate few-shot domain adaptation, targeting scenarios where manual annotation of a full fine-tuning dataset is prohibitively expensive. Results are reported on two large open-cohorts (ATM22 and AIIB23) with high performance using CL for full training (Source domain) and few-shot fine-tuning (Target domain), but with also some insights on potential detrimental effects if using a classic Bootstrapping scoring function or if not using proper scan sequencing., Comment: Under review for 22nd IEEE International Symposium on Biomedical Imaging (ISBI), Houston, TX, USA

We employ deep reinforcement learning methods to investigate shortest-time navigation strategies for smart active Brownian particles (agents) that self-propel through a rotating, localized potential barrier in an otherwise static and viscous fluid background. The particle motion is prescribed to begin from a specified start point and terminate at a specified destination point. The potential barrier is modeled as a repulsive Gaussian potential with a finite range that rotates with given angular velocities around a fixed center within the plane of motion. We use an advantage actor-critic approach to train the agents and demonstrate that, by leveraging this approach, the rotating potential can be utilized for size-based sorting and separation of the agents. In other words, agents of different (hydrodynamic) radii reach the end-point at sufficiently well-separated times, enabling their separation. The efficiency of particle separation in this context is discussed using specific criteria. We also study the effect of rotational Brownian noise on the quality of the proposed size-based sorting mechanism. Additionally, we demonstrate how the use of noise-induced training can enhance this mechanism in a noisy background within the range of parameters explored in our work. Reinforcement learning in the context of active particles thus offers promising avenues to unravel optimal navigation strategies within complex environments, with potential applications that can be utilized in microfluidic settings., Comment: 12 pages, 5 figures

Obfuscation of computer programs has historically been approached either as a practical but \textit{ad hoc} craft to make reverse engineering subjectively difficult, or as a sound theoretical investigation unfortunately detached from the numerous existing constraints of engineering practical systems. In this paper, we propose \textit{instruction decorrelation} as a new approach that makes the instructions of a set of real-world programs appear independent from one another. We contribute: a formal definition of \textit{instruction independence} with multiple instantiations for various aspects of programs; a combination of program transformations that meet the corresponding instances of instruction independence against an honest-but-curious adversary, specifically random interleaving and memory access obfuscation; and an implementation of an interpreter that uses a trusted execution environment (TEE) only to perform memory address translation and memory shuffling, leaving instructions execution outside the TEE. These first steps highlight the practicality of our approach. Combined with additional techniques to protect the content of memory and to hopefully lower the requirements on TEEs, this work could potentially lead to more secure obfuscation techniques that could execute on commonly available hardware.

The joint implementation of Federated learning (FL) and Explainable artificial intelligence (XAI) will allow training models from distributed data and explaining their inner workings while preserving important aspects of privacy. Towards establishing the benefits and tensions associated with their interplay, this scoping review maps those publications that jointly deal with FL and XAI, focusing on publications where an interplay between FL and model interpretability or post-hoc explanations was found. In total, 37 studies met our criteria, with more papers focusing on explanation methods (mainly feature relevance) than on interpretability (mainly algorithmic transparency). Most works used simulated horizontal FL setups involving 10 or fewer data centers. Only one study explicitly and quantitatively analyzed the influence of FL on model explanations, revealing a significant research gap. Aggregation of interpretability metrics across FL nodes created generalized global insights at the expense of node-specific patterns being diluted. 8 papers addressed the benefits of incorporating explanation methods as a component of the FL algorithm. Studies using established FL libraries or following reporting guidelines are a minority. More quantitative research and structured, transparent practices are needed to fully understand their mutual impact and under which conditions it happens., Comment: 16 pages, 11 figures, submitted in IEEE Trans. Knowledge and Data Engineering

This study explores the potential of the Ping 360 sonar device, primarily used for navigation, in detecting complex underwater obstacles. The key motivation behind this research is the device's affordability and open-source nature, offering a cost-effective alternative to more expensive imaging sonar systems. The investigation focuses on understanding the behaviour of the Ping 360 in controlled environments and assessing its suitability for object detection, particularly in scenarios where human operators are unavailable for inspecting offshore structures in shallow waters. Through a series of carefully designed experiments, we examined the effects of surface reflections and object shadows in shallow underwater environments. Additionally, we developed a manually annotated sonar image dataset to train a U-Net segmentation model. Our findings indicate that while the Ping 360 sonar demonstrates potential in simpler settings, its performance is limited in more cluttered or reflective environments unless extensive data pre-processing and annotation are applied. To our knowledge, this is the first study to evaluate the Ping 360's capabilities for complex object detection. By investigating the feasibility of low-cost sonar devices, this research provides valuable insights into their limitations and potential for future AI-based interpretation, marking a unique contribution to the field., Comment: This work is currently under review. This is a pre-print

The Sherrington-Kirkpatrick spin-glass model used the replica symmetry method to find the phase transition of the system. In 1979-1980, Parisi proposed a solution based on replica symmetry breaking (RSB), which allowed him to identify the underlying phases of complex systems such as spin-glasses. Regardless of the method used for detection, the intrinsic phase of a system exists whether or not replicas are considered. We introduce a single replica method of spin-glass phase detection using the field's variation experienced by each spin in a system configuration. This method focuses on a single replica with quenched random couplings. Each spin inevitably observes a different field from the others. Our results show that the mean and variance of fields named "Spontaneous Configurational Field" experienced by spins are suitable indicators to explore different ferromagnetic, paramagnetic, and mixed phases. To classify different phases of the system with defined indicators we have developed an algorithm based on machine learning to analyze the desired samples.

Advancements in genomics technology lead to a rising volume of viral (e.g., SARS-CoV-2) sequence data, resulting in increased usage of machine learning (ML) in bioinformatics. Traditional ML techniques require centralized data collection and processing, posing challenges in realistic healthcare scenarios. Additionally, privacy, ownership, and stringent regulation issues exist when pooling medical data into centralized storage to train a powerful deep learning (DL) model. The Federated learning (FL) approach overcomes such issues by setting up a central aggregator server and a shared global model. It also facilitates data privacy by extracting knowledge while keeping the actual data private. This work proposes a cutting-edge Privacy enhancement through Iterative Collaboration (EPIC) architecture. The network is divided and distributed between local and centralized servers. We demonstrate the EPIC approach to resolve a supervised classification problem to estimate SARS-CoV-2 genomic sequence data lineage without explicitly transferring raw sequence data. We aim to create a universal decentralized optimization framework that allows various data holders to work together and converge to a single predictive model. The findings demonstrate that privacy-preserving strategies can be successfully used with aggregation approaches without materially altering the degree of learning convergence. Finally, we highlight a few potential issues and prospects for study in FL-based approaches to healthcare applications., Comment: Accepted at SIMBig 2024

Tracking the trajectory of tennis players can help camera operators in production. Predicting future movement enables cameras to automatically track and predict a player's future trajectory without human intervention. Predicting future human movement in the context of complex physical tasks is also intellectually satisfying. Swift advancements in sports analytics and the wide availability of videos for tennis have inspired us to propose a novel method called Pose2Trajectory, which predicts a tennis player's future trajectory as a sequence derived from their body joints' data and ball position. Demonstrating impressive accuracy, our approach capitalizes on body joint information to provide a comprehensive understanding of the human body's geometry and motion, thereby enhancing the prediction of the player's trajectory. We use encoder-decoder Transformer architecture trained on the joints and trajectory information of the players with ball positions. The predicted sequence can provide information to help close-up cameras to keep tracking the tennis player, following centroid coordinates. We generate a high-quality dataset from multiple videos to assist tennis player movement prediction using object detection and human pose estimation methods. It contains bounding boxes and joint information for tennis players and ball positions in singles tennis games. Our method shows promising results in predicting the tennis player's movement trajectory with different sequence prediction lengths using the joints and trajectory information with the ball position.

Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom reconfiguration, or routing, is the core mechanism for programming circuits; optimizing this routing can increase processing speeds, reduce decoherence, and enable efficient implementations of highly non-local connections. In this work, we investigate routing models applicable to state-of-the-art neutral atom systems. With routing steps that can operate on multiple atoms in parallel, we prove that current designs require $\Omega(\sqrt N \log N)$ steps to perform certain permutations on 2D arrays with $N$ atoms and provide a protocol that achieves routing in $\mathcal O(\sqrt N \log N)$ steps for any permutation. We also propose a simple experimental upgrade and show that it would reduce the routing cost to $\Theta(\log N)$ steps., Comment: 21 pages, 9 figures

Recently, there has been growing interest in autonomous shipping due to its potential to improve maritime efficiency and safety. The use of advanced technologies, such as artificial intelligence, can address the current navigational and operational challenges in autonomous shipping. In particular, inland waterway transport (IWT) presents a unique set of challenges, such as crowded waterways and variable environmental conditions. In such dynamic settings, the reliability and robustness of autonomous shipping solutions are critical factors for ensuring safe operations. This paper examines the robustness of benchmark deep reinforcement learning (RL) algorithms, implemented for IWT within an autonomous shipping simulator, and their ability to generate effective motion planning policies. We demonstrate that a model-free approach can achieve an adequate policy in the simulator, successfully navigating port environments never encountered during training. We focus particularly on Soft-Actor Critic (SAC), which we show to be inherently more robust to environmental disturbances compared to MuZero, a state-of-the-art model-based RL algorithm. In this paper, we take a significant step towards developing robust, applied RL frameworks that can be generalized to various vessel types and navigate complex port- and inland environments and scenarios., Comment: 5 pages, 4 figures. Will be presented at IEEE RAAI 2024

The Cancer Registry of Norway (CRN) is a part of the Norwegian Institute of Public Health (NIPH) and is tasked with producing statistics on cancer among the Norwegian population. For this task, CRN develops, tests, and evolves a software system called Cancer Registration Support System (CaReSS). It is a complex socio-technical software system that interacts with many entities (e.g., hospitals, medical laboratories, and other patient registries) to achieve its task. For cost-effective testing of CaReSS, CRN has employed EvoMaster, an AI-based REST API testing tool combined with an integrated classical machine learning model. Within this context, we propose Qlinical to investigate the feasibility of using, inside EvoMaster, a Quantum Neural Network (QNN) classifier, i.e., a quantum machine learning model, instead of the existing classical machine learning model. Results indicate that Qlinical can achieve performance comparable to that of EvoClass. We further explore the effects of various QNN configurations on performance and offer recommendations for optimal QNN settings for future QNN developers.

In this work, we start by examining a spherically symmetric black hole within the framework of non-commutative geometry and apply a modified Newman-Janis method to obtain a new rotating solution. We then investigate its consequences, focusing on the horizon structure, ergospheres, and the black hole's angular velocity. Following this, a detailed thermodynamic analysis is performed, covering surface gravity, Hawking temperature, entropy, and heat capacity. We also study geodesic motion, with particular emphasis on null geodesics and their associated radial accelerations. Additionally, the photon sphere and the resulting black hole shadows are explored. Finally, we compute the quasinormal modes for scalar perturbations using the 6th-order WKB approximation., Comment: 35 pages, 16 figures and 2 tables

This paper reports on the theoretical investigation of charged Higgs bosons and their coupling to fermions within the Two Higgs Doublet Model (THDM). The study focuses on the discovery potential of charged Higgs bosons predicted in Types III and IV at the future Circular Hadron-Hadron Collider (FCC-hh) with a center-of-mass energy of (\sqrt{s} = 100) TeV. By analyzing their decays, couplings to fermions, branching ratios, and production cross-section via (pp \rightarrow tH^-), we investigate the signatures of charged Higgs bosons, including kinematical distributions based on the background processes of (b\bar{b}) quarks., Comment: 24 pages, 16 figures, 1 table

We prove that the Kazhdan-Lusztig basis of Specht modules is upper triangular with respect to all generalized Gelfand-Tsetlin bases constructed from any multiplicity-free tower of standard parabolic subgroups., Comment: 10 pages, extended abstract for submission to FPSAC 2025

Enterprise searches require users to have complex knowledge of queries, configurations, and metadata, rendering it difficult for them to access information as needed. Most go-to-market (GTM) platforms utilize advanced search, an interface that enables users to filter queries by various fields using categories or keywords, which, historically, however, has proven to be exceedingly cumbersome, as users are faced with seemingly hundreds of options, fields, and buttons. Consequently, querying with natural language has long been ideal, a notion further empowered by Large Language Models (LLMs). In this paper, we implement and evaluate a solution for the Zoominfo product for sellers, which prompts the LLM with natural language, producing search fields through entity extraction that are then converted into a search query. The intermediary search fields offer numerous advantages for each query, including the elimination of syntax errors, simpler ground truths, and an intuitive format for the LLM to interpret. We paired this pipeline with many advanced prompt engineering strategies, featuring an intricate system message, few-shot prompting, chain-of-thought (CoT) reasoning, and execution refinement. Furthermore, we manually created the ground truth for 500+ natural language queries, enabling the supervised fine-tuning of Llama-3-8B-Instruct and the introduction of sophisticated numerical metrics. Comprehensive experiments with closed, open source, and fine-tuned LLM models were conducted through exact, Jaccard, cosine, and semantic similarity on individual search entities to demonstrate the efficacy of our approach. Overall, the most accurate closed model had an average accuracy of 97% per query, with only one field performing under 90%, with comparable results observed from the fine-tuned models., Comment: 11 pages, 5 figures

This paper introduces a novel approach to urban pathfinding by transforming traditional heuristic-based algorithms into deep learning models that leverage real-time contextual data, such as traffic and weather conditions. We propose two methods: an enhanced A* algorithm that dynamically adjusts routes based on current environmental conditions, and a neural network model that predicts the next optimal path segment using historical and live data. An extensive benchmark was conducted to compare the performance of different deep learning models, including MLP, GRU, LSTM, Autoencoders, and Transformers. Both methods were evaluated in a simulated urban environment in Berlin, with the neural network model outperforming traditional methods, reducing travel times by up to 40%, while the enhanced A* algorithm achieved a 34% improvement. These results demonstrate the potential of deep learning to optimize urban navigation in real time, providing more adaptable and efficient routing solutions.

Security controls are mechanisms or policies designed for cloud based services to reduce risk, protect information, and ensure compliance with security regulations. The development of security controls is traditionally a labor-intensive and time-consuming process. This paper explores the use of Generative AI to accelerate the generation of security controls. We specifically focus on generating Gherkin codes which are the domain-specific language used to define the behavior of security controls in a structured and understandable format. By leveraging large language models and in-context learning, we propose a structured framework that reduces the time required for developing security controls from 2-3 days to less than one minute. Our approach integrates detailed task descriptions, step-by-step instructions, and retrieval-augmented generation to enhance the accuracy and efficiency of the generated Gherkin code. Initial evaluations on AWS cloud services demonstrate promising results, indicating that GenAI can effectively streamline the security control development process, thus providing a robust and dynamic safeguard for cloud-based infrastructures.

Quantum optimal control (QOC) schemes can be employed to enhance the sensitivity of quantum metrology (QM) protocols undergoing Markovian noise, which can limit their precision to a standard quantum limit (SQL)-like scaling. In this paper, we propose a QOC scheme for QM that leverages entanglement and optimized coupling interactions with an ancillary system to provide enhanced metrological performance under general Markovian dynamics. We perform a comparative analysis of our entanglement-enhanced scheme against the unentangled scheme conventionally employed in QOC-enabled QM for varying evolution times and decoherence levels, revealing that the entanglement-enhanced scheme enables significantly better noise performance, even when a noisy ancilla is employed. We further extend our investigation to time-inhomogeneous noise models, specifically focusing on a noisy frequency estimation scenario within a spin-boson bath, and evaluate the protocol's performance under completely dissipative and dephasing dynamics. Our findings indicate that, in certain situations, schemes employing coherent control of a single particle are severely limited. In such cases, employing the entanglement-enhanced scheme can provide improved performance.

Wildfires propagate through intricate interactions between wind, fuel, and terrain, resulting in complex behaviors that pose challenges for accurate predictions. This study investigates the interaction between wind velocity topology and wildfire spread dynamics, aiming to enhance our understanding of wildfire spread patterns. We revisited the non-dimensionalizion of the governing combustion model by incorporating three distinct time scales. This approach revealed two new non-dimensional numbers, contrasting with the conventional non-dimensionalization that considers only a single time scale. Through scaling analysis, we analytically identified the critical determinants of transient wildfire behavior and established a state-neutral curve, indicating where initial wildfires extinguish for specific combinations of the identified non-dimensional numbers. Subsequently, a wildfire transport solver was developed using a finite difference method, integrating compact schemes and implicit-explicit Runge-Kutta methods. We explored the influence of stable and unstable manifolds in wind velocity on wildfire transport under steady wind conditions defined using a saddle-type fixed point flow, emphasizing the role of the non-dimensional numbers. Additionally, we considered the benchmark unsteady double-gyre flow and examined the effect of unsteady wind topology on wildfire propagation, and quantified the wildfire response to varying wind oscillation frequencies and amplitudes using a transfer function approach. The results were compared to Lagrangian coherent structures (LCS) used to characterize the correspondence of manifolds with wildfire propagation. The comprehensive approach of utilizing the manifolds computed from wind topology provides valuable insights into wildfire dynamics across diverse wind scenarios, offering a potential tool for improved predictive modeling and management strategies.

Postdoctoral training is a career stage often described as a demanding and anxiety-laden time when many promising PhDs see their academic dreams slip away due to circumstances beyond their control. We use a unique data set of academic publishing and careers to chart the more or less successful postdoctoral paths. We build a measure of academic success on the citation patterns two to five years into a faculty career. Then, we monitor how students' postdoc positions -- in terms of relocation, change of topic, and early well-cited papers -- relate to their early-career success. One key finding is that the postdoc period seems more important than the doctoral training to achieve this form of success. This is especially interesting in light of the many studies of academic faculty hiring that link Ph.D. granting institutions and hires, omitting the postdoc stage. Another group of findings can be summarized as a Goldilocks principle: it seems beneficial to change one's direction, but not too much.

In the realm of high-energy physics, the longevity of calorimeters is paramount. Our research introduces a deep learning strategy to refine the calibration process of calorimeters used in particle physics experiments. We develop a Wasserstein GAN inspired methodology that adeptly calibrates the misalignment in calorimeter data due to aging or other factors. Leveraging the Wasserstein distance for loss calculation, this innovative approach requires a significantly lower number of events and resources to achieve high precision, minimizing absolute errors effectively. Our work extends the operational lifespan of calorimeters, thereby ensuring the accuracy and reliability of data in the long term, and is particularly beneficial for experiments where data integrity is crucial for scientific discovery.

Animals survive in dynamic environments changing at arbitrary timescales, but such data distribution shifts are a challenge to neural networks. To adapt to change, neural systems may change a large number of parameters, which is a slow process involving forgetting past information. In contrast, animals leverage distribution changes to segment their stream of experience into tasks and associate them with internal task abstracts. Animals can then respond flexibly by selecting the appropriate task abstraction. However, how such flexible task abstractions may arise in neural systems remains unknown. Here, we analyze a linear gated network where the weights and gates are jointly optimized via gradient descent, but with neuron-like constraints on the gates including a faster timescale, nonnegativity, and bounded activity. We observe that the weights self-organize into modules specialized for tasks or sub-tasks encountered, while the gates layer forms unique representations that switch the appropriate weight modules (task abstractions). We analytically reduce the learning dynamics to an effective eigenspace, revealing a virtuous cycle: fast adapting gates drive weight specialization by protecting previous knowledge, while weight specialization in turn increases the update rate of the gating layer. Task switching in the gating layer accelerates as a function of curriculum block size and task training, mirroring key findings in cognitive neuroscience. We show that the discovered task abstractions support generalization through both task and subtask composition, and we extend our findings to a non-linear network switching between two tasks. Overall, our work offers a theory of cognitive flexibility in animals as arising from joint gradient descent on synaptic and neural gating in a neural network architecture.

The Privacy Preserving Federated Learning Document VQA (PFL-DocVQA) competition challenged the community to develop provably private and communication-efficient solutions in a federated setting for a real-life use case: invoice processing. The competition introduced a dataset of real invoice documents, along with associated questions and answers requiring information extraction and reasoning over the document images. Thereby, it brings together researchers and expertise from the document analysis, privacy, and federated learning communities. Participants fine-tuned a pre-trained, state-of-the-art Document Visual Question Answering model provided by the organizers for this new domain, mimicking a typical federated invoice processing setup. The base model is a multi-modal generative language model, and sensitive information could be exposed through either the visual or textual input modality. Participants proposed elegant solutions to reduce communication costs while maintaining a minimum utility threshold in track 1 and to protect all information from each document provider using differential privacy in track 2. The competition served as a new testbed for developing and testing private federated learning methods, simultaneously raising awareness about privacy within the document image analysis and recognition community. Ultimately, the competition analysis provides best practices and recommendations for successfully running privacy-focused federated learning challenges in the future., Comment: 27 pages, 6 figures

The Minimum Volume Covering Ellipsoid (MVCE) problem, characterised by $n$ observations in $d$ dimensions where $n \gg d$, can be computationally very expensive in the big data regime. We apply methods from randomised numerical linear algebra to develop a data-driven leverage score sampling algorithm for solving MVCE, and establish theoretical error bounds and a convergence guarantee. Assuming the leverage scores follow a power law decay, we show that the computational complexity of computing the approximation for MVCE is reduced from $\mathcal{O}(nd^2)$ to $\mathcal{O}(nd + \text{poly}(d))$, which is a significant improvement in big data problems. Numerical experiments demonstrate the efficacy of our new algorithm, showing that it substantially reduces computation time and yields near-optimal solutions., Comment: 20 pages, 3 figures

This paper studies games of voluntary disclosure in which a sender discloses evidence to a receiver who then offers an allocation and transfers. We characterize the set of equilibrium payoffs in this setting. Our main result establishes that any payoff profile that can be achieved through information design can also be supported by an equilibrium of the disclosure game. Hence, our analysis suggests an equivalence between disclosure and design in these settings. We apply our results to monopoly pricing, bargaining over policies, and insurance markets.

Contrastive learning attempts to learn representations from un-labeled data; it does so via a loss function that encourages the embedding of a point to be close to that of its augmentations, and far from the embeddings of random other points. This simple idea performs remarkably well, yet it is not precisely theoretically understood why this is the case. In this paper we analyze contrastive learning (specifically, the InfoNCE loss) in a natural context: dimensionality reduction in Gaussian Mixture Models. Crucially, we define an augmentation of a data point as being another independent draw from the same underlying mixture component. We show that vanilla InfoNCE is able to find the optimal lower-dimensional subspace even when the Gaussians are not isotropic -- something that vanilla spectral techniques cannot do. We further extend our analyses to multi-modal contrastive learning algorithms (e.g., CLIP). In this setting we show that contrastive learning learns the subset of fisher-optimal subspace, effectively filtering out all the noise from the learnt representations.

Understanding the temporal properties of longitudinal data is critical for identifying trends, predicting future events, and making informed decisions in any field where temporal data is analysed, including health and epidemiology, finance, geosciences, and social sciences. Traditional time-series analysis techniques often fail to capture the complexity of irregular temporal patterns present in such data. To address this gap, we introduce bursty_dynamics, a Python package that enables the quantification of bursty dynamics through the calculation of the Burstiness Parameter (BP) and Memory Coefficient (MC). In temporal data, BP and MC provide insights into the irregularity and temporal dependencies within event sequences, shedding light on complex patterns of disease aetiology, human behaviour, or other information diffusion over time. An event train detection method is also implemented to identify clustered events occurring within a specified time interval, allowing for more focused analysis with reduced noise. With built-in visualisation tools, bursty_dynamics provides an accessible yet powerful platform for researchers to explore and interpret the temporal dynamics of longitudinal data. This paper outlines the core functionalities of the package, demonstrates its applications in diverse research domains, and discusses the advantages of using BP, MC, and event train detection for enhanced temporal data analysis.

Fun acts as a catalyst for learning by enhancing motivation, active engagement and knowledge retention. As social robots gain traction as educational tools, understanding how their unique affordances can be leveraged to cultivate fun becomes crucial. This research investigates the concept of fun in educational games involving social robots to support the design of REMind:a robot-mediated role-play game aimed at encouraging bystander intervention against peer bullying among children. To incorporate fun elements into design of REMind, we conducted a user-centered Research through Design (RtD) study with focus groups of children to gain a deeper understanding of their perceptions of fun. We analyzed children's ideas by using Framework Analysis and leveraging LeBlanc's Taxonomy of Game Pleasures and identified 28 elements of fun that can be incorporated into robot-mediated games. We present our observations, discuss their impact on REMind's design, and offer recommendations for designing fun educational games using social robots., Comment: This is a pre-print of a manuscript that was accepted to International Conference on Social Robotics 2024 (ICSR'24 + AI), 2024, which was held in Odense, Denmark

In this work, we statistically analyze the radar cross section (RCS) of different test targets present in an indoor factory (InF) scenario specified by 3rd Generation Partnership Project considering bistatic configuration. The test targets that we consider are drones, humans, quadruped robot and a robotic arm. We consider two drones of different sizes and five human subjects for RCS characterization. For the drones, we measure the RCS when they are are flying over a given point and while they are rotating over the same point. For human subjects, we measure the RCS while standing still, sitting still and walking. For quadruped robot and robotic arm, we consider a continuous random motion emulating different tasks which they are supposed to perfom in typical InF scenario. We employ different distributions, such as Normal, Lognormal, Gamma, Rician, Weibull, Rayleigh and Exponential to fit the measurement data. From the statistical analysis, we gather that Lognormal distribution can fit all the considered targets in the InF scenario., Comment: the results are not correct

Quantum Error Correction (QEC) is essential for future quantum computers due to its ability to exponentially suppress physical errors. The surface code is a leading error-correcting code candidate because of its local topological structure, experimentally achievable thresholds, and support for universal gate operations with magic states. However, its physical overhead scales quadratically with number of correctable errors. Conversely, quantum low-density parity-check (qLDPC) codes offer superior scaling but lack, on their own, a clear path to universal logical computation. Therefore, it is becoming increasingly evident is becoming that there are significant advantages to designing architectures using multiple codes. Heterogeneous architectures provide a clear path to universal logical computation as well as the ability to access different resource trade offs. To address this, we propose integrating the surface code and gross code using an ancilla bus for inter-code data movement. This approach involves managing trade-offs, including qubit overhead, a constrained instruction set, and gross code (memory) routing and management. While our focus is on the gross-surface code architecture, our method is adaptable to any code combination and the constraints generated by that specific architecture. Motivated by the potential reduction of physical qubit overhead, an ever important feature in the realization of fault tolerant computation, we perform the first full system study of heterogeneous error-correcting codes, discovering architectural trade-offs and optimizing around them. We demonstrate physical qubit reductions of up to 6.42x when executing an algorithm to a specific logical error rate, at the cost of up to a 3.43x increase in execution time.

We explore the applicability of the transcorrelated method to the elements in the second row of the periodic table. We use transcorrelated Hamiltonians in conjunction with full configuration interaction quantum Monte Carlo and coupled cluster techniques to obtain total energies and ionisation potentials, investigating their dependence on the nature and size of the basis sets used. Transcorrelation accelerates convergence to the complete basis set limit relative to conventional approaches, and chemically accurate results can generally be obtained with the cc-pVTZ basis, even with a frozen Ne core in the post-Hartree--Fock treatment., Comment: 11 pages, 5 figures

Retrieval augmented generation (RAG) models, which integrate large-scale pre-trained generative models with external retrieval mechanisms, have shown significant success in various natural language processing (NLP) tasks. However, applying RAG models in Persian language as a low-resource language, poses distinct challenges. These challenges primarily involve the preprocessing, embedding, retrieval, prompt construction, language modeling, and response evaluation of the system. In this paper, we address the challenges towards implementing a real-world RAG system for Persian language called PersianRAG. We propose novel solutions to overcome these obstacles and evaluate our approach using several Persian benchmark datasets. Our experimental results demonstrate the capability of the PersianRAG framework to enhance question answering task in Persian.

IUMENTA (Latin for livestock) is an innovative software framework designed to construct and simulate digital twins of animals. By leveraging the powerful capability of the Open Digital Twin Platform (ODTP) alongside advanced software sensors, IUMENTA offers researchers a user-friendly tool to seamlessly develop adaptive digital replicas of animal-based processes. This framework establishes a dynamic ecosystem that integrates insights from diverse experiments, consequently enhancing our understanding of animal behavioural and physiological responses. Through real-time tracking of an animal's energy balance. IUMENTA provides valuable insights into metabolic rates, nutritional needs, emotional states, and overall well-being of animals. In this article, we explore the application of the IUMENTA framework in developing a digital twin focused on the animal's energy balance. IUMENTA includes the EnergyTag system, a state-of-the-art wearable software sensor, which facilitates real-time monitoring of energy expenditure, allowing for continuous updates and personalisation of the energy balance digital twin., Comment: 9 pages, 7 figures, Submitted to PerCom 2025

Student disengagement in online learning has become a critical challenge, particularly post-pandemic. This review explores deep learning techniques used to detect disengagement, emphasizing computer vision and affective computing as effective approaches. We examine recent studies focusing on facial expressions, eye movements, and posture to assess student attention, along with non-face-based indicators like mouse activity. A systematic review of 38 selected studies outlines the indicators, methods, and models employed in this field, providing insights for future research on real-time engagement monitoring in online classrooms

Touch is a crucial sensing modality that provides rich information about object properties and interactions with the physical environment. Humans and robots both benefit from using touch to perceive and interact with the surrounding environment (Johansson and Flanagan, 2009; Li et al., 2020; Calandra et al., 2017). However, no existing systems provide rich, multi-modal digital touch-sensing capabilities through a hemispherical compliant embodiment. Here, we describe several conceptual and technological innovations to improve the digitization of touch. These advances are embodied in an artificial finger-shaped sensor with advanced sensing capabilities. Significantly, this fingertip contains high-resolution sensors (~8.3 million taxels) that respond to omnidirectional touch, capture multi-modal signals, and use on-device artificial intelligence to process the data in real time. Evaluations show that the artificial fingertip can resolve spatial features as small as 7 um, sense normal and shear forces with a resolution of 1.01 mN and 1.27 mN, respectively, perceive vibrations up to 10 kHz, sense heat, and even sense odor. Furthermore, it embeds an on-device AI neural network accelerator that acts as a peripheral nervous system on a robot and mimics the reflex arc found in humans. These results demonstrate the possibility of digitizing touch with superhuman performance. The implications are profound, and we anticipate potential applications in robotics (industrial, medical, agricultural, and consumer-level), virtual reality and telepresence, prosthetics, and e-commerce. Toward digitizing touch at scale, we open-source a modular platform to facilitate future research on the nature of touch., Comment: 28 pages

Designing causal bandit algorithms depends on two central categories of assumptions: (i) the extent of information about the underlying causal graphs and (ii) the extent of information about interventional statistical models. There have been extensive recent advances in dispensing with assumptions on either category. These include assuming known graphs but unknown interventional distributions, and the converse setting of assuming unknown graphs but access to restrictive hard/$\operatorname{do}$ interventions, which removes the stochasticity and ancestral dependencies. Nevertheless, the problem in its general form, i.e., unknown graph and unknown stochastic intervention models, remains open. This paper addresses this problem and establishes that in a graph with $N$ nodes, maximum in-degree $d$ and maximum causal path length $L$, after $T$ interaction rounds the regret upper bound scales as $\tilde{\mathcal{O}}((cd)^{L-\frac{1}{2}}\sqrt{T} + d + RN)$ where $c>1$ is a constant and $R$ is a measure of intervention power. A universal minimax lower bound is also established, which scales as $\Omega(d^{L-\frac{3}{2}}\sqrt{T})$. Importantly, the graph size $N$ has a diminishing effect on the regret as $T$ grows. These bounds have matching behavior in $T$, exponential dependence on $L$, and polynomial dependence on $d$ (with the gap $d\ $). On the algorithmic aspect, the paper presents a novel way of designing a computationally efficient CB algorithm, addressing a challenge that the existing CB algorithms using soft interventions face., Comment: 42 pages, 8 figures

Deep learning models, in particular \textit{image} models, have recently gained generalisability and robustness. %are becoming more general and robust by the day. In this work, we propose to exploit such advances in the realm of \textit{video} classification. Video foundation models suffer from the requirement of extensive pretraining and a large training time. Towards mitigating such limitations, we propose "\textit{Attention Map (AM) Flow}" for image models, a method for identifying pixels relevant to motion in each input video frame. In this context, we propose two methods to compute AM flow, depending on camera motion. AM flow allows the separation of spatial and temporal processing, while providing improved results over combined spatio-temporal processing (as in video models). Adapters, one of the popular techniques in parameter efficient transfer learning, facilitate the incorporation of AM flow into pretrained image models, mitigating the need for full-finetuning. We extend adapters to "\textit{temporal processing adapters}" by incorporating a temporal processing unit into the adapters. Our work achieves faster convergence, therefore reducing the number of epochs needed for training. Moreover, we endow an image model with the ability to achieve state-of-the-art results on popular action recognition datasets. This reduces training time and simplifies pretraining. We present experiments on Kinetics-400, Something-Something v2, and Toyota Smarthome datasets, showcasing state-of-the-art or comparable results.

Capturing a video's meaning and critical concepts by analyzing the subtle details is a fundamental yet challenging task in video captioning. Identifying the dominant emotional tone in a video significantly enhances the perception of its context. Despite a strong emphasis on video captioning, existing models often need to adequately address emotional themes, resulting in suboptimal captioning results. To address these limitations, this paper proposes a novel Semantic Processing and Emotion-informed video-Captioning Through Retrieval and Understanding Modalities (SPECTRUM) framework to empower the generation of emotionally and semantically credible captions. Leveraging our pioneering structure, SPECTRUM discerns multimodal semantics and emotional themes using Visual Text Attribute Investigation (VTAI) and determines the orientation of descriptive captions through a Holistic Concept-Oriented Theme (HCOT), expressing emotionally-informed and field-acquainted references. They exploit video-to-text retrieval capabilities and the multifaceted nature of video content to estimate the emotional probabilities of candidate captions. Then, the dominant theme of the video is determined by appropriately weighting embedded attribute vectors and applying coarse- and fine-grained emotional concepts, which define the video's contextual alignment. Furthermore, using two loss functions, SPECTRUM is optimized to integrate emotional information and minimize prediction errors. Extensive experiments on the EmVidCap, MSVD, and MSRVTT video captioning datasets demonstrate that our model significantly surpasses state-of-the-art methods. Quantitative and qualitative evaluations highlight the model's ability to accurately capture and convey video emotions and multimodal attributes.

This paper presents a comprehensive hazard analysis, risk assessment, and loss evaluation for an Evasive Minimum Risk Maneuvering (EMRM) system designed for autonomous vehicles. The EMRM system is engineered to enhance collision avoidance and mitigate loss severity by drawing inspiration from professional drivers who perform aggressive maneuvers while maintaining stability for effective risk mitigation. Recent advancements in autonomous vehicle technology demonstrate a growing capability for high-performance maneuvers. This paper discusses a comprehensive safety verification process and establishes a clear safety goal to enhance testing validation. The study systematically identifies potential hazards and assesses their risks to overall safety and the protection of vulnerable road users. A novel loss evaluation approach is introduced, focusing on the impact of mitigation maneuvers on loss severity. Additionally, the proposed mitigation integrity level can be used to verify the minimum-risk maneuver feature. This paper applies a verification method to evasive maneuvering, contributing to the development of more reliable active safety features in autonomous driving systems.