Search

This work introduces a novel approach to constructing DNA codes from linear codes over a non-chain extension of $\mathbb{Z}_4$. We study $(\text{\textbaro},\mathfrak{d}, \gamma)$-constacyclic codes over the ring $\mathfrak{R}=\mathbb{Z}_4+\omega\mathbb{Z}_4, \omega^2=\omega,$ with an $\mathfrak{R}$-automorphism $\text{\textbaro}$ and a $\text{\textbaro}$-derivation $\mathfrak{d}$ over $\mathfrak{R}.$ Further, we determine the generators of the $(\text{\textbaro},\mathfrak{d}, \gamma)$-constacyclic codes over the ring $\mathfrak{R}$ of any arbitrary length and establish the reverse constraint for these codes. Besides the necessary and sufficient criterion to derive reverse-complement codes, we present a construction to obtain DNA codes from these reversible codes. Moreover, we use another construction on the $(\text{\textbaro},\mathfrak{d},\gamma)$-constacyclic codes to generate additional optimal and new classical codes. Finally, we provide several examples of $(\text{\textbaro},\mathfrak{d}, \gamma)$ constacyclic codes and construct DNA codes from established results. The parameters of these linear codes over $\mathbb{Z}_4$ are better and optimal according to the codes available at \cite{z4codes}., Comment: 20

Scheduling virtual machines (VMs) to hosts in cloud data centers dictates efficiency and is an NP-hard problem with incomplete information. Prior work improved VM scheduling with predicted VM lifetimes. Our work further improves lifetime-aware scheduling using repredictions with lifetime distributions vs. one-shot prediction. The approach repredicts and adjusts VM and host lifetimes when incorrect predictions emerge. We also present novel approaches for defragmentation and regular system maintenance, which are essential to our data center reliability and optimizations, and are unexplored in prior work. We show that repredictions deliver a fundamental advance in effectiveness over one-shot prediction. We call our novel combination of distribution-based lifetime predictions and scheduling algorithms Lifetime Aware VM Allocation (LAVA). LAVA improves resource stranding and the number of empty hosts, which are critical for large VM scheduling, cloud system updates, and reducing dynamic energy consumption. Our approach runs in production within Google's hyperscale cloud data centers, where it improves efficiency by decreasing stranded compute and memory resources by ~3% and ~2% respectively, and increases availability for large VMs and cloud system updates by increasing empty hosts by 2.3-9.2 pp in production. We also show a reduction in VM migrations for host defragmentation and maintenance. In addition to our fleet-wide production deployment, we perform simulation studies to characterize the design space and show that our algorithm significantly outperforms the state of the art lifetime-based scheduling approach.

This paper explores the behaviour of commuting Jordan derivations over prime rings with non-trivial idempotents and demonstrates that they become zero maps. Further, it establishes this result for commuting Jordan higher derivations over prime rings under specific conditions. In fact, it introduces commuting generalized Jordan derivations over rings and establishes that the zero map is the only commuting generalized Jordan derivation over prime rings under certain assumptions., Comment: 10

Let $\mathcal A$ the affine algebra given by the ring $\mathbb{F}_q[X_1,X_2,\ldots,X_\ell]/ I$, where $I$ is the ideal $\langle t_1(X_1), t_2(X_2), \ldots, t_\ell(X_\ell) \rangle$ with each $t_i(X_i)$, $1\leq i\leq \ell$, being a square-free polynomial over $\mathbb{F}_q$. This paper studies the $k$-Galois hulls of $\lambda$-constacyclic codes over $\mathcal A$ regarding their idempotent generators. For this, first, we define the $k$-Galois inner product over $\mathcal A$ and find the form of the generators of the $k$-Galois dual and the $k$-Galois hull of a $\lambda$-constacyclic code over $\mathcal A$. Then, we derive a formula for the $k$-Galois hull dimension of a $\lambda$-constacyclic code. Further, we provide a condition for a $\lambda$-constacyclic code to be $k$-Galois LCD. Finally, we give some examples of the use of these codes in constructing entanglement-assisted quantum error-correcting codes.

The balance between the orbital and spin magnetic moments in a magnetic system is the heart of many intriguing phenomena. Here, we show experimental evidence of a large orbital moment, which competes with its spin counterpart in a ferrimagnetic insulator thulium iron garnet, Tm3Fe5O12. Leveraging element-specific X-ray magnetic circular dichroism (XMCD), we establish that the dominant contribution to the orbital moment originates from 4f orbitals of Tm. Besides the large Tm orbital moment, intriguingly, our results also reveal a smaller but evident non-zero XMCD signal in the O K edge, suggesting additional spin-orbit coupling and exchange interactions with the nearest neighbour Fe atoms. The unquenched orbital moment is primarily responsible for a significant reduction in g-factor, typically 2 in transition metals, as determined independently using ferromagnetic resonance spectroscopy. Our findings reveal a non-linear reduction in the g-factor from 1.7 at 300 K to 1.56 at 200 K in Tm3Fe5O12 thin films. These results provide critical insights into the role of the f orbitals in long-range magnetic order and stimulate further exploration in orbitronics., Comment: The main article along with supporting information consists of a total of 31 pages, including 12 figures and 1 table

The growing reliance on artificial intelligence (AI) in customer support has significantly improved operational efficiency and user experience. However, traditional machine learning (ML) approaches, which require extensive local training on sensitive datasets, pose substantial privacy risks and compliance challenges with regulations like the General Data Protection Regulation (GDPR) and California Consumer Privacy Act (CCPA). Existing privacy-preserving techniques, such as anonymization, differential privacy, and federated learning, address some concerns but face limitations in utility, scalability, and complexity. This paper introduces the Privacy-Preserving Zero-Shot Learning (PP-ZSL) framework, a novel approach leveraging large language models (LLMs) in a zero-shot learning mode. Unlike conventional ML methods, PP-ZSL eliminates the need for local training on sensitive data by utilizing pre-trained LLMs to generate responses directly. The framework incorporates real-time data anonymization to redact or mask sensitive information, retrieval-augmented generation (RAG) for domain-specific query resolution, and robust post-processing to ensure compliance with regulatory standards. This combination reduces privacy risks, simplifies compliance, and enhances scalability and operational efficiency. Empirical analysis demonstrates that the PP-ZSL framework provides accurate, privacy-compliant responses while significantly lowering the costs and complexities of deploying AI-driven customer support systems. The study highlights potential applications across industries, including financial services, healthcare, e-commerce, legal support, telecommunications, and government services. By addressing the dual challenges of privacy and performance, this framework establishes a foundation for secure, efficient, and regulatory-compliant AI applications in customer interactions.

For a graph $G= (V, E)$, a Roman dominating function is a map $f : V \rightarrow \{0, 1, 2\}$ satisfies the property that if $f(v) = 0$, then $v$ must have adjacent to at least one vertex $u$ such that $f(u)= 2$. The weight of a Roman dominating function $f$ is the value $f(V)= \Sigma_{u \in V} f(u)$, and the minimum weight of a Roman dominating function on $G$ is called the Roman domination number of $G$, denoted by $\gamma_R(G)$. The main focus of this paper is to study the Roman domination number of zero-divisor graph $\Gamma(R)$ and find the bounds of the Roman domination number of $T(\Gamma(R))$., Comment: 9

We provide a taxonomy of a dozen enabling network architectures, protocols, and technologies that will define the evolution from 5G to 6G. These technologies span the network protocol stack, different target deployment environments, and various perceived levels of technical maturity. We outline four areas of societal focus that will be impacted by these technologies, and overview several research directions that hold the potential to address the problems in these important focus areas., Comment: This paper has been accepted for publication in the IEEE Communications Magazine. Portions were released online as a report 6G Roadmap: A Global Taxonomy in November 2023

This paper introduces DebateBrawl, an innovative AI-powered debate platform that integrates Large Language Models (LLMs), Genetic Algorithms (GA), and Adversarial Search (AS) to create an adaptive and engaging debating experience. DebateBrawl addresses the limitations of traditional LLMs in strategic planning by incorporating evolutionary optimization and game-theoretic techniques. The system demonstrates remarkable performance in generating coherent, contextually relevant arguments while adapting its strategy in real-time. Experimental results involving 23 debates show balanced outcomes between AI and human participants, with the AI system achieving an average score of 2.72 compared to the human average of 2.67 out of 10. User feedback indicates significant improvements in debating skills and a highly satisfactory learning experience, with 85% of users reporting improved debating abilities and 78% finding the AI opponent appropriately challenging. The system's ability to maintain high factual accuracy (92% compared to 78% in human-only debates) while generating diverse arguments addresses critical concerns in AI-assisted discourse. DebateBrawl not only serves as an effective educational tool but also contributes to the broader goal of improving public discourse through AI-assisted argumentation. The paper discusses the ethical implications of AI in persuasive contexts and outlines the measures implemented to ensure responsible development and deployment of the system, including robust fact-checking mechanisms and transparency in decision-making processes.

The paper explores the concept of the rank of a bicomplex matrix, delving into four distinct types of ranks and investigating conditions under which these ranks are equivalent. It also defines and analyzes the concept of idempotent row space and idempotent column space of a bicomplex matrix. Some examples and counter examples have been presented to substantiate the study.

This study presents an integrated deep learning model for automatic detection and classification of Gastrointestinal bleeding in the frames extracted from Wireless Capsule Endoscopy (WCE) videos. The dataset has been released as part of Auto-WCBleedGen Challenge Version V2 hosted by the MISAHUB team. Our model attained the highest performance among 75 teams that took part in this competition. It aims to efficiently utilizes CNN based model i.e. DenseNet and UNet to detect and segment bleeding and non-bleeding areas in the real-world complex dataset. The model achieves an impressive overall accuracy of 80% which would surely help a skilled doctor to carry out further diagnostics.

This paper presents a novel approach to cloud storage challenges by integrating NextCloud, TrueNAS, and QEMU/KVM. Our research demonstrates how this combination creates a robust, flexible, and economical cloud storage system suitable for various applications. We detail the architecture, highlighting TrueNAS's ZFS-based storage, QEMU/KVM's virtualization, and NextCloud's user interface. Extensive testing showssuperior data integrity and protection compared to traditional solutions. Performance benchmarks reveal high read/write speeds(up to 1.22 GB/s for sequential reads and 620 MB/s for writes) and also efficient small file handling. We demonstrate the solution's scalability under increasing workloads. Security analysis showcases effective jail isolation techniques in TrueNAS. Cost analysis indicates potential 50% reduction in total ownership cost over five years compared to commercial alternatives. This research contributes a practical, high-performance, cost-effective alternative to proprietary solutions, paving new ways for organizations to implement secure, scalable cloud storage while maintaining data control. Future work will focus on improving automated scaling and integration with emerging technologies like containerization and serverless computing.

This paper presents an experimental framework for implementing Decentralized Autonomous Database Systems (DADBS) using the Rust programming language. As traditional centralized databases face challenges in scalability, security, and autonomy, DADBS emerge as a promising solution, using blockchain principles to create distributed, self-governing database systems. Our framework explores the practical aspects of building a DADBS, focusing on Rust's unique features that improves system reliability and performance. We evaluated our DADBS implementation across several key performance metrics: throughput, latency(read), latency(write), scalability, CPU utilization, Memory Usage and Network I/O, The average results obtained over a 24-hour period of continuous operation were 3,000 transactions/second, 75 ms, 250 ms, 55%, 2.5 GB, 100MB/s. The security analysis depicts that even with an increase in the percentage of malicious nodes, DADBS still maintains high throughput and consistency. The paper discusses key design decisions, highlighting how Rust's ownership model and concurrency features address common challenges in distributed systems. We also examine the current limitations of our approach and potential areas for future research. By providing this comprehensive overview of a Rust-based DADBS implementation, we aim to contribute to the growing body of knowledge on decentralized database architectures and their practical realization.

The Deutsch-Josza algorithm, one of the first and simplest quantum algorithms, is a natural candidate for small fault-tolerance experiments. We show that one can implement the Deutsch-Josza algorithm in a fault-tolerant manner using the smallest quantum error-detecting code -- the $[[4,2,2]]$ code -- without any ancillae. We implemented the algorithm on a trapped-ion quantum computer with and without fault-tolerant encoding and compared the results. With approximately $99 \%$ confidence, we found that the fault-tolerant implementation provides a noise reduction for all oracles. Averaged across all oracles, the reduction in error rate was nearly $90 \%$., Comment: 7 pages

Recently, text-to-image generation with diffusion models has made significant advancements in both higher fidelity and generalization capabilities compared to previous baselines. However, generating holistic multi-view consistent images from prompts still remains an important and challenging task. To address this challenge, we propose a diffusion process that attends to time-dependent spatial frequencies of features with a novel attention mechanism as well as novel noise initialization technique and cross-attention loss. This Fourier-based attention block focuses on features from non-overlapping regions of the generated scene in order to better align the global appearance. Our noise initialization technique incorporates shared noise and low spatial frequency information derived from pixel coordinates and depth maps to induce noise correlations across views. The cross-attention loss further aligns features sharing the same prompt across the scene. Our technique improves SOTA on several quantitative metrics with qualitatively better results when compared to other state-of-the-art approaches for multi-view consistency., Comment: WACV 2025

In deep learning, the loss function plays a crucial role in optimizing the network. Many recent innovations in loss techniques have been made, and various margin-based angular loss functions (metric loss) have been designed particularly for face recognition. The concept of transformers is already well-researched and applied in many facets of machine vision. This paper presents a technique for loss evaluation that uses a transformer network as an additive loss in the face recognition domain. The standard metric loss function typically takes the final embedding of the main CNN backbone as its input. Here, we employ a transformer-metric loss, a combined approach that integrates both transformer-loss and metric-loss. This research intends to analyze the transformer behavior on the convolution output when the CNN outcome is arranged in a sequential vector. The transformer encoder takes input from the contextual vectors obtained from the final convolution layer of the network. With this technique, we use transformer loss with various base metric-loss functions to evaluate the effect of the combined loss functions. We observe that such a configuration allows the network to achieve SoTA results on various validation datasets with some limitations. This research expands the role of transformers in the machine vision domain and opens new possibilities for exploring transformers as a loss function., Comment: Face Recognition using Transformer Loss

The Lyman alpha (Lya) forest in the spectra of z>5 quasars provides a powerful probe of the late stages of the Epoch of Reionization (EoR). With the recent advent of exquisite datasets such as XQR-30, many models have struggled to reproduce the observed large-scale fluctuations in the Lya opacity. Here we introduce a Bayesian analysis framework that forward-models large-scale lightcones of IGM properties, and accounts for unresolved sub-structure in the Lya opacity by calibrating to higher-resolution hydrodynamic simulations. Our models directly connect physically-intuitive galaxy properties with the corresponding IGM evolution, without having to tune "effective" parameters or calibrate out the mean transmission. The forest data, in combination with UV luminosity functions and the CMB optical depth, are able to constrain global IGM properties at percent level precision in our fiducial model. Unlike many other works, we recover the forest observations without evoking a rapid drop in the ionizing emissivity from z~7 to 5.5, which we attribute to our sub-grid model for recombinations. In this fiducial model, reionization ends at $z=5.44\pm0.02$ and the EoR mid-point is at $z=7.7\pm0.1$. The ionizing escape fraction increases towards faint galaxies, showing a mild redshift evolution at fixed UV magnitude, Muv. Half of the ionizing photons are provided by galaxies fainter than Muv~-12, well below direct detection limits of optical/NIR instruments including JWST. We also show results from an alternative galaxy model that does not allow for a redshift evolution in the ionizing escape fraction. Despite being decisively disfavored by the Bayesian evidence, the posterior of this model is in qualitative agreement with that from our fiducial model. We caution however that our conclusions regarding the early stages of the EoR and which sources reionized the Universe are more model-dependent., Comment: 21 pages, 12 figures, 3 tables (submitted to PASA)

Continuum damage mechanics (CDM) is a popular framework for modelling crack propagation in solids. The CDM uses a damage parameter to quantitatively assess what one loosely calls `material degradation'. While this parameter is sometimes given a physical meaning, the mathematical equations for its evolution are generally not consistent with such physical interpretations. Curiously, degradation in the CDM may be viewed as a change of measures, wherein the damage variable appears as the Radon-Nikodym derivative. We adopt this point of view and use a probabilistic measure-valued description for the random microcracks underlying quasi-brittle damage. We show that the evolution of the underlying density may be described via killed diffusion as in the Feynman-Kac theory. Damage growth is then interpreted as the reduction in this measure over a region, which in turn quantifies the disruption of bonds through a loss of force-transmitting mechanisms between nearby material points. Remarkably, the evolution of damage admits an approximate closed-form solution. This brings forth substantive computational ease, facilitating fast yet accurate simulations of large dimensional problems. By selecting an appropriate killing rate, one accounts for the irreversibility of damage and thus eliminates the need for ad-hoc history-dependent routes typically employed, say, in phase field modelling of damage. Our proposal FeynKrack (a short form for Feynman-Kac crack propagator) is validated and demonstrated for its efficacy through several simulations on quasi-brittle damage. It also offers a promising stochastic route for future explorations of non-equilibrium thermodynamic aspects of damage.

Purpose: To explore best-practice approaches for generating synthetic chest X-ray images and augmenting medical imaging datasets to optimize the performance of deep learning models in downstream tasks like classification and segmentation. Materials and Methods: We utilized a latent diffusion model to condition the generation of synthetic chest X-rays on text prompts and/or segmentation masks. We explored methods like using a proxy model and using radiologist feedback to improve the quality of synthetic data. These synthetic images were then generated from relevant disease information or geometrically transformed segmentation masks and added to ground truth training set images from the CheXpert, CANDID-PTX, SIIM, and RSNA Pneumonia datasets to measure improvements in classification and segmentation model performance on the test sets. F1 and Dice scores were used to evaluate classification and segmentation respectively. One-tailed t-tests with Bonferroni correction assessed the statistical significance of performance improvements with synthetic data. Results: Across all experiments, the synthetic data we generated resulted in a maximum mean classification F1 score improvement of 0.150453 (CI: 0.099108-0.201798; P=0.0031) compared to using only real data. For segmentation, the maximum Dice score improvement was 0.14575 (CI: 0.108267-0.183233; P=0.0064). Conclusion: Best practices for generating synthetic chest X-ray images for downstream tasks include conditioning on single-disease labels or geometrically transformed segmentation masks, as well as potentially using proxy modeling for fine-tuning such generations.

We aim to construct a machine-learning approach that allows for a pixel-by-pixel reconstruction of the intergalactic medium (IGM) density field for various warm dark matter (WDM) models using the Lyman-alpha forest. With this regression machinery, we constrain the mass of a potential WDM particle from observed Lyman-alpha sightlines directly from the density field. We design and train a Bayesian neural network on the supervised regression task of recovering the optical depth-weighted density field $\Delta_\tau$ as well as its reconstruction uncertainty from the Lyman-alpha forest flux field. We utilise the Sherwood-Relics simulation suite at $4.1\leq z \leq 5.0$ as the main training and validation dataset. Leveraging the density field recovered by our neural network, we construct an inference pipeline to constrain the WDM particle masses based on the probability distribution function of the density fields. We find that our trained Bayesian neural network can accurately recover within a $1\sigma$ error $\geq 85\%$ of the density field pixels from a validation simulated dataset that encompasses multiple WDM and thermal models of the IGM. When predicting on Lyman-alpha skewers generated using the alternative hydrodynamical code Nyx not included in the training data, we find a $1\sigma$ accuracy rate $\geq 75\%$. We consider 2 samples of observed Lyman-alpha spectra from the UVES and GHOST instruments, at $z=4.4$ and $z=4.9$ respectively and fit the density fields recovered by our Bayesian neural network to constrain WDM masses. We find lower bounds on the WDM particle mass of $m_{\mathrm{WDM}} \geq 3.8$ KeV and $m_{\mathrm{WDM}} \geq 2.2$ KeV at $2\sigma$ confidence, respectively. We are able to match current state-of-the-art WDM particle mass constraints using up to 40 times less observational data than Markov Chain Monte Carlo techniques based on the Lyman-alpha forest power spectrum., Comment: 12 pages, Submitted to A&A

In this article, we investigate the cardinality of Grobner basis under various orderings. We identify a family of polynomials F and a criteria for the monomial orderings such that the reduced Grobner basis is double exponential in cardinality. We also show that the said criteria is satisfied by orderings such as lexicographic, degree lexicographic and weighted orderings., Comment: 18 pages,2 figures

Circuit cutting allows quantum circuits larger than the available hardware to be executed. Cutting techniques split circuits into smaller subcircuits, run them on the hardware, and recombine results through classical post-processing. Circuit cutting techniques have been extensively researched over the last five years and it been adopted by major quantum hardware vendors as part of their scaling roadmaps. We examine whether current circuit cutting techniques are practical for orchestrating executions on fault-tolerant quantum computers. We conduct a resource estimation-based benchmarking of important quantum applications and different types of circuit cutting techniques. Our applications include practically relevant algorithms, such as Hamiltonian simulation, kernels such as quantum Fourier transform and more. To cut these applications, we use IBM's Qiskit cutting tool. We estimate resources for subcircuits using Microsoft's Azure Quantum Resource Estimator and develop models to determine the qubit, quantum and classical runtime needs of circuit cutting. We demonstrate that while circuit cutting works for small-scale systems, the exponential growth of the quantum runtime and the classical post-processing overhead as the qubit count increases renders it impractical for larger quantum systems with current implementation strategies. As we transition from noisy quantum hardware to fault-tolerance, our work provides important guidance for the design of quantum software and runtime systems.

Modern wireless communication systems have become increasingly complex due to the proliferation of wireless devices, increasing performance standards, and growing security threats. Managing these networks is becoming more challenging, requiring the use of advanced network management methods and tools. AI-driven network management systems such as Self-Optimizing Networks (SONs) are gaining attention. On the other hand, Large Language Models (LLMs) have been demonstrating exceptional zero-shot learning and generalization capabilities across several domains. In this paper, we leverage the potential of LLMs with SONs to enhance future network management systems. Specifically, we benchmark the use of various LLMs such as GPT-4, Llama, and Falcon, in a zero-shot setting based on their real-time network configuration recommendations. Our results indicate promising prospects for integrating LLMs into future network management systems.

Answering end user security questions is challenging. While large language models (LLMs) like GPT, LLAMA, and Gemini are far from error-free, they have shown promise in answering a variety of questions outside of security. We studied LLM performance in the area of end user security by qualitatively evaluating 3 popular LLMs on 900 systematically collected end user security questions. While LLMs demonstrate broad generalist ``knowledge'' of end user security information, there are patterns of errors and limitations across LLMs consisting of stale and inaccurate answers, and indirect or unresponsive communication styles, all of which impacts the quality of information received. Based on these patterns, we suggest directions for model improvement and recommend user strategies for interacting with LLMs when seeking assistance with security., Comment: 18 pages, 1 figure, 8 tables

This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration, cumulative probability distributions, and probabilistic modeling. The proposed quantum algorithm uses a custom unitary construction to achieve the desired partial sums with gate complexity and circuit depth of \(O(\log_2 M)\), where \(M\) represents the number of terms in the partial sum. For cases where \(M\) is a power of two, the unitary construction is straightforward; however, for arbitrary \(M\), we develop an efficient quantum algorithm to create the required unitary matrix. Computational examples for evaluation certain partial sums and numerical integration based on our proposed algorithm are provided. We also extend the algorithm to evaluate partial sums of even or odd components and more complex weighted sums over specified intervals., Comment: 14 pages, 3 figures

We propose and study a minimalist approach towards synthetic tabular data generation. The model consists of a minimalistic unsupervised SparsePCA encoder (with contingent clustering step or log transformation to handle nonlinearity) and XGboost decoder which is SOTA for structured data regression and classification tasks. We study and contrast the methodologies with (variational) autoencoders in several toy low dimensional scenarios to derive necessary intuitions. The framework is applied to high dimensional simulated credit scoring data which parallels real-life financial applications. We applied the method to robustness testing to demonstrate practical use cases. The case study result suggests that the method provides an alternative to raw and quantile perturbation for model robustness testing. We show that the method is simplistic, guarantees interpretability all the way through, does not require extra tuning and provide unique benefits.

The emergence of superconductivity in the octahedrally coordinated (1T) phase of TaS2 is preceded by the intriguing loss of long-range order in the charge density wave (CDW). Such decoherence, attainable by different methods, results in the formation of nm-sized coherent CDW domains bound by a two-dimensional network of domain walls (DW) - mosaic phase -, which has been proposed as the spatial origin of the superconductivity. Here, we report the atomic-scale characterization of the superconducting state of 1T-TaSSe, a model 1T compound exhibiting the CDW mosaic phase. We use high-resolution scanning tunneling spectroscopy and Andreev spectroscopy to probe the microscopic nature of the superconducting state in unambiguous connection with the electronic structure of the mosaic phase. Spatially resolved conductance maps at the Fermi level at the onset of superconductivity reveal that the density of states is mostly localized on the CDW domains compared to the domain walls, which suggests their dominant role in the formation of superconductivity. This scenario is confirmed within the superconducting dome at 340 mK, where superconductivity is fully developed, and the subtle spatial inhomogeneity of the superconducting gap remains unlinked to the domain wall network. Our results provide key new insights into the fundamental interplay between superconductivity and CDW in these relevant strongly correlated systems.

Misinformation about vaccination poses a significant public health threat by reducing vaccination rates and increasing disease burden. Understanding population heterogeneity can aid in recognizing and mitigating the effects of such misinformation, especially when vaccine effectiveness is low. Our research quantifies the impact of misinformation on vaccination uptake and explores its effects in heterogeneous versus homogeneous populations. We employed a dual approach combining ordinary differential equations (ODE) and complex network models to analyze how different epidemiological parameters influence disease spread and vaccination behaviour. Our results indicate that misinformation significantly lowers vaccination rates, particularly in homogeneous populations, while heterogeneous populations demonstrate greater resilience. Among network topologies, small-world networks achieve higher vaccination rates under varying vaccine efficacies, while scale-free networks experience reduced vaccine coverage with higher misinformation amplification. Notably, cumulative infection remains independent of disease transmission rate when the vaccine is partially effective. In small-world networks, cumulative infection shows high stochasticity across vaccination rates and misinformation parameters, while cumulative vaccination is highest with higher and lower misinformation. To control disease spread, public health efforts should address misinformation, particularly in homogeneous populations and scale-free networks. Building resilience by promoting reliable vaccine information can boost vaccination rates. Focusing campaigns on small-world networks can result in higher vaccine uptake.

Large language models (LLMs), with demonstrated reasoning abilities across multiple domains, are largely underexplored for time-series reasoning (TsR), which is ubiquitous in the real world. In this work, we propose TimerBed, the first comprehensive testbed for evaluating LLMs' TsR performance. Specifically, TimerBed includes stratified reasoning patterns with real-world tasks, comprehensive combinations of LLMs and reasoning strategies, and various supervised models as comparison anchors. We perform extensive experiments with TimerBed, test multiple current beliefs, and verify the initial failures of LLMs in TsR, evidenced by the ineffectiveness of zero shot (ZST) and performance degradation of few shot in-context learning (ICL). Further, we identify one possible root cause: the numerical modeling of data. To address this, we propose a prompt-based solution VL-Time, using visualization-modeled data and language-guided reasoning. Experimental results demonstrate that Vl-Time enables multimodal LLMs to be non-trivial ZST and powerful ICL reasoners for time series, achieving about 140% average performance improvement and 99% average token costs reduction.

Wireless networking is encouraged by the constant enhancement of sensors' ability and wireless communication. To provide service quality support for multimedia viz. audio and video streams, the IEEE 802.11e MAC (Media Access Control) improves basic 802.11 MAC. IEEE 802.11 standard series such as IEEE 802.11a, b, g, n, p, and ac have been promoted and specified in the current communications and connection development. Each standard has functionality that matches the kind of applications for which the standard is intended. IEEE 802.11ac has better performance with fewer interferences and achieves gigabits per second capacity transfer rates. This paper discusses the comparative examination of the IEEE 802.11a, IEEE 802.11b, IEEE 802.11g, IEEE 802.11n, IEEE 802.11p, and IEEE 802.11ac standards which increase accuracy and performance pertaining to the IEEE 802.11 standard. In this paper, we investigate the design requirements for numerous simultaneous peer-to-peer connections. Further, this study offers a systematic review and analysis of the MAC layer in WMN (Wireless Mesh Network) and also highlights their open research issues and challenges. Finally, this paper discusses various potential directions for future research in this area with an emphasis on their strengths and limitations., Comment: 20 pages, 5 figures, to be published in Wireless Pers Commun

Federated Learning (FL) is a distributed learning technique that maintains data privacy by providing a decentralized training method for machine learning models using distributed big data. This promising Federated Learning approach has also gained popularity in bioinformatics, where the privacy of biomedical data holds immense importance, especially when patient data is involved. Despite the successful implementation of Federated learning in biological sequence analysis, rigorous consideration is still required to improve accuracy in a way that data privacy should not be compromised. Additionally, the optimal integration of federated learning, especially in protein sequence analysis, has not been fully explored. We propose a deep feed-forward neural network-based enhanced federated learning method for protein sequence classification to overcome these challenges. Our method introduces novel enhancements to improve classification accuracy. We introduce dynamic weighted federated learning (DWFL) which is a federated learning-based approach, where local model weights are adjusted using weighted averaging based on their performance metrics. By assigning higher weights to well-performing models, we aim to create a more potent initial global model for the federated learning process, leading to improved accuracy. We conduct experiments using real-world protein sequence datasets to assess the effectiveness of DWFL. The results obtained using our proposed approach demonstrate significant improvements in model accuracy, making federated learning a preferred, more robust, and privacy-preserving approach for collaborative machine-learning tasks., Comment: Accepted at SIMBig 2024

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

Sign languages are the language of hearing-impaired people who use visuals like the hand, facial, and body movements for communication. There are different signs and gestures representing alphabets, words, and phrases. Nowadays approximately 300 sign languages are being practiced worldwide such as American Sign Language (ASL), Chinese Sign Language (CSL), Indian Sign Language (ISL), and many more. Sign languages are dependent on the vocal language of a place. Unlike vocal or spoken languages, there are no helping words in sign language like is, am, are, was, were, will, be, etc. As only a limited population is well-versed in sign language, this lack of familiarity of sign language hinders hearing-impaired people from communicating freely and easily with everyone. This issue can be addressed by a sign language recognition (SLR) system which has the capability to translate the sign language into vocal language. In this paper, a continuous SLR system is proposed using a deep learning model employing Long Short-Term Memory (LSTM), trained and tested on an ISL primary dataset. This dataset is created using MediaPipe Holistic pipeline for tracking face, hand, and body movements and collecting landmarks. The system recognizes the signs and gestures in real-time with 88.23% accuracy., Comment: 14 pages, 4 figures, Wireless Pers Commun

This paper introduces deterministic weighted real-time one-counter automaton (DWROCA). A DWROCA is a deterministic real-time one-counter automaton whose transitions are assigned a weight from a field. Two DWROCAs are equivalent if every word accepted by one is accepted by the other with the same weight. DWROCA is a sub-class of weighted one-counter automata with counter-determinacy. It is known that the equivalence problem for this model is in P. This paper gives a simpler proof and a better polynomial-time algorithm for checking the equivalence of two DWROCAs., Comment: 14 pages, 4 figures

In this paper, we shall compare two metrics in terms of orderly dependence, a notion developed in exponential vector space in the article 'Basis and Dimension of Exponential Vector Space' by Jayeeta Saha and Sandip Jana in Transactions of A. Razmadze Mathematical Institute Vol. 175 (2021), issue 1, 101-115. Exponential vector space, in short 'evs', is a partially ordered space associated with a commutative semigroup structure and a compatible scalar multiplication. In the present paper we shall show that the collection $\mathcal{D(\mathbf X)}$ of all metrics on a non-empty set $\mathbf X$, together with the constant function zero $O$, forms a topological exponential vector space. We shall discuss the orderly dependence of two metrics through our findings of a basis of $\mathcal{D(\mathbf X)}\smallsetminus\{O\}$ in different scenario. We shall characterise orderly independence of two elements of a topological evs in terms of the comparing function, another mechanism developed in topological exponential vector space, which can measure the degree of comparability of two elements of an evs. Finally, we shall discuss existence of orderly independent norms on a linear space. For an infinite dimensional linear space we shall construct a large number of orderly independent norms depending on the dimension of the linear space. Orderly independent norms are precisely those which are totally non-equivalent, in the sense that they produce incomparable topologies., Comment: arXiv admin note: text overlap with arXiv:2305.12154

Research has shown the effectiveness of reasoning (e.g., Chain-of-Thought), planning (e.g., SelfAsk), and retrieval augmented generation strategies to improve the performance of Large Language Models (LLMs) on various tasks, such as question answering. However, using a single fixed strategy to answer different kinds of questions is suboptimal in performance and inefficient in terms of generated output tokens and performed retrievals. In our work, we propose a novel technique DyPlan, to induce a dynamic strategy selection process in LLMs, to improve performance and reduce costs in question-answering. DyPlan incorporates an initial decision step to select the most suitable strategy conditioned on the input question and guides the LLM's response generation accordingly. We extend DyPlan to DyPlan-verify, adding an internal verification and correction process to further enrich the generated answer. Experiments on three prominent multi-hop question answering (MHQA) datasets reveal how DyPlan can improve model performance by 7-13% while reducing the cost by 11-32% relative to the best baseline model., Comment: Under review at ACL Rolling Review

In this paper, a heuristic for a heterogeneous min-max multi-vehicle multi-depot traveling salesman problem is proposed, wherein heterogeneous vehicles start from given depot locations and need to cover a given set of targets. In the considered problem, vehicles can be structurally heterogeneous due to different vehicle speeds and/or functionally heterogeneous due to different vehicle-target assignments originating from different sensing capabilities of vehicles. The proposed heuristic for the considered problem has three stages: an initialization stage to generate an initial feasible solution, a local search stage to improve the incumbent solution by searching through different neighborhoods, and a perturbation/shaking stage, wherein the incumbent solution is perturbed to break from a local minimum. In this study, three types of neighborhood searches are employed. Furthermore, two different methods for constructing the initial feasible solution are considered, and multiple variations in the neighborhoods considered are explored in this study. The considered variations and construction methods are evaluated on a total of 128 instances generated with varying vehicle-to-target ratios, distribution for generating the targets, and vehicle-target assignment and are benchmarked against the best-known heuristic for this problem. Two heuristics were finally proposed based on the importance provided to objective value or computation time through extensive computational studies.

We present a novel experimental approach to detect dark matter by probing Yukawa interactions, commonly referred to as a fifth force, between dark matter and baryonic matter. Our method involves optically levitating nanoparticles within a Bessel-Gaussian beam to detect minute forces exerted by potential dark matter interaction with test masses. The non-diffracting properties of Bessel-Gaussian beams, combined with feedback cooling techniques, provide exceptional sensitivity to small perturbations in the motion of the nanoparticles. This setup allows for precise control over trapping conditions and enhances the detection sensitivity to forces on the order of \(10^{-18}\) N. We explore the parameter space of the Yukawa interaction, focusing on the coupling strength (\(\alpha\)) and interaction range (\(\lambda\)), and discuss the potential of this experiment to place new constraints on dark matter couplings, complementing existing direct detection methods., Comment: 22 pages, 7 figures, 1 table

In this article we report on the application of the Quantum Approximate Optimization Algorithm (QAOA) to solve the unweighted MaxCut problem on tree-structured graphs. Specifically, we utilize the Nauty (No Automorphisms, Yes?) package to identify graph automorphisms, focusing on determining edge equivalence classes. These equivalence classes also correspond to symmetries in the terms of the associated Ising Hamiltonian. By exploiting these symmetries, we achieve a significant reduction in the complexity of the Hamiltonian, thereby facilitating more efficient quantum simulations. We conduct benchmark experiments on graphs with up to 34 nodes on memory and CPU intensive TPU provided by google Colab, applying QAOA with a single layer ($p=1$). The approximation ratios obtained from both the full and symmetry-reduced Hamiltonians are systematically compared. Our results show that using automorphism-based symmetries to reduce the Pauli terms in the Hamiltonian can significantly decrease computational overhead without compromising the quality of the solutions obtained., Comment: 13 pages, 2 figures

We introduce Planning-guided Retrieval Augmented Generation (Plan$\times$RAG), a novel framework that augments the \emph{retrieve-then-reason} paradigm of existing RAG frameworks to \emph{plan-then-retrieve}. Plan$\times$RAG formulates a reasoning plan as a directed acyclic graph (DAG), decomposing queries into interrelated atomic sub-queries. Answer generation follows the DAG structure, allowing significant gains in efficiency through parallelized retrieval and generation. While state-of-the-art RAG solutions require extensive data generation and fine-tuning of language models (LMs), Plan$\times$RAG incorporates frozen LMs as plug-and-play experts to generate high-quality answers. Compared to existing RAG solutions, Plan$\times$RAG demonstrates significant improvements in reducing hallucinations and bolstering attribution due to its structured sub-query decomposition. Overall, Plan$\times$RAG offers a new perspective on integrating external knowledge in LMs while ensuring attribution by design, contributing towards more reliable LM-based systems., Comment: 22 pages, preprint

The use of social media applications, hate speech engagement, and public debates among teenagers, primarily by university and college students, is growing day by day. The feelings of tremendous stress, anxiety, and depression via social media among our youths have a direct impact on their daily lives and personal workspace apart from delayed sleep, social media addictions, and memory loss. The use of NO phone times and NO phone zones is now popular in workplaces and family cultures. The use of hate speech, negotiations, and toxic words can lead to verbal abuse and cybercrime. Growing concern of mobile device security, cyberbullying, ransomware attacks, and mental health issues are another serious impact of social media among university students. The future challenges including health issues of social media use and hate speech has a serious impact on livelihood, freedom, and diverse communities of university students. Our case study is related to social media use and hate speech related to public debates over university students. We have presented the analysis and impact of social media and hate speech with several conclusions, cybercrimes, and components. The use of questionnaires for collecting primary data over university students help in the analysis of case study. The conclusion of case study and future scope of the research is extremely important to counter negative impacts., Comment: 12 pages, 7 figures

Gastrointestinal (GI) diseases represent a significant global health concern, with Capsule Endoscopy (CE) offering a non-invasive method for diagnosis by capturing a large number of GI tract images. However, the sheer volume of video frames necessitates automated analysis to reduce the workload on doctors and increase the diagnostic accuracy. In this paper, we present CapsuleNet, a deep learning model developed for the Capsule Vision 2024 Challenge, aimed at classifying 10 distinct GI abnormalities. Using a highly imbalanced dataset, we implemented various data augmentation strategies, reducing the data imbalance to a manageable level. Our model leverages a pretrained EfficientNet-b7 backbone, tuned with additional layers for classification and optimized with PReLU activation functions. The model demonstrated superior performance on validation data, achieving a micro accuracy of 84.5% and outperforming the VGG16 baseline across most classes. Despite these advances, challenges remain in classifying certain abnormalities, such as Erythema. Our findings suggest that CNN-based models like CapsuleNet can provide an efficient solution for GI tract disease classification, particularly when inference time is a critical factor., Comment: Capsule Vision 2024 Challenge

Factuality evaluation aims to detect factual errors produced by language models (LMs) and hence guide the development of more factual models. Towards this goal, we train a factuality evaluator, FenCE, that provides LM generators with claim-level factuality feedback. We conduct data augmentation on a combination of public judgment datasets to train FenCE to (1) generate textual critiques along with scores and (2) make claim-level judgment based on diverse source documents obtained by various tools. We then present a framework that leverages FenCE to improve the factuality of LM generators by constructing training data. Specifically, we generate a set of candidate responses, leverage FenCE to revise and score each response without introducing lesser-known facts, and train the generator by preferring highly scored revised responses. Experiments show that our data augmentation methods improve the evaluator's accuracy by 2.9% on LLM-AggreFact. With FenCE, we improve Llama3-8B-chat's factuality rate by 14.45% on FActScore, outperforming state-of-the-art factuality finetuning methods by 6.96%.

Automatic Speech Recognition (ASR) systems have been examined and shown to exhibit biases toward particular groups of individuals, influenced by factors such as demographic traits, accents, and speech styles. Noise can disproportionately impact speakers with certain accents, dialects, or speaking styles, leading to biased error rates. In this work, we introduce a novel framework DENOASR, which is a selective denoising technique to reduce the disparity in the word error rates between the two gender groups, male and female. We find that a combination of two popular speech denoising techniques, viz. DEMUCS and LE, can be effectively used to mitigate ASR disparity without compromising their overall performance. Experiments using two state-of-the-art open-source ASRs - OpenAI WHISPER and NVIDIA NEMO - on multiple benchmark datasets, including TIE, VOX-POPULI, TEDLIUM, and FLEURS, show that there is a promising reduction in the average word error rate gap across the two gender groups. For a given dataset, the denoising is selectively applied on speech samples having speech intelligibility below a certain threshold, estimated using a small validation sample, thus ameliorating the need for large-scale human-written ground-truth transcripts. Our findings suggest that selective denoising can be an elegant approach to mitigate biases in present-day ASR systems., Comment: Paper accepted at IEEE ICKG 2024

Digital payment systems have revolutionized financial transactions, offering unparalleled convenience and accessibility to users worldwide. However, the increasing popularity of these platforms has also attracted malicious actors seeking to exploit their vulnerabilities for financial gain. To address this challenge, robust and adaptable scam detection mechanisms are crucial for maintaining the trust and safety of digital payment ecosystems. This paper presents a comprehensive approach to scam detection, focusing on the Unified Payments Interface (UPI) in India, Google Pay (GPay) as a specific use case. The approach leverages Large Language Models (LLMs) to enhance scam classification accuracy and designs a digital assistant to aid human reviewers in identifying and mitigating fraudulent activities. The results demonstrate the potential of LLMs in augmenting existing machine learning models and improving the efficiency, accuracy, quality, and consistency of scam reviews, ultimately contributing to a safer and more secure digital payment landscape. Our evaluation of the Gemini Ultra model on curated transaction data showed a 93.33% accuracy in scam classification. Furthermore, the model demonstrated 89% accuracy in generating reasoning for these classifications. A promising fact, the model identified 32% new accurate reasons for suspected scams that human reviewers had not included in the review notes., Comment: 10 pages, 7 figures

The t-Distributed Stochastic Neighbor Embedding (t-SNE) has emerged as a popular dimensionality reduction technique for visualizing high-dimensional data. It computes pairwise similarities between data points by default using an RBF kernel and random initialization (in low-dimensional space), which successfully captures the overall structure but may struggle to preserve the local structure efficiently. This research proposes a novel approach called the Modified Isolation Kernel (MIK) as an alternative to the Gaussian kernel, which is built upon the concept of the Isolation Kernel. MIK uses adaptive density estimation to capture local structures more accurately and integrates robustness measures. It also assigns higher similarity values to nearby points and lower values to distant points. Comparative research using the normal Gaussian kernel, the isolation kernel, and several initialization techniques, including random, PCA, and random walk initializations, are used to assess the proposed approach (MIK). Additionally, we compare the computational efficiency of all $3$ kernels with $3$ different initialization methods. Our experimental results demonstrate several advantages of the proposed kernel (MIK) and initialization method selection. It exhibits improved preservation of the local and global structure and enables better visualization of clusters and subclusters in the embedded space. These findings contribute to advancing dimensionality reduction techniques and provide researchers and practitioners with an effective tool for data exploration, visualization, and analysis in various domains.

The performance of a text-to-speech (TTS) synthesis model depends on various factors, of which the quality of the training data is of utmost importance. Millions of data are collected around the globe for various languages, but resources for Indian languages are few. Although there are many efforts involved in data collection, a common set of protocols for data collection becomes necessary for building TTS systems in Indian languages primarily because of the need for a uniform development of TTS systems across languages. In this paper, we present our learnings on data collection efforts' for Indic languages over 15 years. These databases have been used in unit selection synthesis, hidden Markov model based, and end-to-end frameworks, and for generating prosodically rich TTS systems. The most significant feature of the data collected is that data purity enables building high-quality TTS systems with a comparatively small dataset compared to that of European/Chinese languages., Comment: Submitted to ICASSP 2025

In this paper, we study the problem of finding an envy-free allocation of indivisible goods among multiple agents. EFX, which stands for envy-freeness up to any good, is a well-studied relaxation of the envy-free allocation problem and has been shown to exist for specific scenarios. For instance, EFX is known to exist when there are only three agents [Chaudhury et al, EC 2020], and for any number of agents when there are only two types of valuations [Mahara, Discret. Appl. Math 2023]. We show that EFX allocations exist for any number of agents when there are at most three types of additive valuations., Comment: Changes in the new version: Updated citation styles and added one new definition

Large Language Models (LLMs) have demonstrated remarkable performance across various domains, including healthcare. However, their ability to effectively represent structured non-textual data, such as the alphanumeric medical codes used in records like ICD-10 or SNOMED-CT, is limited and has been particularly exposed in recent research. This paper examines the challenges LLMs face in processing medical codes due to the shortcomings of current tokenization methods. As a result, we introduce the UniStruct architecture to design a multimodal medical foundation model of unstructured text and structured data, which addresses these challenges by adapting subword tokenization techniques specifically for the structured medical codes. Our approach is validated through model pre-training on both an extensive internal medical database and a public repository of structured medical records. Trained on over 1 billion tokens on the internal medical database, the proposed model achieves up to a 23% improvement in evaluation metrics, with around 2% gain attributed to our proposed tokenization. Additionally, when evaluated on the EHRSHOT public benchmark with a 1/1000 fraction of the pre-training data, the UniStruct model improves performance on over 42% of the downstream tasks. Our approach not only enhances the representation and generalization capabilities of patient-centric models but also bridges a critical gap in representation learning models' ability to handle complex structured medical data, alongside unstructured text., Comment: NeurIPS 2024 Workshop on Unifying Representations in Neural Models (UniReps 2024)