Search

To achieve autonomy in complex real-world exploration missions, we consider deployment strategies for a team of robots with heterogeneous autonomy capabilities. In this work, we formulate a multi-robot exploration mission and compute an operation policy to maintain robot team productivity and maximize mission rewards. The environment description, robot capability, and mission outcome are modeled as a Markov decision process (MDP). We also include constraints in real-world operation, such as sensor failures, limited communication coverage, and mobility-stressing elements. Then, we study the proposed operation model on a real-world scenario in the context of the DARPA Subterranean (SubT) Challenge. The computed deployment policy is also compared against the human-based operation strategy in the final competition of the SubT Challenge. Finally, using the proposed model, we discuss the design trade-off on building a multi-robot team with heterogeneous capabilities.

A new three-phase hybrid-excited multi-tooth switched reluctance motor with embedded permanent magnets is proposed, capable of achieving higher torque density for transportation electrification applications. Operating principles and design considerations are discussed. A magnetic equivalent circuit is developed. Finite element method is employed in the field analysis. The advantages of the proposed topology over existing designs for switched reluctance motors and flux switching motors are presented. Finally, the optimized design is prototyped to experimentally confirm the design and simulation results.

This paper focuses on designing new motors with high torque density, which is crucial for applications ranging from electric vehicles to robotics. We propose a double-teeth C-core switched reluctance motor with hybrid excitation, integrating permanent magnets and a novel drive technique to enhance motor torque density. We explore three magnet placement configurations to maximize torque. A common challenge with most self-starting methods used in two-phase SRMs is the generation of negative torque, which reduces the motor's torque density. Our adopted self-starting method minimizes negative torque, and we introduce a new drive strategy to control the switching on and off, effectively eliminating negative torque. Additionally, magnetic equivalent circuits are developed for the analytical design and theoretical analysis of all configurations. The SRMs under study are prototyped and tested, and their performances are evaluated in terms of torque-angle characteristics, current, and voltage. Both experimental and simulation results validate the effectiveness of the PM-assisted SRMs in enhancing torque density and efficiency.

This paper investigates the optimized combination of rotor and stator teeth in a three-phase switched reluctance motor featuring a connected C-core topology to attain a larger winding area and, thus, a higher electrical loading capability, leading to a higher torque density. The general formulation is discussed. Additionally, the shorter flux path within the design leads to a reduced core loss. The finite element method is employed in the design and field analysis. A comparison with a conventional motor shows the superiority of the proposed configuration. The optimized design is prototyped and tested. Both static and dynamic torques are extracted. A good correlation between simulation and experimental results is observed.

A novel radial-flux eddy-current coupler with interior permanent magnets (IPM) is proposed, providing higher demagnetization tolerance, making it well-suited for applications with limited accessibility, such as offshore wind generation. Finite element analysis is employed in the design and derivation of coupler quantities. Finally, the coupler is prototyped to experimentally validate the design and the simulation results.

We study the realization spaces of matroids and hyperplane arrangements. First, we define the notion of naive dimension for the realization space of matroids and compare it with the expected dimension and the algebraic dimension, exploring the conditions under which these dimensions coincide. Next, we introduce the family of inductively connected matroids and investigate their realization spaces, establishing that they are smooth, irreducible, and isomorphic to a Zariski open subset of a complex space with a known dimension. Furthermore, we present an explicit procedure for computing their defining equations. As corollaries, we identify families of hyperplane arrangements whose moduli spaces are connected. Finally, we apply our results to study the rigidity of matroids. Rigidity, which involves matroids with a unique realization under projective transformations, is key to understanding the connectivity of the moduli spaces of the corresponding hyperplane arrangements., Comment: Comments are welcome!

The increasing integration of the Internet of Medical Things (IoMT) into healthcare systems has significantly enhanced patient care but has also introduced critical cybersecurity challenges. This paper presents a novel approach based on Convolutional Neural Networks (CNNs) for detecting cyberattacks within IoMT environments. Unlike previous studies that predominantly utilized traditional machine learning (ML) models or simpler Deep Neural Networks (DNNs), the proposed model leverages the capabilities of CNNs to effectively analyze the temporal characteristics of network traffic data. Trained and evaluated on the CICIoMT2024 dataset, which comprises 18 distinct types of cyberattacks across a range of IoMT devices, the proposed CNN model demonstrates superior performance compared to previous state-of-the-art methods, achieving a perfect accuracy of 99% in binary, categorical, and multiclass classification tasks. This performance surpasses that of conventional ML models such as Logistic Regression, AdaBoost, DNNs, and Random Forests. These findings highlight the potential of CNNs to substantially improve IoMT cybersecurity, thereby ensuring the protection and integrity of connected healthcare systems., Comment: 7 pages, 4 figures, Accepted at Iranian Conference on Intelligent Systems (ICIS) 23-24 October, 2024, Sirjan University of Technology, Sirjan, Kerman, Iran. \c{opyright} 2024 IEEE. Personal use of this material is permitted. The accepted version is shared here. For the final published version, refer to the IEEE Xplore Digital Library

We prove an effective closing lemma for unipotent flows on quotients of perfect real groups. This is largely motivated by recent developments in effective unipotent dynamics., Comment: 24 pages

This study addresses a neglected challenge that has been hidden in the Rotary Transformer (RT) field: the possibility of a discrepancy between transformer ratio and turn number ratio in small-size transformers. Previous investigations have shown that in the geometry design of RTs, as well as their resonant circuit design, the transformer ratio has been regarded as the same as the turn number ratio. This estimation is logical and true when a large-size RT is investigated. However, in small-size RTs, the magnitudes of leakage and magnetization inductances are significantly close, which leads to a difference between transformer ratio and turn number ratio. Accordingly, the absence of an exact methodology for transformer ratio calculation brought us to conduct this investigation. In this regard, a transformer ratio adjustment is suggested after proposing a low-error magnetic model. Its accuracy is high enough to consider different air gaps and subsequently calculate inductance with reference to 3D finite element analysis (3D-FEA). Finally, we take advantage of a test bench to show the exactness and proficiency of the suggested transformer ratio adjustment.

In response to global warming and energy shortages, there has been a significant shift towards integrating renewable energy sources, energy storage systems, and electric vehicles. Deploying electric vehicles within smart grids offers a promising solution to reduce carbon emissions. However, managing the charging and discharging processes of them as distributed power supplies present significant challenges. Additionally, the intermittent nature of renewable energy, uncertainties in electric vehicle-related parameters, fluctuating energy prices, and varying loads make maintaining stable power system operations more complex. Effective management systems for electric vehicle battery charging are crucial to coordinating these processes and ensuring a secure, efficient, and reliable power system. Reinforcement learning, enhanced by deep learning, has gained substantial interest for its model-free approach and real-time optimization, effectively managing electric vehicle charging by maximizing cumulative rewards. This review synthesizes existing literature on reinforcement learning-based frameworks, objectives, and architectures for electric vehicle charging coordination strategies in power systems, classifying methods into centralized and decentralized categories. Additionally, the article offers suggestions for future research directions to further enhance reinforcement learning-based electric vehicle charging optimization., Comment: 6 pages, 1 Figure

In this paper, we investigate the geometric phase (GP) acquired by two-mode mixed squeezed-coherent states (SCSs) during unitary cyclic evolution, focusing on the influence of squeezing parameters and classical weight. We analyze the GP for three distinct mixed states characterized by different configurations of the SCSs. Our results reveal that increasing the squeezing parameters of individual modes compresses the GP contours in different patterns: linearly, hyperbolically, and elliptically, depending on the mixed-state configuration. This behavior highlights the precision enhancement in squeezed states through uncertainty adjustment, aligning with theoretical predictions.

The Workflows Community Summit gathered 111 participants from 18 countries to discuss emerging trends and challenges in scientific workflows, focusing on six key areas: time-sensitive workflows, AI-HPC convergence, multi-facility workflows, heterogeneous HPC environments, user experience, and FAIR computational workflows. The integration of AI and exascale computing has revolutionized scientific workflows, enabling higher-fidelity models and complex, time-sensitive processes, while introducing challenges in managing heterogeneous environments and multi-facility data dependencies. The rise of large language models is driving computational demands to zettaflop scales, necessitating modular, adaptable systems and cloud-service models to optimize resource utilization and ensure reproducibility. Multi-facility workflows present challenges in data movement, curation, and overcoming institutional silos, while diverse hardware architectures require integrating workflow considerations into early system design and developing standardized resource management tools. The summit emphasized improving user experience in workflow systems and ensuring FAIR workflows to enhance collaboration and accelerate scientific discovery. Key recommendations include developing standardized metrics for time-sensitive workflows, creating frameworks for cloud-HPC integration, implementing distributed-by-design workflow modeling, establishing multi-facility authentication protocols, and accelerating AI integration in HPC workflow management. The summit also called for comprehensive workflow benchmarks, workflow-specific UX principles, and a FAIR workflow maturity model, highlighting the need for continued collaboration in addressing the complex challenges posed by the convergence of AI, HPC, and multi-facility research environments.

In this paper, we introduce new classes of infinite and combinatorially periodic tensegrities, derived from algebraic multidimensional continued fractions in the sense of F. Klein. We describe the stress coefficients on edges through integer invariants of these continued fractions, as initiated by V.I. Arnold, thereby creating a novel connection between geometric rigidity theory and the geometry of continued fractions. Remarkably, the new classes of tensegrities possess rational self-stress coefficients. To establish the self-stressability of the frameworks, we present a projective version of the classical Maxwell-Cremona lifting principle, a result of independent interest.

Advances in image compression, storage, and display technologies have made high-quality images and videos widely accessible. At this level of quality, distinguishing between compressed and original content becomes difficult, highlighting the need for assessment methodologies that are sensitive to even the smallest visual quality differences. Conventional subjective visual quality assessments often use absolute category rating scales, ranging from ``excellent'' to ``bad''. While suitable for evaluating more pronounced distortions, these scales are inadequate for detecting subtle visual differences. The JPEG standardization project AIC is currently developing a subjective image quality assessment methodology for high-fidelity images. This paper presents the proposed assessment methods, a dataset of high-quality compressed images, and their corresponding crowdsourced visual quality ratings. It also outlines a data analysis approach that reconstructs quality scale values in just noticeable difference (JND) units. The assessment method uses boosting techniques on visual stimuli to help observers detect compression artifacts more clearly. This is followed by a rescaling process that adjusts the boosted quality values back to the original perceptual scale. This reconstruction yields a fine-grained, high-precision quality scale in JND units, providing more informative results for practical applications. The dataset and code to reproduce the results will be available at https://github.com/jpeg-aic/dataset-BTC-PTC-24., Comment: Michela Testolina, Mohsen Jenadeleh contributed equally to this work, submitted to the Data Compression Conference (DCC) 2025

Multi-channel surface Electromyography (sEMG), also referred to as high-density sEMG (HD-sEMG), plays a crucial role in improving gesture recognition performance for myoelectric control. Pattern recognition models developed based on HD-sEMG, however, are vulnerable to changing recording conditions (e.g., signal variability due to electrode shift). This has resulted in significant degradation in performance across subjects, and sessions. In this context, the paper proposes the Masked Autoencoder with Swin Transformer (MAST) framework, where training is performed on a masked subset of HDsEMG channels. A combination of four masking strategies, i.e., random block masking; temporal masking; sensor-wise random masking, and; multi-scale masking, is used to learn latent representations and increase robustness against electrode shift. The masked data is then passed through MAST's three-path encoder-decoder structure, leveraging a multi-path Swin-Unet architecture that simultaneously captures time-domain, frequency-domain, and magnitude-based features of the underlying HD-sEMG signal. These augmented inputs are then used in a self-supervised pre-training fashion to improve the model's generalization capabilities. Experimental results demonstrate the superior performance of the proposed MAST framework in comparison to its counterparts.

In recent years, understanding thermodynamics in the quantum regime has garnered significant attention, driven by advances in nanoscale physics and experimental techniques. In parallel, growing evidence supports the importance of quantum effects in various biological processes, making them increasingly relevant to quantum thermodynamics. In this study, we apply resource theory formulations of thermodynamics to investigate the role of quantum properties in ion transport across cell membranes. Within this framework, quantum properties are treated as resources under generalized thermodynamic constraints in the quantum regime. Specifically, our findings reveal that non-Markovianity, which reflects memory effects in ion transport dynamics, serves as a key quantum resource that enhances the yield and efficiency of the ion transport process. In contrast, quantum coherence, manifested as the superposition of energy states in ion-transport proteins, reduces these metrics but plays a crucial role in distinguishing between ion channels and ion pumps: two distinct types of ion-transport proteins in cell membranes. Finally, we demonstrate that introducing an additional coherent system allows coherence to facilitate the transformation of an ion pump into an ion channel., Comment: 9 pages, 3 figures

We make a further step in the unisolvence open problem for unsymmetric Kansa collocation, proving nonsingularity of Kansa matrices with polyharmonic splines and random fictitious centers, for second-order elliptic equations with mixed boundary conditions. We also show some numerical tests, where the fictitious centers are local random perturbations of predetermined collocation points.

Case law is instrumental in shaping our understanding of human rights, including the right to adequate housing. The HUDOC database provides access to the textual content of case law from the European Court of Human Rights (ECtHR), along with some metadata. While this metadata includes valuable information, such as the application number and the articles addressed in a case, it often lacks detailed substantive insights, such as the specific issues a case covers. This underscores the need for detailed analysis to extract such information. However, given the size of the database - containing over 40,000 cases - an automated solution is essential. In this study, we focus on the right to adequate housing and aim to build models to detect cases related to housing and eviction issues. Our experiments show that the resulting models not only provide performance comparable to more sophisticated approaches but are also interpretable, offering explanations for their decisions by highlighting the most influential words. The application of these models led to the identification of new cases that were initially overlooked during data collection. This suggests that NLP approaches can be effectively applied to categorise case law based on the specific issues they address.

Detecting credit card fraud (CCF) holds significant importance due to its role in safeguarding consumers from unauthorized transactions that have the potential to result in financial detriment and negative impacts on their credit rating. It aids financial institutions in upholding the reliability of their payment mechanisms and circumventing the expensive procedure of compensating for deceitful transactions. The utilization of Artificial Intelligence methodologies demonstrated remarkable efficacy in the identification of credit card fraud instances. Within this study, we present a unique attention-based ensemble model. This model is enhanced by adding an attention layer for integration of first layer classifiers' predictions and a selection layer for choosing the best integrated value. The attention layer is implemented with two aggregation operators: dependent ordered weighted averaging (DOWA) and induced ordered weighted averaging (IOWA). The performance of the IOWA operator is very close to the learning algorithm in neural networks which is based on the gradient descent optimization method, and performing the DOWA operator is based on weakening the classifiers that make outlier predictions compared to other learners. Both operators have a sufficient level of complexity for the recognition of complex patterns. Accuracy and diversity are the two criteria we use for selecting the classifiers whose predictions are to be integrated by the two aggregation operators. Using a bootstrap forest, we identify the 13 most significant features of the dataset that contribute the most to CCF detection and use them to feed the proposed model. Exhibiting its efficacy, the ensemble model attains an accuracy of 99.95% with an area under the curve (AUC) of 1.

Autonomous Underwater Vehicles (AUVs) need to operate for days without human intervention and thus must be able to do efficient and reliable task planning. Unfortunately, efficient task planning requires deliberately abstract domain models (for scalability reasons), which in practice leads to plans that might be unreliable or under performing in practice. An optimal abstract plan may turn out suboptimal or unreliable during physical execution. To overcome this, we introduce a method that first generates a selection of diverse high-level plans and then assesses them in a low-level simulation to select the optimal and most reliable candidate. We evaluate the method using a realistic underwater robot simulation, estimating the risk metrics for different scenarios, demonstrating feasibility and effectiveness of the approach., Comment: 6 pages, 6 figures, IEEE International Conference on Intelligent Robots and Systems 2024

With the remarkable capability to reach the public instantly, social media has become integral in sharing scholarly articles to measure public response. Since spamming by bots on social media can steer the conversation and present a false public interest in given research, affecting policies impacting the public's lives in the real world, this topic warrants critical study and attention. We used the Altmetric dataset in combination with data collected through the Twitter Application Programming Interface (API) and the Botometer API. We combined the data into an extensive dataset with academic articles, several features from the article and a label indicating whether the article had excessive bot activity on Twitter or not. We analyzed the data to see the possibility of bot activity based on different characteristics of the article. We also trained machine-learning models using this dataset to identify possible bot activity in any given article. Our machine-learning models were capable of identifying possible bot activity in any academic article with an accuracy of 0.70. We also found that articles related to "Health and Human Science" are more prone to bot activity compared to other research areas. Without arguing the maliciousness of the bot activity, our work presents a tool to identify the presence of bot activity in the dissemination of an academic article and creates a baseline for future research in this direction., Comment: 38 pages, 10 figures. Aslib Journal of Information Management, Vol. ahead-of-print No. ahead-of-print

One of the most important challenges in the financial and cryptocurrency field is accurately predicting cryptocurrency price trends. Leveraging artificial intelligence (AI) is beneficial in addressing this challenge. Cryptocurrency markets, marked by substantial growth and volatility, attract investors and scholars keen on deciphering and forecasting cryptocurrency price movements. The vast and diverse array of data available for such predictions increases the complexity of the task. In our study, we introduce a novel approach termed hard and soft information fusion (HSIF) to enhance the accuracy of cryptocurrency price movement forecasts. The hard information component of our approach encompasses historical price records alongside technical indicators. Complementing this, the soft data component extracts from X (formerly Twitter), encompassing news headlines and tweets about the cryptocurrency. To use this data, we use the Bidirectional Encoder Representations from Transformers (BERT)-based sentiment analysis method, financial BERT (FinBERT), which performs best. Finally, our model feeds on the information set including processed hard and soft data. We employ the bidirectional long short-term memory (BiLSTM) model because processing information in both forward and backward directions can capture long-term dependencies in sequential information. Our empirical findings emphasize the superiority of the HSIF approach over models dependent on single-source data by testing on Bitcoin-related data. By fusing hard and soft information on Bitcoin dataset, our model has about 96.8\% accuracy in predicting price movement. Incorporating information enables our model to grasp the influence of social sentiment on price fluctuations, thereby supplementing the technical analysis-based predictions derived from hard information.

This study explores the interaction between non-extensive entropic FLRW cosmology and the power-law inflationary model, with a focus on the overlap between the scalar spectral index `$n_s$' and the tensor-to-scalar ratio `$r$'. Based on a conjecture that non-extensive entropy alters the energy-momentum content of the cosmic fluid, the analysis examines how these overlaps shift with different model parameters and compares the findings to those from Bekenstein-Hawking (BH) entropic cosmology. The study highlights the impact of Tsallis, R\'{e}nyi, and Sharma-Mittal entropies, uncovering a significant correlation between `$n_s$' and `$r$' that suggests a deeper connection in power-law inflationary dynamics. The results demonstrate that non-extensive entropies not only enable viable inflation with a graceful exit but also address limitations inherent in the standard BH entropic framework, emphasizing the importance of precise parameter estimation. Specifically, Tsallis entropy allows for power-law inflation with $n = 1$ to $n = 2$ in alignment with Planck 2018 data. Moreover, the $\alpha$ parameter in R\'{e}nyi and Sharma-Mittal entropy models must be extremely small ($\alpha \leq 10^{-8}$ in Planck mass units) to achieve successful power-law inflation with an e-folding number around 55-65, suggesting a unified thermodynamic perspective in cosmological studies., Comment: 21 pages, 5 figures

Recently, a study on the $J/\psi\eta$ mass spectrum from $B^+\rightarrow J/\psi\eta K^+$ decays was reported by the LHCb detector. The results of this study are reported as a ratio of branching fractions as $F_{X}\equiv\frac{\mathcal{B}r(B^+\rightarrow XK^+)\times\mathcal{B}r(X\rightarrow J/\psi\eta)}{\mathcal{B}r(B^+\rightarrow \psi(2S) K^+)\times\mathcal{B}r(\psi(2S)\rightarrow J/\psi\eta)}$ for $X=\psi_2(3823),\psi(4040)$, which are $(5.95^{+3.38}_{-2.55})\times10^{-2}$ and $(40.60\pm11.20)\times10^{-2}$, respectively. Also, the products related to $B_{X}\equiv\mathcal{B}r(B^+\rightarrow XK^+)\times\mathcal{B}r(X\rightarrow J/\psi\eta)$ branching fractions are $B_{\psi_2(3823)}=(1.25^{+0.71}_{-0.53}\pm0.04)\times10^{-6}$ and $B_{\psi(4040)}=(8.53\pm2.35\pm0.30)\times10^{-6}$. For the first time, we calculated this branching fraction using factorization. According to our calculations, $F_X$ to be $F_{\psi_{2}(3823)}=(6.55\pm1.88)\times10^{-2}$ and $F_{\psi(4040)}=(14.33\pm4.15)\times10^{-2}$ at $\mu=m_b/2$. We have estimated $B_{\psi_{2}(3823)}=(0.26\pm0.05)\times10^{-6}$ at $\mu=m_b/2$ and $B_{\psi(4040)}=(2.88\pm0.64)\times10^{-6}$ at $\mu=2m_b$.

While deep learning has reduced the prevalence of manual feature extraction, transformation of data via feature engineering remains essential for improving model performance, particularly for underwater acoustic signals. The methods by which audio signals are converted into time-frequency representations and the subsequent handling of these spectrograms can significantly impact performance. This work demonstrates the performance impact of using different combinations of time-frequency features in a histogram layer time delay neural network. An optimal set of features is identified with results indicating that specific feature combinations outperform single data features., Comment: 5 pages, 14 figures. This work has been submitted to the IEEE for possible publication

Transfer learning is commonly employed to leverage large, pre-trained models and perform fine-tuning for downstream tasks. The most prevalent pre-trained models are initially trained using ImageNet. However, their ability to generalize can vary across different data modalities. This study compares pre-trained Audio Neural Networks (PANNs) and ImageNet pre-trained models within the context of underwater acoustic target recognition (UATR). It was observed that the ImageNet pre-trained models slightly out-perform pre-trained audio models in passive sonar classification. We also analyzed the impact of audio sampling rates for model pre-training and fine-tuning. This study contributes to transfer learning applications of UATR, illustrating the potential of pre-trained models to address limitations caused by scarce, labeled data in the UATR domain., Comment: 5 pages, 6 figures, This work has been submitted to the IEEE for possible publication

Few-shot Semantic Segmentation addresses the challenge of segmenting objects in query images with only a handful of annotated examples. However, many previous state-of-the-art methods either have to discard intricate local semantic features or suffer from high computational complexity. To address these challenges, we propose a new Few-shot Semantic Segmentation framework based on the transformer architecture. Our approach introduces the spatial transformer decoder and the contextual mask generation module to improve the relational understanding between support and query images. Moreover, we introduce a multi-scale decoder to refine the segmentation mask by incorporating features from different resolutions in a hierarchical manner. Additionally, our approach integrates global features from intermediate encoder stages to improve contextual understanding, while maintaining a lightweight structure to reduce complexity. This balance between performance and efficiency enables our method to achieve state-of-the-art results on benchmark datasets such as $PASCAL-5^i$ and $COCO-20^i$ in both 1-shot and 5-shot settings. Notably, our model with only 1.5 million parameters demonstrates competitive performance while overcoming limitations of existing methodologies. https://github.com/amirrezafateh/MSDNet

Autoregressive models excel in modeling sequential dependencies by enforcing causal constraints, yet they struggle to capture complex bidirectional patterns due to their unidirectional nature. In contrast, mask-based models leverage bidirectional context, enabling richer dependency modeling. However, they often assume token independence during prediction, which undermines the modeling of sequential dependencies. Additionally, the corruption of sequences through masking or absorption can introduce unnatural distortions, complicating the learning process. To address these issues, we propose Bidirectional Autoregressive Diffusion (BAD), a novel approach that unifies the strengths of autoregressive and mask-based generative models. BAD utilizes a permutation-based corruption technique that preserves the natural sequence structure while enforcing causal dependencies through randomized ordering, enabling the effective capture of both sequential and bidirectional relationships. Comprehensive experiments show that BAD outperforms autoregressive and mask-based models in text-to-motion generation, suggesting a novel pre-training strategy for sequence modeling. The codebase for BAD is available on https://github.com/RohollahHS/BAD.

We present an overview of ongoing research endeavors focused on in-band full-duplex (IBFD) massive multiple-input multiple-output (MIMO) systems and their applications. In response to the unprecedented demands for mobile traffic in concurrent and upcoming wireless networks, a paradigm shift from conventional cellular networks to distributed communication systems becomes imperative. Cell-free massive MIMO (CF-mMIMO) emerges as a practical and scalable implementation of distributed/network MIMO systems, serving as a crucial physical layer technology for the advancement of next-generation wireless networks. This architecture inherits benefits from co-located massive MIMO and distributed systems and provides the flexibility for integration with the IBFD technology. We delineate the evolutionary trajectory of cellular networks, transitioning from conventional half-duplex multi-user MIMO networks to IBFD CF-mMIMO. The discussion extends further to the emerging paradigm of network-assisted IBFD CF-mMIMO (NAFD CF-mMIMO), serving as an energy-efficient prototype for asymmetric uplink and downlink communication services. This novel approach finds applications in dual-functionality scenarios, including simultaneous wireless power and information transmission, wireless surveillance, and integrated sensing and communications. We highlight various current use case applications, discuss open challenges, and outline future research directions aimed at fully realizing the potential of NAFD CF-mMIMO systems to meet the evolving demands of future wireless networks., Comment: Accepted in IEEE Transactions on Communications

Early diagnosis and treatment of polyps during colonoscopy are essential for reducing the incidence and mortality of Colorectal Cancer (CRC). However, the variability in polyp characteristics and the presence of artifacts in colonoscopy images and videos pose significant challenges for accurate and efficient polyp detection and segmentation. This paper presents a novel approach to polyp segmentation by integrating the Segment Anything Model (SAM 2) with the YOLOv8 model. Our method leverages YOLOv8's bounding box predictions to autonomously generate input prompts for SAM 2, thereby reducing the need for manual annotations. We conducted exhaustive tests on five benchmark colonoscopy image datasets and two colonoscopy video datasets, demonstrating that our method exceeds state-of-the-art models in both image and video segmentation tasks. Notably, our approach achieves high segmentation accuracy using only bounding box annotations, significantly reducing annotation time and effort. This advancement holds promise for enhancing the efficiency and scalability of polyp detection in clinical settings https://github.com/sajjad-sh33/YOLO_SAM2.

Recently pre-trained Foundation Models (FMs) have been combined with Federated Learning (FL) to improve training of downstream tasks while preserving privacy. However, deploying FMs over edge networks with resource-constrained Internet of Things (IoT) devices is under-explored. This paper proposes a novel framework, namely, Federated Distilling knowledge to Prompt (FedD2P), for leveraging the robust representation abilities of a vision-language FM without deploying it locally on edge devices. This framework distills the aggregated knowledge of IoT devices to a prompt generator to efficiently adapt the frozen FM for downstream tasks. To eliminate the dependency on a public dataset, our framework leverages perclass local knowledge from IoT devices and linguistic descriptions of classes to train the prompt generator. Our experiments on diverse image classification datasets CIFAR, OxfordPets, SVHN, EuroSAT, and DTD show that FedD2P outperforms the baselines in terms of model performance.

Test time adaptation (TTA) equips deep learning models to handle unseen test data that deviates from the training distribution, even when source data is inaccessible. While traditional TTA methods often rely on entropy as a confidence metric, its effectiveness can be limited, particularly in biased scenarios. Extending existing approaches like the Pseudo Label Probability Difference (PLPD), we introduce ETAGE, a refined TTA method that integrates entropy minimization with gradient norms and PLPD, to enhance sample selection and adaptation. Our method prioritizes samples that are less likely to cause instability by combining high entropy with high gradient norms out of adaptation, thus avoiding the overfitting to noise often observed in previous methods. Extensive experiments on CIFAR-10-C and CIFAR-100-C datasets demonstrate that our approach outperforms existing TTA techniques, particularly in challenging and biased scenarios, leading to more robust and consistent model performance across diverse test scenarios. The codebase for ETAGE is available on https://github.com/afsharshamsi/ETAGE.

In the context of few-shot classification, the goal is to train a classifier using a limited number of samples while maintaining satisfactory performance. However, traditional metric-based methods exhibit certain limitations in achieving this objective. These methods typically rely on a single distance value between the query feature and support feature, thereby overlooking the contribution of shallow features. To overcome this challenge, we propose a novel approach in this paper. Our approach involves utilizing multi-output embedding network that maps samples into distinct feature spaces. The proposed method extract feature vectors at different stages, enabling the model to capture both global and abstract features. By utilizing these diverse feature spaces, our model enhances its performance. Moreover, employing a self-attention mechanism improves the refinement of features at each stage, leading to even more robust representations and improved overall performance. Furthermore, assigning learnable weights to each stage significantly improved performance and results. We conducted comprehensive evaluations on the MiniImageNet and FC100 datasets, specifically in the 5-way 1-shot and 5-way 5-shot scenarios. Additionally, we performed a cross-domain task from MiniImageNet to the CUB dataset, achieving high accuracy in the testing domain. These evaluations demonstrate the efficacy of our proposed method in comparison to state-of-the-art approaches. https://github.com/FatemehAskari/MSENet

In this paper, we find some bounds for the Sombor index of the graph G by triangle inequality, arithmetic index, geometric index, forgotten index (F(G)), arithmetic-geometric (AG) index, geometric-arithmetic (GA) index, symmetric division deg index (SDD(G)) and some central and dispersion indices. The bounds could state estimated values and error intervals of the Sombor index to show limits of accuracy. The error intervals are written as inequalities., Comment: 11 pages

Alzheimer's disease (AD) is a neurodegenerative disorder marked by memory loss and cognitive decline, making early detection vital for timely intervention. However, early diagnosis is challenging due to the heterogeneous presentation of symptoms. Resting-state fMRI (rs-fMRI) captures spontaneous brain activity and functional connectivity, which are known to be disrupted in AD and mild cognitive impairment (MCI). Traditional methods, such as Pearson's correlation, have been used to calculate association matrices, but these approaches often overlook the dynamic and non-stationary nature of brain activity. In this study, we introduce a novel method that integrates discrete wavelet transform (DWT) and graph theory to model the dynamic behavior of brain networks. By decomposing rs-fMRI signals using DWT, our approach captures the time-frequency representation of brain activity, allowing for a more nuanced analysis of the underlying network dynamics. Graph theory provides a robust mathematical framework to analyze these complex networks, while machine learning is employed to automate the discrimination of different stages of AD based on learned patterns from different frequency bands. We applied our method to a dataset of rs-fMRI images from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database, demonstrating its potential as an early diagnostic tool for AD and for monitoring disease progression. Our statistical analysis identifies specific brain regions and connections that are affected in AD and MCI, at different frequency bands, offering deeper insights into the disease's impact on brain function.

Consider a collection of data generators which could represent, e.g., humans equipped with a smart-phone or wearables. We want to train a personalized (or tailored) model for each data generator even if they provide only small local datasets. The available local datasets might fail to provide sufficient statistical power to train high-dimensional models (such as deep neural networks) effectively. One possible solution is to identify similar data generators and pool their local datasets to obtain a sufficiently large training set. This paper proposes a novel method for sequentially identifying similar (or relevant) data generators. Our method is similar in spirit to active sampling methods but does not require exchange of raw data. Indeed, our method evaluates the relevance of a data generator by evaluating the effect of a gradient step using its local dataset. This evaluation can be performed in a privacy-friendly fashion without sharing raw data. We extend this method to non-parametric models by a suitable generalization of the gradient step to update a hypothesis using the local dataset provided by a data generator.

This paper explores a discrete energy state transition model for energy harvesting (EH) in cell-free massive multiple-input multiple-output (CF-mMIMO) networks. Multiple-antenna access points (APs) provide wireless power and information to single-antenna UE equipment (UEs). The harvested energy at the UEs is used for both uplink (UL) training and data transmission. We investigate the energy transition probabilities based on the energy differential achieved in each coherence interval. A Markov chain-based stochastic process is introduced to characterize the evolving UE energy status. A detailed statistical model is developed for a non-linear EH circuit at the UEs, using the derived closed-form expressions for the mean and variance of the harvested energy. More specifically, simulation results confirm that the proposed Gamma distribution approximation can accurately capture the statistical behavior of the harvested energy. Furthermore, the energy state transitions are evaluated using the proposed Markov chain-based framework, while mathematical expressions for the self, positive and negative transition probabilities of the discrete energy states are also presented. Our numerical results depict that increasing the number of APs with a constant number of service antennas provides significant improvement in the positive energy state transition and reduces the negative transition probabilities of the overall network., Comment: This research paper has been accepted for 2024 IEEE GLOBECOM conference, 8-12 December 2024

We consider a downlink (DL) massive multiple-input multiple-output (MIMO) system, where different users have different mobility profiles. To support this system, we categorize the users into two disjoint groups according to their mobility profile and implement a hybrid orthogonal time frequency space (OTFS)/orthogonal frequency division multiplexing (OFDM) modulation scheme. Building upon this framework, two precoding designs, namely full-pilot zero-forcing (FZF) precoding and partial zero-forcing (PZF) precoding are considered. To shed light on the system performance, the spectral efficiency (SE) with a minimum-mean-square-error (MMSE)-successive interference cancellation (SIC) detector is investigated. Closed-form expressions for the SE are obtained using some tight mathematical approximations. To improve fairness among different users, we consider max-min power control for both precoding schemes based on the closed-form SE expression. However, by noting the large performance gap for different groups of users with PZF precoding, the per-user SE will be compromised when pursuing overall fairness. Therefore, we propose a weighted max-min power control scheme. By introducing a weighting coefficient, the trade-off between the per-user performance and fairness can be enhanced. Our numerical results confirm the theoretical analysis and reveal that with mobility-based grouping, the proposed hybrid OTFS/OFDM modulation significantly outperforms the conventional OFDM modulation for high-mobility users.

This study develops a framework based on reinforcement learning to dynamically manage a large portfolio of search operators within meta-heuristics. Using the idea of tabu search, the framework allows for continuous adaptation by temporarily excluding less efficient operators and updating the portfolio composition during the search. A Q-learning-based adaptive operator selection mechanism is used to select the most suitable operator from the dynamically updated portfolio at each stage. Unlike traditional approaches, the proposed framework requires no input from the experts regarding the search operators, allowing domain-specific non-experts to effectively use the framework. The performance of the proposed framework is analyzed through an application to the permutation flowshop scheduling problem. The results demonstrate the superior performance of the proposed framework against state-of-the-art algorithms in terms of optimality gap and convergence speed.

To meet the unprecedented mobile traffic demands of future wireless networks, a paradigm shift from conventional cellular networks to distributed communication systems is imperative. Cell-free massive multiple-input multiple-output (CF-mMIMO) represents a practical and scalable embodiment of distributed/network MIMO systems. It inherits not only the key benefits of co-located massive MIMO systems but also the macro-diversity gains from distributed systems. This innovative architecture has demonstrated significant potential in enhancing network performance from various perspectives, outperforming co-located mMIMO and conventional small-cell systems. Moreover, CF-mMIMO offers flexibility in integration with emerging wireless technologies such as full-duplex (FD), non-orthogonal transmission schemes, millimeter-wave (mmWave) communications, ultra-reliable low-latency communication (URLLC), unmanned aerial vehicle (UAV)-aided communication, and reconfigurable intelligent surfaces (RISs). In this paper, we provide an overview of current research efforts on CF-mMIMO systems and their promising future application scenarios. We then elaborate on new requirements for CF-mMIMO networks in the context of these technological breakthroughs. We also present several current open challenges and outline future research directions aimed at fully realizing the potential of CF mMIMO systems in meeting the evolving demands of future wireless networks., Comment: Proceedings of the IEEE, accepted

As the modern electrical grid shifts towards distributed systems, there is an increasing need for rapid decision-making tools. Artificial Intelligence (AI) and Machine Learning (ML) technologies are now pivotal in enhancing the efficiency of power dispatch operations, effectively overcoming the constraints of traditional optimization solvers with long computation times. However, this increased efficiency comes at a high environmental cost, escalating energy consumption and carbon emissions from computationally intensive AI/ML models. Despite their potential to transform power systems management, the environmental impact of these technologies often remains an overlooked aspect. This paper introduces the first comparison of energy demands across centralized, distributed, and decentralized ML-driven power dispatch models. We provide a detailed analysis of the energy and carbon footprint required for continuous operations on an IEEE 33 bus system, highlighting the critical trade-offs between operational efficiency and environmental sustainability. This study aims to guide future AI implementations in energy systems, ensuring they enhance not only efficiency but also prioritize ecological integrity.

Classification of sets of inputs (e.g., images and texts) is an active area of research within both computer vision (CV) and natural language processing (NLP). A common way to represent a set of vectors is to model them as linear subspaces. In this contribution, we present a prototype-based approach for learning on the manifold formed from such linear subspaces, the Grassmann manifold. Our proposed method learns a set of subspace prototypes capturing the representative characteristics of classes and a set of relevance factors automating the selection of the dimensionality of the subspaces. This leads to a transparent classifier model which presents the computed impact of each input vector on its decision. Through experiments on benchmark image and text datasets, we have demonstrated the efficiency of our proposed classifier, compared to the transformer-based models in terms of not only performance and explainability but also computational resource requirements.

This study investigates the reliability of code generation by Large Language Models (LLMs), focusing on identifying and analyzing defects in the generated code. Despite the advanced capabilities of LLMs in automating code generation, ensuring the accuracy and functionality of the output remains a significant challenge. By using a structured defect classification method to understand their nature and origins this study categorizes and analyzes 367 identified defects from code snippets generated by LLMs, with a significant proportion being functionality and algorithm errors. These error categories indicate key areas where LLMs frequently fail, underscoring the need for targeted improvements. To enhance the accuracy of code generation, this paper implemented five prompt engineering techniques, including Scratchpad Prompting, Program of Thoughts Prompting, Chain-of-Thought Prompting, Chain of Code Prompting, and Structured Chain-of-Thought Prompting. These techniques were applied to refine the input prompts, aiming to reduce ambiguities and improve the models' accuracy rate. The research findings suggest that precise and structured prompting significantly mitigates common defects, thereby increasing the reliability of LLM-generated code.

We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We establish sufficient conditions for both the realizability of these matroids and the irreducibility of their associated varieties. Additionally, we analyze the defining polynomial equations of these varieties using Grassmann-Cayley algebra and geometric liftability techniques. For several families within these matroid types, we provide a complete set of defining equations for matroid varieties, or equivalently, a finite generating set for their associated matroid ideals. This includes forest configurations, and a subfamily of nilpotent matroids, called weak nilpotent matroids, which may have arbitrary rank., Comment: Comments are welcome!

With the emergence of data marketplaces, the demand for methods to assess the value of data has increased significantly. While numerous techniques have been proposed for this purpose, none have specifically addressed graphs as the main data modality. Graphs are widely used across various fields, ranging from chemical molecules to social networks. In this study, we break down graphs into two main components: structural and featural, and we focus on evaluating data without relying on specific task-related metrics, making it applicable in practical scenarios where validation requirements may be lacking. We introduce a novel framework called blind message passing, which aligns the seller's and buyer's graphs using a shared node permutation based on graph matching. This allows us to utilize the graph Wasserstein distance to quantify the differences in the structural distribution of graph datasets, called the structural disparities. We then consider featural aspects of buyers' and sellers' graphs for data valuation and capture their statistical similarities and differences, referred to as relevance and diversity, respectively. Our approach ensures that buyers and sellers remain unaware of each other's datasets. Our experiments on real datasets demonstrate the effectiveness of our approach in capturing the relevance, diversity, and structural disparities of seller data for buyers, particularly in graph-based data valuation scenarios.