Search

Iterative methods based on tensors have emerged as powerful tools for solving tensor equations, and have significantly advanced across multiple disciplines. In this study, we propose two-step tensor-based iterative methods to solve the tensor equations $\mathcal{A}_{*M}\mathcal{X}_{*M}\mathcal{B}=\mathcal{C}$ by incorporating preconditioning techniques and parametric optimization to enhance convergence properties. The theoretical results were complemented by comprehensive numerical experiments that demonstrated the computational efficiency of the proposed two-step parametrized iterative methods. The convergence criterion for parameter selection has been studied and a few numerical experiments have been conducted for optimal parameter selection. Effective algorithms were proposed to compute iterative methods based on two-step parameterized tensors, and the results are promising. In addition, we discuss the solution of the Sylvester equations and a regularized least-squares solution for image deblurring problems.

Recent advancements in particle physics demand pixel detectors that can withstand increased luminosity in the future collider experiments. In response, MALTA, a novel monolithic active pixel detector, has been developed with a cutting-edge readout architecture. This new class of monolithic pixel detectors is found to have exceptional radiation tolerance, superior hit rates, higher resolution and precise timing resolution, making them ideally suited for experiments at the LHC. To optimize the performance of these sensors before their deployment in actual detectors, comprehensive electrical characterization has been conducted. This study also includes comparative DAC analyses among sensors of varying thicknesses, providing crucial insights for performance enhancement. For the further understanding of the effect of radiation, the sensors are being exposed to different fluence using high intensity X-ray source., Comment: 5 pages, 6 figures, 11th International Workshop on Semiconductor Pixel Detectors for Particles and Imaging

This paper introduces Quantum-SMOTEV2, an advanced variant of the Quantum-SMOTE method, leveraging quantum computing to address class imbalance in machine learning datasets without K-Means clustering. Quantum-SMOTEV2 synthesizes data samples using swap tests and quantum rotation centered around a single data centroid, concentrating on the angular distribution of minority data points and the concept of angular outliers (AOL). Experimental results show significant enhancements in model performance metrics at moderate SMOTE levels (30-36%), which previously required up to 50% with the original method. Quantum-SMOTEV2 maintains essential features of its predecessor (arXiv:2402.17398), such as rotation angle, minority percentage, and splitting factor, allowing for tailored adaptation to specific dataset needs. The method is scalable, utilizing compact swap tests and low depth quantum circuits to accommodate a large number of features. Evaluation on the public Cell-to-Cell Telecom dataset with Random Forest (RF), K-Nearest Neighbours (KNN) Classifier, and Neural Network (NN) illustrates that integrating Angular Outliers modestly boosts classification metrics like accuracy, F1 Score, AUC-ROC, and AUC-PR across different proportions of synthetic data, highlighting the effectiveness of Quantum-SMOTEV2 in enhancing model performance for edge cases.

While mutually interacting spin Hall nano-oscillators (SHNOs) hold great promise for wireless communication, neural networks, neuromorphic computing, and Ising machines, the highest number of synchronized SHNOs remains limited to $N$ = 64. Using ultra-narrow 10 and 20-nm nano-constrictions in W-Ta/CoFeB/MgO trilayers, we demonstrate mutually synchronized SHNO networks of up to $N$ = 105,000. The microwave power and quality factor scale as $N$ with new record values of 9 nW and $1.04 \times 10^6$, respectively. An unexpectedly strong array size dependence of the frequency-current tunability is explained by magnon exchange between nano-constrictions and magnon losses at the array edges, further corroborated by micromagnetic simulations and Brillouin light scattering microscopy. Our results represent a significant step towards viable SHNO network applications in wireless communication and unconventional computing., Comment: 15 pages

Quantum key distribution (QKD) has emerged as a critical component of secure communication in the quantum era, ensuring information-theoretic security. Despite its potential, there are issues in optimizing key generation rates, enhancing security, and incorporating QKD into practical implementations. This research introduces a unique framework for incorporating quantum machine learning (QML) algorithms, notably quantum reinforcement learning (QRL) and quantum neural networks (QNN), into QKD protocols to improve key generation performance. Here, we present two novel QRL-based algorithms, QRL-V.1 and QRL-V.2, and propose the standard BB84 and B92 protocols by integrating QNN algorithms to form QNN-BB84 and QNN-B92. Furthermore, we combine QNN with the above QRL-based algorithms to produce QNN-QRL-V.1 and QNN-QRL-V.2. These unique algorithms and established protocols are compared using evaluation metrics such as accuracy, precision, recall, F1 score, confusion matrices, and ROC curves. The results from the QNN-based proposed algorithms show considerable improvements in key generation quality. The existing and proposed models are investigated in the presence of different noisy channels to check their robustness. The proposed integration of QML algorithms into QKD protocols and their noisy analysis create a new paradigm for efficient key generation, which advances the practical implementation of QKD systems., Comment: 17 pages, 11 Figures

MALTA2 is a depleted monolithic active pixel sensor (DMAPS) designed for tracking at high rates and typically low detection threshold of $\sim150\,\mathrm{e^-}$. A precise knowledge of the threshold is crucial to understanding the charge collection in the pixel and specifying the environment for sensor application. A simple procedure is developed to calibrate the threshold to unit electrons making use of a dedicated charge injection circuit and an Fe-55 source with dominant charge deposition of $1600\, \mathrm{e^-}$. The injection voltage is determined which corresponds to the injection under Fe-55 exposure and is the basis for charge calibration. The charge injection circuit incorporates a capacitance with design value of $\mathrm{C_{inj}}=$ 230 aF. Experimentally, the average capacitance value for non-irradiated samples is found to be $\mathrm{C_{inj,exp}}=$ 257 aF. The 12 % divergence motivates the need for the presented precise calibration procedure, which is proposed to be performed for each MALTA2 sensor.

Organometallic halide perovskites have garnered considerable attention in recent times due to their promising optoelectronic attributes, particularly within the realm of solar photovoltaics (PV). How perovskite films form is of utmost significance in shaping their structural and functional characteristics. In this context, the application of methylamine vapour during the precursor deposition and subsequent treatment during the film formation stages emerges as crucial for the development of high-quality perovskite films for solar cell applications. The utilization of methylamine vapour annealing is pivotal in improving the crystallinity, morphology, and overall integrity of perovskite films. This work investigates the characteristics of perovskite films based on methylamine lead iodide, focusing on aspects such as crystallographic structure and vibrational modes, which are directly linked to the performance of the devices. The maximum power conversion efficiencies (PCE) obtained are 19.5% and 18.6% using 1-step and 2-step processes are obtained. The effect of factors like trap states, film homogeneity, and interfaces on the device performance are explored through capacitance measurements, photoluminescence, and electroluminescence behaviour. The recombination behaviour of the perovskite films is correlated with the crystallographic properties. These findings provide valuable insights into the influence of different processing techniques, such as methylamine vapour treatment and vacuum annealing, on rejuvenating perovskite solar cells.

In this article, a series of new inequalities involving the $q$-numerical radius for $n\times n$ tridiagonal, and anti-tridiagonal operator matrices has been established. These inequalities serve to establish both lower and upper bounds for the $q$-numerical radius of operator matrices. Additionally, we developed $q$-numerical radius inequalities for $n\times n$ circulant, skew circulant, imaginary circulant, imaginary skew circulant operator matrices. Important examples have been used to illustrate the developed inequalities. In this regard, analytical expressions and a numerical algorithm have also been employed to obtain the $q$-numerical radii. We also provide a concluding section, which may lead to several new problems in this area., Comment: 23 pages, 9 figures

The ICARUS-T600 Liquid Argon Time Projection Chamber is operating at Fermilab at shallow depth and thus exposed to a high flux of cosmic rays that can fake neutrino interactions. A cosmic ray tagging (CRT) system ($\sim$1100 m$^2$), surrounding the cryostat with two layers of fiber embedded plastic scintillators, was developed to mitigate the cosmic ray induced background. Using nanosecond-level timing information, the CRT can distinguish incoming cosmic rays from outgoing particles from neutrino interactions in the TPC. In this paper an overview of the CRT system, its installation and commissioning at Fermilab, and its performance are discussed.

We study the production of light nuclei in Au+Au collisions at $\sqrt{s_\mathrm{NN}}$ = 7.7 - 200 GeV and Pb+Pb collisions at $\sqrt{s_\mathrm{NN}}$ = 2.76 and 5.02 TeV within a flavour-dependent freeze-out framework, assuming different flavoured hadrons undergo separate chemical freeze-out. Using the Thermal-FIST package, thermal parameters extracted from fits to various sets of hadron yields, including and excluding light nuclei, are used to calculate the ratios of the yields of light nuclei, namely, $d/p$, $\bar{d}/\bar{p}$, $t/p$, and $t/d$. A comparison with data from the STAR and ALICE collaborations shows that a sequential freeze-out scenario provides a better description of light nuclei yield ratios than the traditional single freeze-out approach. These results suggest the flavour-dependent chemical freeze-out for final state light-nuclei production persists in heavy-ion collisions at both RHIC and LHC energies., Comment: 9 pages, 6 figures, 1 table, and 1 appendix table

The Chirality-Induced Spin Selectivity (CISS) effect describes the ability of chiral molecules and crystals to transmit spin-polarized currents, a phenomenon first identified in 1999. Although this effect holds great promise for a broad spectrum of different applications in device physics and synthetic chemistry (including, e.g., spintronics, quantum computing, spin- and enantio-selective chemistry), its underlying mechanisms remain incompletely understood. The prevailing hypothesis attributes the CISS effect to enhanced spin-orbit coupling (SOC) within chiral molecules. However, the SOC magnitude required to align with experimental observations significantly exceeds the values derived from conventional atomic-scale calculations, particularly for systems composed of light atoms. In this work, we leverage the implementation of \texttt{fully relativistic density functional theory (DFT)} equations, as available in the \texttt{Dirac code}, to investigate how molecular chirality manifests itself in the chirality density of electronic states. We further explore how this responds to an applied external electric field. To assess spin-dependent transport, we employ the \texttt{Landauer-Imry-B\"uttiker} formalism, examining the dependence of spin transmission on the twist angle of the molecular structure that defines its geometrical chirality. While our findings qualitatively align with experimental trends, they point to the necessity of a more general treatment of SOC, \textit{e.g.}, including geometrical terms or through the dependence of advanced exchange-correlation functionals on the electronic spin-current density., Comment: 8 pages, 6 figures

In this work, we investigate various state-of-the-art (SOTA) speech pre-trained models (PTMs) for their capability to capture prosodic signatures of the generative sources for audio deepfake source attribution (ADSD). These prosodic characteristics can be considered one of major signatures for ADSD, which is unique to each source. So better is the PTM at capturing prosodic signs better the ADSD performance. We consider various SOTA PTMs that have shown top performance in different prosodic tasks for our experiments on benchmark datasets, ASVSpoof 2019 and CFAD. x-vector (speaker recognition PTM) attains the highest performance in comparison to all the PTMs considered despite consisting lowest model parameters. This higher performance can be due to its speaker recognition pre-training that enables it for capturing unique prosodic characteristics of the sources in a better way. Further, motivated from tasks such as audio deepfake detection and speech recognition, where fusion of PTMs representations lead to improved performance, we explore the same and propose FINDER for effective fusion of such representations. With fusion of Whisper and x-vector representations through FINDER, we achieved the topmost performance in comparison to all the individual PTMs as well as baseline fusion techniques and attaining SOTA performance.

Sentiment analysis is an essential component of natural language processing, used to analyze sentiments, attitudes, and emotional tones in various contexts. It provides valuable insights into public opinion, customer feedback, and user experiences. Researchers have developed various classical machine learning and neuro-fuzzy approaches to address the exponential growth of data and the complexity of language structures in sentiment analysis. However, these approaches often fail to determine the optimal number of clusters, interpret results accurately, handle noise or outliers efficiently, and scale effectively to high-dimensional data. Additionally, they are frequently insensitive to input variations. In this paper, we propose a novel hybrid approach for sentiment analysis called the Quantum Fuzzy Neural Network (QFNN), which leverages quantum properties and incorporates a fuzzy layer to overcome the limitations of classical sentiment analysis algorithms. In this study, we test the proposed approach on two Twitter datasets: the Coronavirus Tweets Dataset (CVTD) and the General Sentimental Tweets Dataset (GSTD), and compare it with classical and hybrid algorithms. The results demonstrate that QFNN outperforms all classical, quantum, and hybrid algorithms, achieving 100% and 90% accuracy in the case of CVTD and GSTD, respectively. Furthermore, QFNN demonstrates its robustness against six different noise models, providing the potential to tackle the computational complexity associated with sentiment analysis on a large scale in a noisy environment. The proposed approach expedites sentiment data processing and precisely analyses different forms of textual data, thereby enhancing sentiment classification and insights associated with sentiment analysis.

The escalating complexity of urban transportation systems, exacerbated by factors such as traffic congestion, diverse transportation modalities, and shifting commuter preferences, necessitates the development of more sophisticated analytical frameworks. Traditional computational approaches often struggle with the voluminous datasets generated by real-time sensor networks, and they generally lack the precision needed for accurate traffic prediction and efficient system optimization. This research integrates quantum computing techniques to enhance Vehicle Road Cooperation Systems (VRCS). By leveraging quantum algorithms, specifically $UU^{\dagger}$ and variational $UU^{\dagger}$, in conjunction with quantum image encoding methods such as Flexible Representation of Quantum Images (FRQI) and Novel Enhanced Quantum Representation (NEQR), we propose an optimized Quantum Neural Network (QNN). This QNN features adjustments in its entangled layer structure and training duration to better handle the complexities of traffic data processing. Empirical evaluations on two traffic datasets show that our model achieves superior classification accuracies of 97.42% and 84.08% and demonstrates remarkable robustness in various noise conditions. This study underscores the potential of quantum-enhanced 6G solutions in streamlining complex transportation systems, highlighting the pivotal role of quantum technologies in advancing intelligent transportation solutions.

Er3+ color centers are promising candidates for quantum science and technology due to their long electron and nuclear spin coherence times, as well as their desirable emission wavelength. By selecting host materials with suitable, controllable properties, we introduce new parameters that can be used to tailor the Er3+ emission spectrum. PbTiO3 is a well-studied ferroelectric material with known methods of engineering different domain configurations through epitaxial strain. By distorting the structure of Er3+-doped PbTiO3 thin films, we can manipulate the crystal fields around the Er3+ dopant. This is resolved through changes in the Er3+ resonant fluorescence spectra, tying the optical properties of the defect directly to the domain configurations of the ferroelectic matrix. Additionally, we are able to resolve a second set of peaks for films with in-plane ferroelectric polarization. We hypothesize these results to be due to either the Er3+ substituting different sites of the PbTiO3 crystal, differences in charges between the Er3+ dopant and the original substituent ion, or selection rules. Systematically studying the relationship between the Er3+ emission and the epitaxial strain of the ferroelectric matrix lays the pathway for future optical studies of spin manipulation by altering ferroelectric order parameters

An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. In this article, we investigate arithmetical structures on the wheel graphs., Comment: 13pages, 3figures

Deep learning models rely heavily on large volumes of labeled data to achieve high performance. However, real-world datasets often contain noisy labels due to human error, ambiguity, or resource constraints during the annotation process. Instance-dependent label noise (IDN), where the probability of a label being corrupted depends on the input features, poses a significant challenge because it is more prevalent and harder to address than instance-independent noise. In this paper, we propose a novel hybrid framework that combines self-supervised learning using SimCLR with iterative pseudo-label refinement to mitigate the effects of IDN. The self-supervised pre-training phase enables the model to learn robust feature representations without relying on potentially noisy labels, establishing a noise-agnostic foundation. Subsequently, we employ an iterative training process with pseudo-label refinement, where confidently predicted samples are identified through a multistage approach and their labels are updated to improve label quality progressively. We evaluate our method on the CIFAR-10 and CIFAR-100 datasets augmented with synthetic instance-dependent noise at varying noise levels. Experimental results demonstrate that our approach significantly outperforms several state-of-the-art methods, particularly under high noise conditions, achieving notable improvements in classification accuracy and robustness. Our findings suggest that integrating self-supervised learning with iterative pseudo-label refinement offers an effective strategy for training deep neural networks on noisy datasets afflicted by instance-dependent label noise.

Let $H^\infty$ denotes the algebra of all bounded analytic functions on the unit disk. It is well-known that every (algebra) automorphism of $H^\infty$ is a composition operator induced by disc automorphism. Maurya et al., (J. Math. Anal. Appl. 530 : Paper No: 127698, 2024) proved that every automorphism of the subalgebras $\{f\in H^\infty : f(0) = 0\}$ or $\{f\in H^\infty : f'(0) = 0\}$ is a composition operator induced by a rotation. In this article, we give very simple proof of their results. As an interesting generalization, for any $\psi\in H^\infty$, we show that every automorphism of $\psi H^\infty$ must be a composition operator and characterize all such composition operators. Using this characterization, we find all automorphism of $\psi H^\infty$ for few choices of $\psi$ with various nature depending on its zeros., Comment: 17 pages

Customer demand, regulatory pressure, and engineering efficiency are the driving forces behind the industry-wide trend of moving from siloed engines and services that are optimized in isolation to highly integrated solutions. This is confirmed by the wide adoption of open formats, shared component libraries, and the meteoric success of integrated data lake experiences such as Microsoft Fabric. In this paper, we study the implications of this trend to Query Optimizer (QO) and discuss our experience of building Calcite and extending Cascades into QO components of Microsoft SQL Server, Fabric Data Warehouse (DW), and SCOPE. We weigh the pros and cons of a drastic change in direction: moving from bespoke QOs or library-sharing (\`a la Calcite) to rewriting the QO stack and fully embracing Query Optimizer as a Service (QOaaS). We report on some early successes and stumbles as we explore these ideas with prototypes compatible with Fabric DW and Spark. The benefits include centralized workload-level optimizations, multi-engine federation, and accelerated feature creation, but the challenges are equally daunting. We plan to engage CIDR audience in a debate on this exciting topic.

We present cosmological results from the measurement of clustering of galaxy, quasar and Lyman-$\alpha$ forest tracers from the first year of observations with the Dark Energy Spectroscopic Instrument (DESI Data Release 1). We adopt the full-shape (FS) modeling of the power spectrum, including the effects of redshift-space distortions, in an analysis which has been validated in a series of supporting papers. In the flat $\Lambda$CDM cosmological model, DESI (FS+BAO), combined with a baryon density prior from Big Bang Nucleosynthesis and a weak prior on the scalar spectral index, determines matter density to $\Omega_\mathrm{m}=0.2962\pm 0.0095$, and the amplitude of mass fluctuations to $\sigma_8=0.842\pm 0.034$. The addition of the cosmic microwave background (CMB) data tightens these constraints to $\Omega_\mathrm{m}=0.3056\pm 0.0049$ and $\sigma_8=0.8121\pm 0.0053$, while further addition of the the joint clustering and lensing analysis from the Dark Energy Survey Year-3 (DESY3) data leads to a 0.4% determination of the Hubble constant, $H_0 = (68.40\pm 0.27)\,{\rm km\,s^{-1}\,Mpc^{-1}}$. In models with a time-varying dark energy equation of state, combinations of DESI (FS+BAO) with CMB and type Ia supernovae continue to show the preference, previously found in the DESI DR1 BAO analysis, for $w_0>-1$ and $w_a<0$ with similar levels of significance. DESI data, in combination with the CMB, impose the upper limits on the sum of the neutrino masses of $\sum m_\nu < 0.071\,{\rm eV}$ at 95% confidence. DESI data alone measure the modified-gravity parameter that controls the clustering of massive particles, $\mu_0=0.11^{+0.45}_{-0.54}$, while the combination of DESI with the CMB and the clustering and lensing analysis from DESY3 constrains both modified-gravity parameters, giving $\mu_0 = 0.04\pm 0.22$ and $\Sigma_0 = 0.044\pm 0.047$, in agreement with general relativity. [Abridged.], Comment: This DESI Collaboration Key Publication is part of the 2024 publication series using the first year of observations (see https://data.desi.lbl.gov/doc/papers/). 55 pages, 10 figures

We present the samples of galaxies and quasars used for DESI 2024 cosmological analyses, drawn from the DESI Data Release 1 (DR1). We describe the construction of large-scale structure (LSS) catalogs from these samples, which include matched sets of synthetic reference `randoms' and weights that account for variations in the observed density of the samples due to experimental design and varying instrument performance. We detail how we correct for variations in observational completeness, the input `target' densities due to imaging systematics, and the ability to confidently measure redshifts from DESI spectra. We then summarize how remaining uncertainties in the corrections can be translated to systematic uncertainties for particular analyses. We describe the weights added to maximize the signal-to-noise of DESI DR1 2-point clustering measurements. We detail measurement pipelines applied to the LSS catalogs that obtain 2-point clustering measurements in configuration and Fourier space. The resulting 2-point measurements depend on window functions and normalization constraints particular to each sample, and we present the corrections required to match models to the data. We compare the configuration- and Fourier-space 2-point clustering of the data samples to that recovered from simulations of DESI DR1 and find they are, generally, in statistical agreement to within 2\% in the inferred real-space over-density field. The LSS catalogs, 2-point measurements, and their covariance matrices will be released publicly with DESI DR1., Comment: This DESI Collaboration Key Publication is part of the 2024 publication series using the first year of observations (see https://data.desi.lbl.gov/doc/papers/)

We present the measurements and cosmological implications of the galaxy two-point clustering using over 4.7 million unique galaxy and quasar redshifts in the range $0.1

We have analytically explored both the zero temperature and the finite temperature scaling theory for the collapse of an attractively interacting 3-D harmonically trapped Bose gas in a synthetic magnetic field. We have considered short ranged (contact) attractive inter-particle interactions and Hartree-Fock approximation for the same. We have separately studied the collapse of both the condensate and the thermal cloud below and above the condensation point, respectively. We have obtained an anisotropy, artificial magnetic field, and temperature dependent critical number of particles for the collapse of the condensate. We have found a dramatic change in the critical exponent (from $\alpha=1$ to $0$) of the specific heat ($C_v\propto|T-T_c|^{\alpha}$) when the thermal cloud is about to collapse with the critical number of particles ($N=N_c$) just below and above the condensation point. All the results obtained by us are experimentally testable within the present-day experimental set-up for the ultracold systems in the magneto-optical traps., Comment: 10 pages, 4 figures

In this work, we show that the class of multivariate degree-$d$ polynomials mapping $\{0,1\}^{n}$ to any Abelian group $G$ is locally correctable with $\widetilde{O}_{d}((\log n)^{d})$ queries for up to a fraction of errors approaching half the minimum distance of the underlying code. In particular, this result holds even for polynomials over the reals or the rationals, special cases that were previously not known. Further, we show that they are locally list correctable up to a fraction of errors approaching the minimum distance of the code. These results build on and extend the prior work of the authors [ABPSS24] (STOC 2024) who considered the case of linear polynomials and gave analogous results. Low-degree polynomials over the Boolean cube $\{0,1\}^{n}$ arise naturally in Boolean circuit complexity and learning theory, and our work furthers the study of their coding-theoretic properties. Extending the results of [ABPSS24] from linear to higher-degree polynomials involves several new challenges and handling them gives us further insights into properties of low-degree polynomials over the Boolean cube. For local correction, we construct a set of points in the Boolean cube that lie between two exponentially close parallel hyperplanes and is moreover an interpolating set for degree-$d$ polynomials. To show that the class of degree-$d$ polynomials is list decodable up to the minimum distance, we stitch together results on anti-concentration of low-degree polynomials, the Sunflower lemma, and the Footprint bound for counting common zeroes of polynomials. Analyzing the local list corrector of [ABPSS24] for higher degree polynomials involves understanding random restrictions of non-zero degree-$d$ polynomials on a Hamming slice. In particular, we show that a simple random restriction process for reducing the dimension of the Boolean cube is a suitably good sampler for Hamming slices., Comment: 64 pages, To appear in SODA 2025, deleted image files

Diffusion models exhibit robust generative properties by approximating the underlying distribution of a dataset and synthesizing data by sampling from the approximated distribution. In this work, we explore how the generative performance may be be modulated if noise sources with temporal correlations -- akin to those used in the field of active matter -- are used for the destruction of the data in the forward process. Our numerical and analytical experiments suggest that the corresponding reverse process may exhibit improved generative properties., Comment: 18 pages, 11 figures

Vehicle-to-Everything (V2X) communication, which includes Vehicle-to-Infrastructure (V2I), Vehicle-to-Vehicle (V2V), and Vehicle-to-Pedestrian (V2P) networks, is gaining significant attention due to the rise of connected and autonomous vehicles. V2X systems require diverse Quality of Service (QoS) provisions, with V2V communication demanding stricter latency and reliability compared to V2I. The 5G New Radio-V2X (NR-V2X) standard addresses these needs using multi-numerology Orthogonal Frequency Division Multiple Access (OFDMA), which allows for flexible allocation of radio resources. However, V2I and V2V users sharing the same radio resources leads to interference, necessitating efficient power and resource allocation. In this work, we propose a novel resource allocation and sharing algorithm for 5G-based V2X systems. Our approach first groups Resource Blocks (RBs) into Resource Chunks (RCs) and allocates them to V2I users using the Gale-Shapley stable matching algorithm. Power is then allocated to RCs to facilitate efficient resource sharing between V2I and V2V users through a bisection search method. Finally, the Gale-Shapley algorithm is used to pair V2I and V2V users, maintaining low computational complexity while ensuring high performance. Simulation results demonstrate that our proposed Gale-Shapley Resource Allocation with Gale-Shapley Sharing (GSRAGS) achieves competitive performance with lower complexity compared to existing works while effectively meeting the QoS demands of V2X communication systems., Comment: 8 pages, 10 figures

We present a search for long-lived particles (LLPs) produced from kaon decay that decay to two muons inside the ICARUS neutrino detector. This channel would be a signal of hidden sector models that can address outstanding issues in particle physics such as the strong CP problem and the microphysical origin of dark matter. The search is performed with data collected in the Neutrinos at the Main Injector (NuMI) beam at Fermilab corresponding to $2.41\times 10^{20}$ protons-on-target. No new physics signal is observed, and we set world-leading limits on heavy QCD axions, as well as for the Higgs portal scalar among dedicated searches. Limits are also presented in a model-independent way applicable to any new physics model predicting the process $K\to \pi+S(\to\mu\mu)$, for a long-lived particle S. This result is the first search for new physics performed with the ICARUS detector at Fermilab. It paves the way for the future program of long-lived particle searches at ICARUS.

We investigate the thermoelectric performance of a voltage probe and voltage-temperature probe minimally nonlinear irreversible heat engine with broken time-reversal symmetry by considering extended Onsager relations, where a nonlinear power dissipation term ($-\gamma_h{J_L^N}^2$) is added to the heat current. The analytical expressions for efficiency at a given power and efficiency at maximum power, in terms of asymmetry parameters and generalized figures of merit, are derived and analyzed. Our analysis with broken time-reversal symmetry and nonlinear effect reveals two universal bounds on the efficiency at maximum power (EMP) that overshoot the Curzon-Ahlborn (CA) limit. Although the analytical expressions of the bounds on EMP look similar, their respective Carnot efficiency and the asymmetry parameter set the difference between these heat engines which can be proved numerically. We consider a triple-dot Aharonov-Bohm heat engine with a voltage probe and voltage-temperature probe for our numerical simulation experiment. Unlike the voltage probe, the voltage-temperature probe heat engine requires an anisotropy in the system in addition to the magnetic field to break the time-reversal symmetry. In both probe cases, we observe high efficiency with low output power when the tunneling strength $t$ is less than the coupling strength $\gamma$ and vice-versa for $t>\gamma$. Our numerical experiment demonstrates that the efficiency at maximum output power and efficiency at a given power can be enhanced by increasing the power dissipation strength ($\gamma_h$) although the output power remains unaffected. The added nonlinear term helps us to surpass the CA limit of the upper bound on efficiency at maximum power for both cases with and without time-reversal symmetry.

Speech forensic tasks (SFTs), such as automatic speaker recognition (ASR), speech emotion recognition (SER), gender recognition (GR), and age estimation (AE), find use in different security and biometric applications. Previous works have applied various techniques, with recent studies focusing on applying speech foundation models (SFMs) for improved performance. However, most prior efforts have centered on building individual models for each task separately, despite the inherent similarities among these tasks. This isolated approach results in higher computational resource requirements, increased costs, time consumption, and maintenance challenges. In this study, we address these challenges by employing a multi-task learning strategy. Firstly, we explore the various state-of-the-art (SOTA) SFMs by extracting their representations for learning these SFTs and investigating their effectiveness at each task specifically. Secondly, we analyze the performance of the extracted representations on the SFTs in a multi-task learning framework. We observe a decline in performance when SFTs are modeled together compared to individual task-specific models, and as a remedy, we propose multi-view learning (MVL). Views are representations from different SFMs transformed into distinct abstract spaces by characteristics unique to each SFM. By leveraging MVL, we integrate these diverse representations to capture complementary information across tasks, enhancing the shared learning process. We introduce a new framework called TANGO (Task Alignment with iNter-view Gated Optimal transport) to implement this approach. With TANGO, we achieve the topmost performance in comparison to individual SFM representations as well as baseline fusion techniques across benchmark datasets such as CREMA-D, emo-DB, and BAVED.

Despite being trained exclusively on speech data, speech foundation models (SFMs) like Whisper have shown impressive performance in non-speech tasks such as audio classification. This is partly because speech shares some common traits with audio, enabling SFMs to transfer effectively. In this study, we push the boundaries by evaluating SFMs on a more challenging out-of-domain (OOD) task: classifying physiological time-series signals. We test two key hypotheses: first, that SFMs can generalize to physiological signals by capturing shared temporal patterns; second, that multilingual SFMs will outperform others due to their exposure to greater variability during pre-training, leading to more robust, generalized representations. Our experiments, conducted for stress recognition using ECG (Electrocardiogram), EMG (Electromyography), and EDA (Electrodermal Activity) signals, reveal that models trained on SFM-derived representations outperform those trained on raw physiological signals. Among all models, multilingual SFMs achieve the highest accuracy, supporting our hypothesis and demonstrating their OOD capabilities. This work positions SFMs as promising tools for new uncharted domains beyond speech.

In this work, we introduce SeQuiFi, a novel approach for mitigating catastrophic forgetting (CF) in speech emotion recognition (SER). SeQuiFi adopts a sequential class-finetuning strategy, where the model is fine-tuned incrementally on one emotion class at a time, preserving and enhancing retention for each class. While various state-of-the-art (SOTA) methods, such as regularization-based, memory-based, and weight-averaging techniques, have been proposed to address CF, it still remains a challenge, particularly with diverse and multilingual datasets. Through extensive experiments, we demonstrate that SeQuiFi significantly outperforms both vanilla fine-tuning and SOTA continual learning techniques in terms of accuracy and F1 scores on multiple benchmark SER datasets, including CREMA-D, RAVDESS, Emo-DB, MESD, and SHEMO, covering different languages.

In this paper, we present a comprehensive UAV system design to perform the highly complex task of off-centered aerial grasping. This task has several interdisciplinary research challenges which need to be addressed at once. The main design challenges are GPS-denied functionality, solely onboard computing, and avoiding off-the-shelf costly positioning systems. While in terms of algorithms, visual perception, localization, control, and grasping are the leading research problems. Hence in this paper, we make interdisciplinary contributions: (i) A detailed description of the fundamental challenges in indoor aerial grasping, (ii) a novel lightweight gripper design, (iii) a complete aerial platform design and in-lab fabrication, and (iv) localization, perception, control, grasping systems, and an end-to-end flight autonomy state-machine. Finally, we demonstrate the resulting aerial grasping system Drone-Bee achieving a high grasping rate for a highly challenging agricultural task of apple-like fruit harvesting, indoors in a vertical farming setting (Fig. 1). To our knowledge, such a system has not been previously discussed in the literature, and with its capabilities, this system pushes aerial manipulation towards 4th generation.

In this work, we propose an end-to-end Thrust Microstepping and Decoupled Control (TMDC) of quadrotors. TMDC focuses on precise off-centered aerial grasping of payloads dynamically, which are attached rigidly to the UAV body via a gripper contrary to the swinging payload. The dynamic payload grasping quickly changes UAV's mass, inertia etc, causing instability while performing a grasping operation in-air. We identify that to handle unknown payload grasping, the role of thrust controller is crucial. Hence, we focus on thrust control without involving system parameters such as mass etc. TMDC is based on our novel Thrust Microstepping via Acceleration Feedback (TMAF) thrust controller and Decoupled Motion Control (DMC). TMAF precisely estimates the desired thrust even at smaller loop rates while DMC decouples the horizontal and vertical motion to counteract disturbances in the case of dynamic payloads. We prove the controller's efficacy via exhaustive experiments in practically interesting and adverse real-world cases, such as fully onboard state estimation without any positioning sensor, narrow and indoor flying workspaces with intense wind turbulence, heavy payloads, non-uniform loop rates, etc. Our TMDC outperforms recent direct acceleration feedback thrust controller (DA) and geometric tracking control (GT) in flying stably for aerial grasping and achieves RMSE below 0.04m in contrast to 0.15m of DA and 0.16m of GT.

The classic paradigms for learning and memory recall focus on strengths of synaptic couplings and how these can be modulated to encode memories. In a previous paper [A. K. Behera, M. Rao, S. Sastry, and S. Vaikuntanathan, Physical Review X 13, 041043 (2023)], we demonstrated how a specific non-equilibrium modification of the dynamics of an associative memory system can lead to increase in storage capacity. In this work, using analytical theory and computational inference schemes, we show that the dynamical steady state accessed is in fact similar to those accessed after the operation of a classic unsupervised scheme for improving memory recall, Hebbian unlearning or ``dreaming". Together, our work suggests how nonequilibrium dynamics can provide an alternative route for controlling the memory encoding and recall properties of a variety of synthetic (neuromorphic) and biological systems., Comment: 15 pages, 13 figures

We present an accurate and GPU-accelerated Stereo Visual SLAM design called Jetson-SLAM. It exhibits frame-processing rates above 60FPS on NVIDIA's low-powered 10W Jetson-NX embedded computer and above 200FPS on desktop-grade 200W GPUs, even in stereo configuration and in the multiscale setting. Our contributions are threefold: (i) a Bounded Rectification technique to prevent tagging many non-corner points as a corner in FAST detection, improving SLAM accuracy. (ii) A novel Pyramidal Culling and Aggregation (PyCA) technique that yields robust features while suppressing redundant ones at high speeds by harnessing a GPU device. PyCA uses our new Multi-Location Per Thread culling strategy (MLPT) and Thread-Efficient Warp-Allocation (TEWA) scheme for GPU to enable Jetson-SLAM achieving high accuracy and speed on embedded devices. (iii) Jetson-SLAM library achieves resource efficiency by having a data-sharing mechanism. Our experiments on three challenging datasets: KITTI, EuRoC, and KAIST-VIO, and two highly accurate SLAM backends: Full-BA and ICE-BA show that Jetson-SLAM is the fastest available accurate and GPU-accelerated SLAM system (Fig. 1).

Conventional federated learning frameworks suffer from several challenges including performance bottlenecks at the central aggregation server, data bias, poor model convergence, and exposure to model poisoning attacks, and limited trust in the centralized infrastructure. In the current paper, a novel game theory-based approach called pFedGame is proposed for decentralized federated learning, best suitable for temporally dynamic networks. The proposed algorithm works without any centralized server for aggregation and incorporates the problem of vanishing gradients and poor convergence over temporally dynamic topology among federated learning participants. The solution comprises two sequential steps in every federated learning round, for every participant. First, it selects suitable peers for collaboration in federated learning. Secondly, it executes a two-player constant sum cooperative game to reach convergence by applying an optimal federated learning aggregation strategy. Experiments performed to assess the performance of pFedGame in comparison to existing methods in decentralized federated learning have shown promising results with accuracy higher than 70% for heterogeneous data.

While in classical cryptography, one-way functions (OWFs) are widely regarded as the "minimal assumption," the situation in quantum cryptography is less clear. Recent works have put forward two concurrent candidates for the minimal assumption in quantum cryptography: One-way state generators (OWSGs), postulating the existence of a hard search problem with an efficient verification algorithm, and EFI pairs, postulating the existence of a hard distinguishing problem. Two recent papers [Khurana and Tomer STOC'24; Batra and Jain FOCS'24] showed that OWSGs imply EFI pairs, but the reverse direction remained open. In this work, we give strong evidence that the opposite direction does not hold: We show that there is a quantum unitary oracle relative to which EFI pairs exist, but OWSGs do not. In fact, we show a slightly stronger statement that holds also for EFI pairs that output classical bits (QEFID). As a consequence, we separate, via our oracle, QEFID, and one-way puzzles from OWSGs and several other Microcrypt primitives, including efficiently verifiable one-way puzzles and unclonable state generators. In particular, this solves a problem left open in [Chung, Goldin, and Gray Crypto'24]. Using similar techniques, we also establish a fully black-box separation (which is slightly weaker than an oracle separation) between private-key quantum money schemes and QEFID pairs. One conceptual implication of our work is that the existence of an efficient verification algorithm may lead to qualitatively stronger primitives in quantum cryptography., Comment: Minor revisions in the related and concurrent works section were made in version 3

The study of heat-to-work conversion has gained significant attention in recent years, highlighting the potential of nanoscale systems to achieve energy conversion in steady-state devices without any macroscopic moving parts. This review examines the theoretical frameworks governing the steady-state flows of quantum particles like electrons, photons, and phonons within various mesoscopic or nanoscale devices, such as thermoelectric heat engines in the context of quantum dot Aharonov-Bohm (AB) interferometric configurations. Quantum interference effects hold great promise for enhancing the thermoelectric transport properties of such quantum devices by allowing more precise control over energy levels and transport pathways. Driven quantum dot AB networks can maintain quantum coherence and provide precise experimental control. Unlike bulk systems, nanoscale systems like quantum dots reveal distinct quantum interference phenomena, including sharp features in transmission spectra and Fano resonances. This review highlights the distinction between optimization methods that produce boxcar functions and coherent control methods that result in complex interference patterns. It reveals that the effective design of thermoelectric heat engines requires careful tailoring of quantum interference and the magnetic field-induced effects to enhance performance. We emphasize how magnetic fields can change the bounds of power or efficiency. These machines with broken time-reversal symmetry provide insights into directional dependencies and asymmetries in quantum transport. We offer a thorough overview of past and current research on quantum thermoelectric heat engines using the AB effect and present a detailed review of three-terminal AB heat engines, where broken time-reversal symmetry can induce a coherent diode effect. We cover bounds on power and efficiency in systems with broken time-reversal symmetry.

The manuscript focuses on the theoretical stability analysis of the viscous liquid over a vibrating inclined rigid bed when the fluid undergoes an impact of odd viscosity. Such an impact emerges in the classical fluid owing to the broken time-reversal symmetry. The rigid bottom vibrates in streamwise and cross-stream directions. The time-dependent Orr-Sommerfeld eigenvalue problem is obtained using the normal mode approach and resolved based on the Chebyshev-collocation method and the Floquet theory. The effect of the odd viscosity coefficient on the different types of instability gravitational, subharmonic, and harmonic are identified. The gravitational instability arises in the longwave region, whereas the resonated wave instability appears in the finite wavenumber region. The gravitational instability is generated in the fluid flow owing to the gravity driving force, whereas the subharmonic instability appears for lower forcing amplitude and the harmonic instability emerges for comparatively higher forcing amplitude. It is found that the subharmonic and harmonic resonances appear when the forcing amplitude surpasses its critical value. A higher odd viscosity leads to stabilizing the gravitational instability, whereas a larger odd viscosity diminishes the subharmonic resonance along with the harmonic resonance instigated at a high forcing amplitude. Further, a new instability, named shear instability in the finite wavenumber range emerges together with the aforementioned three instabilities when the Reynolds number is sufficiently high with a low angle of inclination and becomes weaker when the time-reversal symmetry breaks., Comment: 16 pages, 22 figures

This paper introduces a novel track-length extension fitting algorithm for measuring the kinetic energies of inelastically interacting particles in liquid argon time projection chambers (LArTPCs). The algorithm finds the most probable offset in track length for a track-like object by comparing the measured ionization density as a function of position with a theoretical prediction of the energy loss as a function of the energy, including models of electron recombination and detector response. The algorithm can be used to measure the energies of particles that interact before they stop, such as charged pions that are absorbed by argon nuclei. The algorithm's energy measurement resolutions and fractional biases are presented as functions of particle kinetic energy and number of track hits using samples of stopping secondary charged pions in data collected by the ProtoDUNE-SP detector, and also in a detailed simulation. Additional studies describe the impact of the dE/dx model on energy measurement performance. The method described in this paper to characterize the energy measurement performance can be repeated in any LArTPC experiment using stopping secondary charged pions.

We investigate a series of galaxy properties computed using the merger trees and environmental histories from dark matter only cosmological simulations, using the predictive semi-recurrent neural network outlined in Chittenden and Tojeiro (2023), and using stochastic improvements presented in our companion paper: Behera, Tojeiro and Chittenden (2024). We apply these methods to the dark matter only runs of the IllustrisTNG simulations to understand the effects of baryon removal, and to the gigaparsec-volume pure dark matter simulation Uchuu, to understand the effects of the lower resolution or alternative metrics for halo properties. We find that the machine learning model recovers accurate summary statistics derived from the predicted star formation and stellar metallicity histories, and correspondent spectroscopy and photometry. However, the inaccuracies of the model's application to dark simulations are substantial for low mass and slowly growing haloes. For these objects, the halo mass accretion rate is exaggerated due to the lack of stellar feedback, yet the formation of the halo can be severely limited by the absence of low mass progenitors in a low resolution simulation. Furthermore, differences in the structure and environment of higher mass haloes results in an overabundance of red, quenched galaxies. These results signify progress towards a machine learning model which builds high fidelity mocks based on a physical interpretation of the galaxy-halo connection, yet they illustrate the need to account for differences in halo properties and the resolution of the simulation., Comment: 21 pages, 17 figures, submitted to MNRAS alongside companion paper: arXiv:2409.16548

The adaptation of foundation models has significantly advanced environmental audio deepfake detection (EADD), a rapidly growing area of research. These models are typically fine-tuned or utilized in their frozen states for downstream tasks. However, the dimensionality of their representations can substantially lead to a high parameter count of downstream models, leading to higher computational demands. So, a general way is to compress these representations by leveraging state-of-the-art (SOTA) unsupervised dimensionality reduction techniques (PCA, SVD, KPCA, GRP) for efficient EADD. However, with the application of such techniques, we observe a drop in performance. So in this paper, we show that representation vectors contain redundant information, and randomly selecting 40-50% of representation values and building downstream models on it preserves or sometimes even improves performance. We show that such random selection preserves more performance than the SOTA dimensionality reduction techniques while reducing model parameters and inference time by almost over half., Comment: Submitted to ICASSP 2025

We present a novel methodology to improve neural network (NN) predictions of galaxy formation histories by incorporating semi-stochastic corrections to account for short-timescale variability. Our paper addresses limitations in existing models that capture broad trends in galaxy evolution, but fail to reproduce the bursty nature of star formation and chemical enrichment, resulting in inaccurate predictions of key observables such as stellar masses, optical spectra, and colour distributions. We introduce a simple technique to add stochastic components by utilizing the power spectra of galaxy formation histories. We justify our stochastic approach by studying the correlation between the phases of the halo mass assembly and star-formation histories in the IllustrisTNG simulation, and we find that they are correlated only on timescales longer than 6 Gyr, with a strong dependence on galaxy type. Building on NNs developed in Chittenden & Tojeiro (2023), trained on hydrodynamical simulations from the IllustrisTNG project, which predict time-resolved star formation and stellar metallicity histories for central and satellite galaxies based solely on the properties and evolution of their dark matter halos and environments, this approach successfully recovers realistic variability in galaxy properties at short timescales. It significantly improves the accuracy of predicted stellar masses, metallicities, spectra, and colour distributions and provides a powerful framework for generating large, realistic mock galaxy catalogs, while also enhancing our understanding of the complex interplay between galaxy evolution and dark matter halo assembly., Comment: 18 pages, 20 figures, submitted to MNRAS alongside companion paper - arXiv:2409.16079

In this study, we address the challenge of depression detection from speech, focusing on the potential of non-semantic features (NSFs) to capture subtle markers of depression. While prior research has leveraged various features for this task, NSFs-extracted from pre-trained models (PTMs) designed for non-semantic tasks such as paralinguistic speech processing (TRILLsson), speaker recognition (x-vector), and emotion recognition (emoHuBERT)-have shown significant promise. However, the potential of combining these diverse features has not been fully explored. In this work, we demonstrate that the amalgamation of NSFs results in complementary behavior, leading to enhanced depression detection performance. Furthermore, to our end, we introduce a simple novel framework, FuSeR, designed to effectively combine these features. Our results show that FuSeR outperforms models utilizing individual NSFs as well as baseline fusion techniques and obtains state-of-the-art (SOTA) performance in E-DAIC benchmark with RMSE of 5.51 and MAE of 4.48, establishing it as a robust approach for depression detection., Comment: Submitted to ICASSP 2025

In this study, we investigate multimodal foundation models (MFMs) for emotion recognition from non-verbal sounds. We hypothesize that MFMs, with their joint pre-training across multiple modalities, will be more effective in non-verbal sounds emotion recognition (NVER) by better interpreting and differentiating subtle emotional cues that may be ambiguous in audio-only foundation models (AFMs). To validate our hypothesis, we extract representations from state-of-the-art (SOTA) MFMs and AFMs and evaluated them on benchmark NVER datasets. We also investigate the potential of combining selected foundation model representations to enhance NVER further inspired by research in speech recognition and audio deepfake detection. To achieve this, we propose a framework called MATA (Intra-Modality Alignment through Transport Attention). Through MATA coupled with the combination of MFMs: LanguageBind and ImageBind, we report the topmost performance with accuracies of 76.47%, 77.40%, 75.12% and F1-scores of 70.35%, 76.19%, 74.63% for ASVP-ESD, JNV, and VIVAE datasets against individual FMs and baseline fusion techniques and report SOTA on the benchmark datasets., Comment: Submitted to ICASSP 2025

In this study, for the first time, we extensively investigate whether music foundation models (MFMs) or speech foundation models (SFMs) work better for singing voice deepfake detection (SVDD), which has recently attracted attention in the research community. For this, we perform a comprehensive comparative study of state-of-the-art (SOTA) MFMs (MERT variants and music2vec) and SFMs (pre-trained for general speech representation learning as well as speaker recognition). We show that speaker recognition SFM representations perform the best amongst all the foundation models (FMs), and this performance can be attributed to its higher efficacy in capturing the pitch, tone, intensity, etc, characteristics present in singing voices. To our end, we also explore the fusion of FMs for exploiting their complementary behavior for improved SVDD, and we propose a novel framework, FIONA for the same. With FIONA, through the synchronization of x-vector (speaker recognition SFM) and MERT-v1-330M (MFM), we report the best performance with the lowest Equal Error Rate (EER) of 13.74 %, beating all the individual FMs as well as baseline FM fusions and achieving SOTA results., Comment: Submitted to ICASSP 2025

Physics-informed neural networks (PINNs) are a class of deep learning models that utilize physics as differential equations to address complex problems, including ones that may involve limited data availability. However, tackling solutions of differential equations with oscillations or singular perturbations and shock-like structures becomes challenging for PINNs. Considering these challenges, we designed an efficient wavelet-based PINNs (W-PINNs) model to solve singularly perturbed differential equations. Here, we represent the solution in wavelet space using a family of smooth-compactly supported wavelets. This framework represents the solution of a differential equation with significantly fewer degrees of freedom while still retaining in capturing, identifying, and analyzing the local structure of complex physical phenomena. The architecture allows the training process to search for a solution within wavelet space, making the process faster and more accurate. The proposed model does not rely on automatic differentiations for derivatives involved in differential equations and does not require any prior information regarding the behavior of the solution, such as the location of abrupt features. Thus, through a strategic fusion of wavelets with PINNs, W-PINNs excel at capturing localized nonlinear information, making them well-suited for problems showing abrupt behavior in certain regions, such as singularly perturbed problems. The efficiency and accuracy of the proposed neural network model are demonstrated in various test problems, i.e., highly singularly perturbed nonlinear differential equations, the FitzHugh-Nagumo (FHN), and Predator-prey interaction models. The proposed design model exhibits impressive comparisons with traditional PINNs and the recently developed wavelet-based PINNs, which use wavelets as an activation function for solving nonlinear differential equations., Comment: 17 pages, 12 figures

We present an innovative framework for traffic dynamics analysis using High-Order Evolving Graphs, designed to improve spatio-temporal representations in autonomous driving contexts. Our approach constructs temporal bidirectional bipartite graphs that effectively model the complex interactions within traffic scenes in real-time. By integrating Graph Neural Networks (GNNs) with high-order multi-aggregation strategies, we significantly enhance the modeling of traffic scene dynamics, providing a more accurate and detailed analysis of these interactions. Additionally, we incorporate inductive learning techniques inspired by the GraphSAGE framework, enabling our model to adapt to new and unseen traffic scenarios without the need for retraining, thus ensuring robust generalization. Through extensive experiments on the ROAD and ROAD Waymo datasets, we establish a comprehensive baseline for further developments, demonstrating the potential of our method in accurately capturing traffic behavior. Our results emphasize the value of high-order statistical moments and feature-gated attention mechanisms in improving traffic behavior analysis, laying the groundwork for advancing autonomous driving technologies. Our source code is available at: https://github.com/Addy-1998/High_Order_Graphs, Comment: Accepted manuscript - 2nd Workshop on Vision-Centric Autonomous Driving (VCAD) as part of European Conference on Computer Vision (ECCV) 2024

In light of recent development in purely perception based models of collective motion using perception vectors, we suggest a quantum-inspired model of collective behaviour. We investigate the alignment of self-propelled agents by introducing quantum entanglement in the perceptual states of neighboring agents within each agent's vision cone. In this framework, we propose that the force acting on active agents is proportional to the quantum expectation value of perception operator encoding perceptual dynamics that drives alignment within the flock. Additionally, we introduce two quantum mechanical measures-perception strength and perceptual energy-to characterize collective behavior. Our model demonstrates that, with an appropriate choice of the entangled state, the well-known Vicsek model of flocking behavior can be derived as a specific case of this quantum-inspired approach. This approach provides fresh insights into swarm intelligence and multi-agent coordination, revealing how classical patterns of collective behavior emerge naturally from entangled perceptual states., Comment: 8 pages, 6 figures, 1 table

The theory and computation of tensors with different tensor products play increasingly important roles in scientific computing and machine learning. Different products aim to preserve different algebraic properties from the matrix algebra, and the choice of tensor product determines the algorithms that can be directly applied. This study introduced a novel full-rank decomposition and $M$-$\mc{QDR}$ decomposition for third-order tensors based on $M$-product. Then, we designed algorithms for computing these two decompositions along with the Moore-Penrose inverse, and outer inverse of the tensors. In support of these theoretical results, a few numerical examples were discussed. In addition, we derive exact expressions for the outer inverses of tensors using symbolic tensor (tensors with polynomial entries) computation. We designed efficient algorithms to compute the Moore-Penrose inverse of symbolic tensors. The prowess of the proposed $M$-$\mc{QDR}$ decomposition for third-order tensors is applied to compress lossy color images., Comment: 23