Search

Traditional locomotion strategies become ineffective at low Reynolds numbers, where viscous forces predominate over inertial forces. To adapt, microorganisms have evolved specialized structures like cilia and flagella for efficient maneuvering in viscous environments. Among these organisms, Phytophthora zoospores demonstrate unique locomotion mechanisms that allow them to rapidly spread and attack new hosts while expending minimal energy. In this study, we present the design, fabrication, and testing of a zoospore-inspired robot, which leverages dual flexible flagella and oscillatory propulsion mechanisms to emulate the natural swimming behavior of zoospores. Our experiments and theoretical model reveal that both flagellar length and oscillation frequency strongly influence the robot's propulsion speed, with longer flagella and higher frequencies yielding enhanced performance. Additionally, the anterior flagellum, which generates a pulling force on the body, plays a dominant role in enhancing propulsion efficiency compared to the posterior flagellum's pushing force. This is a significant experimental finding, as it would be challenging to observe directly in biological zoospores, which spontaneously release the posterior flagellum when the anterior flagellum detaches. This work contributes to the development of advanced microscale robotic systems with potential applications in medical, environmental, and industrial fields. It also provides a valuable platform for studying biological zoospores and their unique locomotion strategies.

In this paper, we develop the first comprehensive tutorial on designing future 6G networks that synergistically integrate notions of resilience and criticality from the ground up. While resilience refers to the ability to absorb, adapt to, and recover from adversarial or challenging conditions, criticality indicates the degree of importance or urgency assigned to a particular service or component. Despite a spiking interest in designing resilient wireless networks, most prior works do not provide a unified resilience definition, nor harness the intricate interplay between resilience and criticality. In order to fill this gap, in this paper, we highlight the importance of a criticality-aware approach as a key enabler for providing reliable and resilient service functionality. Moreover, we delve into the unique challenges and opportunities of the envisioned 6G features pertaining to resilience and (mixed) criticality. After reviewing resilience definitions, we present a core resilience strategy, a unified resilience metric, different criteria for service criticality, and prioritization frameworks, that augment the 6G resilience prospects. Afterwards, we explore the opportunities presented by promising technologies that enable a resilient 6G network design from a radio access network protocol stack perspective. We briefly revisit state-of-the-art network architectures, establish a rough connection to the Open-RAN Alliance vision, and discuss opportunities, existing techniques, and promising enabling mechanisms for 6G at each layer. Finally, the article discusses important research directions and open problems concerning resilience and criticality in 6G., Comment: 23 pages, 7 figures. Submitted to IEEE for possible publication

As mission- and safety-critical wireless applications grow in complexity and diversity, next-generation wireless systems must meet increasingly stringent and multifaceted requirements. These systems demand resilience along with enhanced intelligence and adaptability to ensure reliable communication under diverse conditions. This paper proposes an event-based multi-stage resilience framework, offering a guideline for efficiently integrating a combination of error mitigation techniques. The framework is applied to a case study focusing on uplink transmission of mixed-criticality data in the presence of random link blockages. The proposed scheme combines multiple blockage mitigation strategies - rate-splitting multiple access (RSMA), one-sided access point cooperation, and central decoding - within an event-driven algorithm. Each method, increasing in effectiveness and complexity, is activated sequentially to systematically overcome blockages. We model a mixed-criticality queuing system and formulate two transmit power allocation problems, one for separate decoding and one for central decoding, to ensure queue stability and fairness. Simulations evaluate the delay performance under varying blockage durations and examine the cost tradeoffs among resilience mechanisms within the proposed framework. The results suggest that passive robustness strategies effectively handle frequent short-term fluctuations, while more complex adaptation becomes germane for rare and prolonged blockages. Additionally, the results emphasize the importance of criticality-awareness for resilient communication design., Comment: 13 pages, 8 figures, submitted to IEEE Transactions on Wireless Communications

The quantum acoustic framework has recently emerged as a non-perturbative, coherent approach to electron-lattice interactions, uncovering rich physics often obscured by perturbative methods with incoherent scattering events. Here, we model the coupled dynamics of electrons and acoustic lattice vibrations within this framework, representing lattice vibrations as coherent states and electrons as quantum wavepackets. We derive and numerically implement electron backaction on the lattice, providing both visual and quantitative insights into electron wavepacket evolution, self-trapping, and the formation of small acoustic polarons. We investigate polaron binding energies across varying material parameters and compute key observables-including mean square displacement, kinetic energy, potential energy, and vibrational energy-over time. Our findings reveal the conditions that favor polaron formation, which is enhanced by low temperatures, high deformation potential constants, slow sound velocities, high effective masses, and small Fermi surfaces. Additionally, we explore the impact of external electric and magnetic fields, showing that while polaron formation remains robust under moderate fields, it is weakly suppressed at higher field strengths. These results deepen our understanding of polaron dynamics and pave the way for future studies into non-trivial transport behavior in quantum materials., Comment: 11 pages, 5 figures

Accurate and reliable predictions of solar flares are essential due to their potentially significant impact on Earth and space-based infrastructure. Although deep learning models have shown notable predictive capabilities in this domain, current evaluations often focus on accuracy while neglecting interpretability and reliability--factors that are especially critical in operational settings. To address this gap, we propose a novel proximity-based framework for analyzing post hoc explanations to assess the interpretability of deep learning models for solar flare prediction. Our study compares two models trained on full-disk line-of-sight (LoS) magnetogram images to predict $\geq$M-class solar flares within a 24-hour window. We employ the Guided Gradient-weighted Class Activation Mapping (Guided Grad-CAM) method to generate attribution maps from these models, which we then analyze to gain insights into their decision-making processes. To support the evaluation of explanations in operational systems, we introduce a proximity-based metric that quantitatively assesses the accuracy and relevance of local explanations when regions of interest are known. Our findings indicate that the models' predictions align with active region characteristics to varying degrees, offering valuable insights into their behavior. This framework enhances the evaluation of model interpretability in solar flare forecasting and supports the development of more transparent and reliable operational systems., Comment: This is a preprint accepted at IEEE International Conference on Big Data 2024( IEEE BigData 2024) Conference

We find that Anderson localization ceases to exist when a random medium begins to move, but another type of fundamental quantum effect, Planckian diffusion $D = \alpha\hbar/m$, rises to replace it, with $\alpha $ of order of unity. Planckian diffusion supercedes the Planckian speed limit $\tau= \alpha \hbar/k_B T,$ as it not only implies this relation in thermal systems but also applies more generally without requiring thermal equilibrium. Here we model a dynamic disordered system with thousands of itinerant impurities, having random initial positions and velocities. By incrementally increasing their speed from zero, we observe a transition from Anderson localization to Planckian diffusion, with $\alpha$ falling within the range of $0.5$ to $2$. Furthermore, we relate the breakdown of Anderson localization to three additional, distinctly different confirming cases that also exhibit Planckian diffusion $D\sim \hbar/m$, including one experiment on solid hydrogen. Our finding suggests that Planckian diffusion in dynamic disordered systems is as universal as Anderson localization in static disordered systems, which may shed light on quantum transport studies.

Datasets often incorporate various functional patterns related to different aspects or regimes, which are typically not equally present throughout the dataset. We propose a novel, general-purpose partitioning algorithm that utilizes competition between models to detect and separate these functional patterns. This competition is induced by multiple models iteratively submitting their predictions for the dataset, with the best prediction for each data point being rewarded with training on that data point. This reward mechanism amplifies each model's strengths and encourages specialization in different patterns. The specializations can then be translated into a partitioning scheme. The amplification of each model's strengths inverts the active learning paradigm: while active learning typically focuses the training of models on their weaknesses to minimize the number of required training data points, our concept reinforces the strengths of each model, thus specializing them. We validate our concept -- called active partitioning -- with various datasets with clearly distinct functional patterns, such as mechanical stress and strain data in a porous structure. The active partitioning algorithm produces valuable insights into the datasets' structure, which can serve various further applications. As a demonstration of one exemplary usage, we set up modular models consisting of multiple expert models, each learning a single partition, and compare their performance on more than twenty popular regression problems with single models learning all partitions simultaneously. Our results show significant improvements, with up to 54% loss reduction, confirming our partitioning algorithm's utility.

Covert communication in wireless networks ensures that transmissions remain undetectable to adversaries, making it a potential enabler for privacy and security in sensitive applications. However, to meet the high performance and connectivity demands of sixth-generation (6G) networks, future wireless systems will require larger antenna arrays, higher operating frequencies, and advanced antenna architectures. This shift changes the propagation model from far-field planar-wave to near-field spherical-wave which necessitates a redesign of existing covert communication systems. Unlike far-field beamforming, which relies only on direction, near-field beamforming depends on both distance and direction, providing additional degrees of freedom for system design. In this paper, we aim to utilize those freedoms by proposing near-field Frequency Diverse Array (FDA)-based transmission strategies that manipulate the beampattern in both distance and angle, thereby establishing a non-covert region around the legitimate user. Our approach takes advantage of near-field properties and FDA technology to significantly reduce the area vulnerable to detection by adversaries while maintaining covert communication with the legitimate receiver. Numerical simulations show that our methods outperform conventional phased arrays by shrinking the non-covert region and allowing the covert region to expand as the number of antennas increases.

The standardization of an interface for dense linear algebra operations in the BLAS standard has enabled interoperability between different linear algebra libraries, thereby boosting the success of scientific computing, in particular in scientific HPC. Despite numerous efforts in the past, the community has not yet agreed on a standardization for sparse linear algebra operations due to numerous reasons. One is the fact that sparse linear algebra objects allow for many different storage formats, and different hardware may favor different storage formats. This makes the definition of a FORTRAN-style all-circumventing interface extremely challenging. Another reason is that opposed to dense linear algebra functionality, in sparse linear algebra, the size of the sparse data structure for the operation result is not always known prior to the information. Furthermore, as opposed to the standardization effort for dense linear algebra, we are late in the technology readiness cycle, and many production-ready software libraries using sparse linear algebra routines have implemented and committed to their own sparse BLAS interface. At the same time, there exists a demand for standardization that would improve interoperability, and sustainability, and allow for easier integration of building blocks. In an inclusive, cross-institutional effort involving numerous academic institutions, US National Labs, and industry, we spent two years designing a hardware-portable interface for basic sparse linear algebra functionality that serves the user needs and is compatible with the different interfaces currently used by different vendors. In this paper, we present a C++ API for sparse linear algebra functionality, discuss the design choices, and detail how software developers preserve a lot of freedom in terms of how to implement functionality behind this API., Comment: 43 pages

Reconfigurable Intelligent Surfaces (RIS) are emerging as a key technology for sixth-generation (6G) wireless networks, leveraging adjustable reflecting elements to dynamically control electromagnetic wave propagation and optimize wireless connectivity. By positioning the RIS on an unmanned aerial vehicle (UAV), it can maintain line-of-sight and proximity to both the transmitter and receiver, critical factors that mitigate path loss and enhance signal strength. The lightweight, power-efficient nature of RIS makes UAV integration feasible, yet the setup faces significant disturbances from UAV motion, which can degrade RIS alignment and link performance. In this study, we address these challenges using both experimental measurements and analytical methods. Using an extended Kalman filter (EKF), we estimate the UAV's orientation in real time during experimental flights to capture real disturbance effects. The resulting orientation uncertainty is then propagated to the RIS's channel estimates by applying the Guide to the Expression of Uncertainty in Measurement (GUM) framework as well as complex-valued propagation techniques to accurately assess and minimize the impact of UAV orientation uncertainties on RIS performance. This method enables us to systematically trace and quantify how orientation uncertainties affect channel gain and phase stability in real-time. Through numerical simulations, we find that the uncertainty of the RIS channel link is influenced by the RIS's configuration. Furthermore, our results demonstrate that the uncertainty area is most accurately represented by an annular section, enabling a 58% reduction in the uncertainty area while maintaining a 95% coverage probability., Comment: 6 pages, 3 figures, submitted to IEEE International Conference on Communications 2025

Recent advances in foundational Vision Language Models (VLMs) have reshaped the evaluation paradigm in computer vision tasks. These foundational models, especially CLIP, have accelerated research in open-vocabulary computer vision tasks, including Open-Vocabulary Semantic Segmentation (OVSS). Although the initial results are promising, the dense prediction capabilities of VLMs still require further improvement. In this study, we enhance the semantic segmentation performance of CLIP by introducing new modules and modifications: 1) architectural changes in the last layer of ViT and the incorporation of attention maps from the middle layers with the last layer, 2) Image Engineering: applying data augmentations to enrich input image representations, and 3) using Large Language Models (LLMs) to generate definitions and synonyms for each class name to leverage CLIP's open-vocabulary capabilities. Our training-free method, ITACLIP, outperforms current state-of-the-art approaches on segmentation benchmarks such as COCO-Stuff, COCO-Object, Pascal Context, and Pascal VOC. Our code is available at https://github.com/m-arda-aydn/ITACLIP.

Terahertz (THz) communication offers the necessary bandwidth to meet the high data rate demands of next-generation wireless systems. However, it faces significant challenges, including severe path loss, dynamic blockages, and beam misalignment, which jeopardize communication reliability. Given that many 6G use cases require both high data rates and strong reliability, robust transmission schemes that achieve high throughput under these challenging conditions are essential for the effective use of high-frequency bands. In this context, we propose a novel mixed-criticality superposition coding scheme for reconfigurable intelligent surface (RIS)-assisted THz systems. This scheme leverages both the strong but intermittent direct line-of-sight link and the more reliable, yet weaker, RIS path to ensure robust delivery of high-criticality data while maintaining high overall throughput. We model a mixed-criticality queuing system and optimize transmit power to meet reliability and queue stability constraints. Simulation results show that our approach significantly reduces queuing delays for critical data while sustaining high overall throughput, outperforming conventional time-sharing methods. Additionally, we examine the impact of blockage, beam misalignment, and beamwidth adaptation on system performance. These results demonstrate that our scheme effectively balances reliability and throughput under challenging conditions, while also underscoring the need for robust beamforming techniques to mitigate the impact of misalignment in RIS-assisted channels., Comment: 12 pages, 10 figures. Invited paper, submitted to the IEEE Open Journal of the Communication Society (OJ-COMS)

Current wireless communication technologies are insufficient in the face of ever-increasing demands. Therefore, novel and high-performance communication systems are needed. In this paper, a novel high data rate and high-performance index modulation scheme called double media-based modulation (DMBM) is proposed. The DMBM system doubles the number of mirror activation patterns (MAPs) and the number of transmitted symbols compared to the traditional MBM system during the same symbol period. In this way, the spectral efficiency of the DMBM is doubled and the error performance improves as the number of bits carried in the indices increases. Performance analysis of the DMBM scheme is evaluated for $M$-ary quadrature amplitude modulation ($M$-QAM) on Rayleigh fading channels. The error performance of the proposed DMBM system is compared with spatial modulation (SM), quadrature SM (QSM), MBM, and double SM (DSM) techniques. Also, the throughput, complexity, energy efficiency, spectral efficiency, and capacity analyses for the proposed DMBM system and SM, QSM, MBM, and DSM systems are presented. All analysis results show that the proposed DMBM system is superior to the compared systems., Comment: 7 pages, 7 figures, 2 tables

This study addresses critical challenges of cybersecurity in digital substations by proposing an innovative task-oriented dialogue (ToD) system for anomaly detection (AD) in multicast messages, specifically, generic object oriented substation event (GOOSE) and sampled value (SV) datasets. Leveraging generative artificial intelligence (GenAI) technology, the proposed framework demonstrates superior error reduction, scalability, and adaptability compared with traditional human-in-the-loop (HITL) processes. Notably, this methodology offers significant advantages over machine learning (ML) techniques in terms of efficiency and implementation speed when confronting novel and/or unknown cyber threats, while also maintaining model complexity and precision. The research employs advanced performance metrics to conduct a comparative assessment between the proposed AD and HITL-based AD frameworks, utilizing a hardware-in-the-loop (HIL) testbed for generating and extracting features of IEC61850 communication messages. This approach presents a promising solution for enhancing the reliability of power system operations in the face of evolving cybersecurity challenges., Comment: 5 pages, 4 figures, Submitted to 2025 IEEE Power and Energy Society General Meeting (PESGM 2025), Austin, TX

In the framework of the spatial circular Hill three-body problem we illustrate the application of symplectic invariants to analyze the network structure of symmetric periodic orbit families. The extensive collection of families within this problem constitutes a complex network, fundamentally comprising the so-called basic families of periodic solutions, including the orbits of the satellite $g$, $f$, the libration (Lyapunov) $a,c$, and collision $\mathcal B_0$ families. Since the Conley-Zehnder index leads to a grading on the local Floer homology and its Euler characteristics, a bifurcation invariant, the computation of those indices facilitates the construction of well-organized bifurcation graphs depicting the interconnectedness among families of periodic solutions. The critical importance of the symmetries of periodic solutions in comprehending the interaction among these families is demonstrated., Comment: 57 pages, 26 figures, 17 tables of data

In this paper, a novel approach for wireless localization is proposed and experimentally validated that leverages space-time coded reconfigurable intelligent surfaces (RIS). It is demonstrated that applying proper single-bit codes to each RIS element, enables accurate determination of the direction of arrival (AOA) at the receiver. Moreover, we introduce different scenarios that such technique can be used for localization. By incorporating RIS, a passive component, the method significantly reduces the complexity found in previous localization techniques. Additionally, the use of 1-bit codes minimizes hardware requirements, offering a reliable, low-cost solution for localization in advanced telecommunications networks.

This paper presents experimental realization of a reconfigurable intelligent surface (RIS) using space-time coding metasurfaces to enable concurrent beam steering and data modulation. The proposed approach harnesses the capabilities of metasurfaces, allowing precise temporal control over individual unit cells of the RIS. We show that by employing proper binary codes manipulating the state of unit cells, the RIS can act as a digital data modulator with beam steering capability. We describe the experimental setup and computational tools, followed by validation through harmonic generation and investigation of beam steering and data modulation. Additionally, four digital modulation schemes are evaluated. By implementing customized binary codes, constellations under varying conditions are compared, showcasing the potential for real-world applications. This study offers new insights into the practical implementation of RIS for advanced wireless communication systems.

We propose networked policy gradient play for solving Markov potential games including continuous action and state spaces. In the decentralized algorithm, agents sample their actions from parametrized and differentiable policies that depend on the current state and other agents' policy parameters. During training, agents estimate their gradient information through two consecutive episodes, generating unbiased estimators of reward and policy score functions. Using this information, agents compute the stochastic gradients of their policy functions and update their parameters accordingly. Additionally, they update their estimates of other agents' policy parameters based on the local estimates received through a time-varying communication network. In Markov potential games, there exists a potential value function among agents with gradients corresponding to the gradients of local value functions. Using this structure, we prove the almost sure convergence of joint policy parameters to stationary points of the potential value function. We also show that the convergence rate of the networked policy gradient algorithm is $\mathcal{O}(1/\epsilon^2)$. Numerical experiments on a dynamic multi-agent newsvendor problem verify the convergence of local beliefs and gradients. It further shows that networked policy gradient play converges as fast as independent policy gradient updates, while collecting higher rewards., Comment: 22 pages, journal version

We propose a novel approach for learning interchangeable tokens in language models to obtain an extendable vocabulary that can generalize to new tokens. Our method is designed to address alpha-equivalence, the principle that renaming bound variables in a syntactic expression preserves semantics. This property arises in many formal languages such as temporal logics, in which all proposition symbols represent the same concept but are distinguishable from each other. To handle such tokens, we develop a dual-part embedding approach. The first part is shared across all interchangeable tokens, thereby enforcing that they represent the same core concept. The second part is randomly generated for each token, which enables distinguishability. We evaluate our method in a Transformer encoder-decoder model on two tasks: solving linear temporal logic formulae and copying with extendable vocabulary. Our method demonstrates promising generalization capabilities in addition to introducing a favorable inductive bias for alpha-equivalence., Comment: 14 pages, 5 figures

Teleoperated driving (ToD) systems are a special type of cyber-physical system (CPS) where the operator remotely controls the steering, acceleration, and braking actions of the vehicle. Malicious actors may inject false data into communication channels to manipulate the teleoperator's driving commands to cause harm. Hence, protection of this communication is necessary for a safe operation of the target vehicle. However, according to the National Institute of Standards and Technology (NIST) cybersecurity framework, protection is not enough, and detecting an attack is necessary. Moreover, UN R155 mandates that vehicle fleets detect and log security incidents. Thus, the cyber-physical threats of ToD are modeled using the attack-centric approach in this paper. Then, an attack model with false data injection (FDI) on the steering control command is created from real vehicle data. A risk of this attack model is assessed for a last-mile delivery (LMD) application. Finally, a physics-based context-aware anomaly detection system (PCADS) is proposed to detect such false injection attacks, and preliminary experimental results are presented to validate the model., Comment: 27 pages, 14 figures, Submitted to IET Intelligent Transport Systems

Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from cyclic codes or their generalizations over $F_q$. Unless explicit benefits are demonstrated for the indirect approach, we believe that direct and more elementary methods should be preferred.

The sector of information and communication technology (ICT) can contribute to the fulfillment of the Paris agreement and the sustainable development goals (SDGs) through the introduction of sustainability strategies. For environmental sustainability, such strategies should contain efficiency, sufficiency, and consistency measures. To propose such, a structural analysis of ICT is undertaken in this manuscript. Thereby, key mechanisms and dynamics behind the usage of ICT and the corresponding energy and resource use are analyzed by describing ICT as a complex system. The system contains data centers, communication networks, smartphone hardware, apps, and the behavior of the users as sub-systems, between which various Morinian interactions are present. Energy and non-energy resources can be seen as inputs of the system, while e-waste is an output. Based on the system description, we propose multiple measures for efficiency, sufficiency and consistency to reduce greenhouse gas emissions and other environmental impacts.

Regression analysis of non-normal correlated data is commonly performed using generalized linear mixed models (GLMM) and generalized estimating equations (GEE). The recent development of generalized joint regression models (GJRM) presents an alternative to these approaches by using copulas to flexibly model response variables and their dependence structures. This paper provides a simulation study that compares the GJRM with alternative methods. We focus on the case of the marginal distributions having the same form, for example, in models for longitudinal data. We find that for the normal model with identity link, all models provide accurate estimates of the parameters of interest. However, for non-normal models and when a non-identity link function is used, GLMMs in general provide biased estimates of marginal model parameters with inaccurately low standard errors. GLMM bias is more pronounced when the marginal distributions are more skewed or highly correlated. However, in the case that a GLMM parameter is estimated independently of the random effect term, we show it is possible to extract accurate parameter estimates, shown for a longitudinal time parameter with a logarithmic link model. In contrast, we find that GJRM and GEE provide unbiased estimates for all parameters with accurate standard errors when using a logarithmic link. In addition, we show that GJRM provides a model fit comparable to GLMM. In a real-world study of doctor visits, we further demonstrate that the GJRM provides better model fits than a comparable GEE or GLM, due to its greater flexibility in choice of marginal distribution and copula fit to dependence structures. We conclude that the GJRM provides a superior approach to current popular models for analysis of non-normal correlated data.

The growing use of Machine Learning and Artificial Intelligence (AI), particularly Large Language Models (LLMs) like OpenAI's GPT series, leads to disruptive changes across organizations. At the same time, there is a growing concern about how organizations handle personal data. Thus, privacy policies are essential for transparency in data processing practices, enabling users to assess privacy risks. However, these policies are often long and complex. This might lead to user confusion and consent fatigue, where users accept data practices against their interests, and abusive or unfair practices might go unnoticed. LLMss can be used to assess privacy policies for users automatically. In this interdisciplinary work, we explore the challenges of this approach in three pillars, namely technical feasibility, ethical implications, and legal compatibility of using LLMs to assess privacy policies. Our findings aim to identify potential for future research, and to foster a discussion on the use of LLM technologies for enabling users to fulfil their important role as decision-makers in a constantly developing AI-driven digital economy., Comment: Published at AISyS 2024

Future wireless systems are expected to deliver significantly higher quality-of-service (QoS) albeit with fewer energy resources for diverse, already existing and also novel wireless applications. The optimal resource allocation for a system in this regard could be investigated by reducing the overall power available at the expense of reduced QoS for the inefficient users. In other words, we maximize the system energy efficiency by achieving power saving through a minimal back-off in terms of QoS. In this paper, we investigate the energy efficiency vs. delivered QoS trade-off for the rate-splitting multiple access (RSMA) assisted downlink system. We first determine the user grouping with a normalised channel similarity metric so as to allow a large number of users with non-zero achievable private message rates. Through the private message removal (PMR) of these users, we aim to investigate the QoS vs. energy efficiency trade-off. Numerical results indicate a peak of ~$10\%$ increase in the network energy efficiency for the proposed normalised channel similarity metric based user grouping with scheduled PMR., Comment: 5 pages, 4 figures, IEEE SPAWC 2024 Conference version

We construct a general family of quantum codes that protect against all emission, absorption, dephasing, and raising/lowering errors up to an arbitrary fixed order. Such codes are known in the literature as absorption-emission (AE) codes. We derive simplified error correction conditions for a general AE code and show that any permutation-invariant code that corrects $\le t$ errors can be mapped to an AE code that corrects up to order-$t$ transitions. Carefully tuning the parameters of permutationally invariant codes, we construct several examples of efficient AE codes, hosted in systems with low total angular momentum. Our results also imply that spin codes can be mapped to AE codes, enabling us to characterize logical operators for certain subclasses of such codes.

Neural network modeling is a key technology of science and research and a platform for deployment of algorithms to systems. In wireless communications, system modeling plays a pivotal role for interference cancellation with specifically high requirements of accuracy regarding the elimination of self-interference in full-duplex relays. This paper hence investigates the potential of identification and representation of the self-interference channel by neural network architectures. The approach is promising for its ability to cope with nonlinear representations, but the variability of channel characteristics is a first obstacle in straightforward application of data-driven neural networks. We therefore propose architectures with a touch of "adaptivity" to accomplish a successful training. For reproducibility of results and further investigations with possibly stronger models and enhanced performance, we document and share our data.

Deep learning-based methods have been widely researched in the areas of language and vision, demonstrating their capacity to understand long sequences of data and their usefulness in numerous helio-physics applications. Foundation models (FMs), which are pre-trained on a large-scale datasets, form the basis for a variety of downstream tasks. These models, especially those based on transformers in vision and language, show exceptional potential for adapting to a wide range of downstream applications. In this paper, we provide our perspective on the criteria for designing an FM for heliophysics and associated challenges and applications using the Solar Dynamics Observatory (SDO) dataset. We believe that this is the first study to design an FM in the domain of heliophysics., Comment: 31 Pages, 12 figures

Limbless organisms of all sizes use undulating patterns of self-deformation to locomote. Geometric mechanics, which maps deformations to motions, provides a powerful framework to formalize and investigate the theoretical properties and limitations of such modes of locomotion. However, the inherent level of abstraction poses a challenge when bridging the gap between theory or simulations and laboratory experiments. We investigate the challenges of modeling motion trajectories of an undulating robotic locomotor by comparing experiments and simulations performed with a variational integrator. Despite the extensive simplifications that the model based on a geometric variation principle entails, the simulations show good agreement on average. Notably, our approach merely requires the knowledge of the \emph{dissipation metric} -- a Riemannian metric on the configuration space, which can in practice be approximated by means closely resembling \emph{resistive force theory}.

Cerebrovascular disease often requires multiple imaging modalities for accurate diagnosis, treatment, and monitoring. Computed Tomography Angiography (CTA) and Time-of-Flight Magnetic Resonance Angiography (TOF-MRA) are two common non-invasive angiography techniques, each with distinct strengths in accessibility, safety, and diagnostic accuracy. While CTA is more widely used in acute stroke due to its faster acquisition times and higher diagnostic accuracy, TOF-MRA is preferred for its safety, as it avoids radiation exposure and contrast agent-related health risks. Despite the predominant role of CTA in clinical workflows, there is a scarcity of open-source CTA data, limiting the research and development of AI models for tasks such as large vessel occlusion detection and aneurysm segmentation. This study explores diffusion-based image-to-image translation models to generate synthetic CTA images from TOF-MRA input. We demonstrate the modality conversion from TOF-MRA to CTA and show that diffusion models outperform a traditional U-Net-based approach. Our work compares different state-of-the-art diffusion architectures and samplers, offering recommendations for optimal model performance in this cross-modality translation task.

In recent years, transformer-based architectures become the de facto standard for sequence modeling in deep learning frameworks. Inspired by the successful examples, we propose a causal visual-inertial fusion transformer (VIFT) for pose estimation in deep visual-inertial odometry. This study aims to improve pose estimation accuracy by leveraging the attention mechanisms in transformers, which better utilize historical data compared to the recurrent neural network (RNN) based methods seen in recent methods. Transformers typically require large-scale data for training. To address this issue, we utilize inductive biases for deep VIO networks. Since latent visual-inertial feature vectors encompass essential information for pose estimation, we employ transformers to refine pose estimates by updating latent vectors temporally. Our study also examines the impact of data imbalance and rotation learning methods in supervised end-to-end learning of visual inertial odometry by utilizing specialized gradients in backpropagation for the elements of SE$(3)$ group. The proposed method is end-to-end trainable and requires only a monocular camera and IMU during inference. Experimental results demonstrate that VIFT increases the accuracy of monocular VIO networks, achieving state-of-the-art results when compared to previous methods on the KITTI dataset. The code will be made available at https://github.com/ybkurt/VIFT., Comment: Accepted to ECCV 2024 2nd Workshop on Vision-Centric Autonomous Driving (VCAD)

The MIT/IEEE/Amazon GraphChallenge encourages community approaches to developing new solutions for analyzing graphs and sparse data derived from social media, sensor feeds, and scientific data to discover relationships between events as they unfold in the field. The anonymized network sensing Graph Challenge seeks to enable large, open, community-based approaches to protecting networks. Many large-scale networking problems can only be solved with community access to very broad data sets with the highest regard for privacy and strong community buy-in. Such approaches often require community-based data sharing. In the broader networking community (commercial, federal, and academia) anonymized source-to-destination traffic matrices with standard data sharing agreements have emerged as a data product that can meet many of these requirements. This challenge provides an opportunity to highlight novel approaches for optimizing the construction and analysis of anonymized traffic matrices using over 100 billion network packets derived from the largest Internet telescope in the world (CAIDA). This challenge specifies the anonymization, construction, and analysis of these traffic matrices. A GraphBLAS reference implementation is provided, but the use of GraphBLAS is not required in this Graph Challenge. As with prior Graph Challenges the goal is to provide a well-defined context for demonstrating innovation. Graph Challenge participants are free to select (with accompanying explanation) the Graph Challenge elements that are appropriate for highlighting their innovations., Comment: Accepted to IEEE HPEC 2024

Traditional solar flare forecasting approaches have mostly relied on physics-based or data-driven models using solar magnetograms, treating flare predictions as a point-in-time classification problem. This approach has limitations, particularly in capturing the evolving nature of solar activity. Recognizing the limitations of traditional flare forecasting approaches, our research aims to uncover hidden relationships and the evolutionary characteristics of solar flares and their source regions. Our previously proposed Sliding Window Multivariate Time Series Forest (Slim-TSF) has shown the feasibility of usage applied on multivariate time series data. A significant aspect of this study is the comparative analysis of our updated Slim-TSF framework against the original model outcomes. Preliminary findings indicate a notable improvement, with an average increase of 5\% in both the True Skill Statistic (TSS) and Heidke Skill Score (HSS). This enhancement not only underscores the effectiveness of our refined methodology but also suggests that our systematic evaluation and feature selection approach can significantly advance the predictive accuracy of solar flare forecasting models., Comment: This is a preprint accepted at the 26th International Conference on Big Data Analytics and Knowledge Discovery (DAWAK 2024)

Understanding what is normal is a key aspect of protecting a domain. Other domains invest heavily in observational science to develop models of normal behavior to better detect anomalies. Recent advances in high performance graph libraries, such as the GraphBLAS, coupled with supercomputers enables processing of the trillions of observations required. We leverage this approach to synthesize low-parameter observational models of anonymized Internet traffic with a high regard for privacy., Comment: Accepted to IEEE HPEC, 7 pages, 6 figures, 1 table, 41 references

Background: This study aimed to evaluate and compare the performance of classical machine learning models (CMLs) and large language models (LLMs) in predicting mortality associated with COVID-19 by utilizing a high-dimensional tabular dataset. Materials and Methods: We analyzed data from 9,134 COVID-19 patients collected across four hospitals. Seven CML models, including XGBoost and random forest (RF), were trained and evaluated. The structured data was converted into text for zero-shot classification by eight LLMs, including GPT-4 and Mistral-7b. Additionally, Mistral-7b was fine-tuned using the QLoRA approach to enhance its predictive capabilities. Results: Among the CML models, XGBoost and RF achieved the highest accuracy, with F1 scores of 0.87 for internal validation and 0.83 for external validation. In the LLM category, GPT-4 was the top performer with an F1 score of 0.43. Fine-tuning Mistral-7b significantly improved its recall from 1% to 79%, resulting in an F1 score of 0.74, which was stable during external validation. Conclusion: While LLMs show moderate performance in zero-shot classification, fine-tuning can significantly enhance their effectiveness, potentially aligning them closer to CML models. However, CMLs still outperform LLMs in high-dimensional tabular data tasks., Comment: Code is available at: https://github.com/mohammad-gh009/Large-Language-Models-vs-Classical-Machine-learning and https://github.com/Sdamirsa/Tehran_COVID_Cohort. The datasets are available from the corresponding author on reasonable request (sdamirsa@ymail.com)

Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid solvers, and randomized sketching. Distributed-memory parallel algorithms for SpGEMM have mainly focused on sparsity-oblivious approaches that use 2D and 3D partitioning. Sparsity-aware 1D algorithms can theoretically reduce communication by not fetching nonzeros of the sparse matrices that do not participate in the multiplication. Here, we present a distributed-memory 1D SpGEMM algorithm and implementation. It uses MPI RDMA operations to mitigate the cost of packing/unpacking submatrices for communication, and it uses a block fetching strategy to avoid excessive fine-grained messaging. Our results show that our 1D implementation outperforms state-of-the-art 2D and 3D implementations within CombBLAS for many configurations, inputs, and use cases, while remaining conceptually simpler., Comment: Accepted by 2024 International Conference on High Performance Computing, Networking, Storage and Analysis, 2024 (SC'24)

Time-Lock Puzzles (TLPs) have been developed to securely transmit sensitive information into the future without relying on a trusted third party. Multi-instance TLP is a scalable variant of TLP that enables a server to efficiently find solutions to different puzzles provided by a client at once. Nevertheless, existing multi-instance TLPs lack support for (verifiable) homomorphic computation. To address this limitation, we introduce the "Multi-Instance partially Homomorphic TLP" (MH-TLP), a multi-instance TLP supporting efficient verifiable homomorphic linear combinations of puzzles belonging to a client. It ensures anyone can verify the correctness of computations and solutions. Building on MH-TLP, we further propose the "Multi-instance Multi-client verifiable partially Homomorphic TLP" (MMH-TLP). It not only supports all the features of MH-TLP but also allows for verifiable homomorphic linear combinations of puzzles from different clients. Our schemes refrain from using asymmetric-key cryptography for verification and, unlike most homomorphic TLPs, do not require a trusted third party. A comprehensive cost analysis demonstrates that our schemes scale linearly with the number of clients and puzzles., Comment: arXiv admin note: text overlap with arXiv:2406.15070