SearcharxivSearch

arXiv subjects

Ardeshir Shojaeinasab

Publications and source records attributed to Ardeshir Shojaeinasab.

5 recordsLinked to original sources

Generating Bearing Vibration Signals at User-Specified Fault Probabilities Using PR-GAN and Counterfactual Methods

In bearing vibration datasets, most samples receive predicted fault probabilities close to 0 or 1, while samples with intermediate (gray-zone) probabilities are rare. Such borderline samples are important because they reflect conditions in which maintenance decisions may require additional inspection or a conservative response and are useful for studying decision boundaries. To address this scarcity, this paper proposes and compares two approaches that generate vibration signals whose predicted fault probability matches a target probability of 0.25, 0.50, or 0.75. We use the average output of a heterogeneous ensemble classifier with different architectures and random initializations as a fixed, gradient-accessible probability oracle. The first, training-based approach, Probability-Regularized Generative Adversarial Network (PR-GAN), extends Wasserstein Generative Adversarial Network with Gradient Penalty (WGAN-GP) and edits a real signal through a residual generator while pushing the classifier output toward the target probability. The second is a training-free, per-sample Wachter-style counterfactual (CF) procedure that directly optimizes each input signal to reach the target probability while remaining close to the source signal. We evaluate both methods on the Case Western Reserve University (CWRU) and Paderborn bearing datasets using mean absolute target-probability error, time-domain total variation, and frequency-domain log power spectral density (log-PSD) differences. Across all settings, CF reaches the target with a mean absolute probability error of 0.005-0.008 and a within-tolerance success rate of 1.000 on retained samples, whereas PR-GAN's mean error is 0.046-0.059 with success rates between 0.501 and 0.680. CF therefore steers the probability more reliably and requires smaller average L1 changes, whereas PR-GAN has a lower reported runtime in most settings.

cs.LG

Mixing Solutions in Bitcoin and Ethereum Ecosystems: A Review and Tutorial

This manuscript presents an exhaustive review of blockchain-based mixing services, aiming to fill the existing gap between academic innovations and real-world implementations. Starting with an identification of the core functionalities and techniques employed by mixing services, the paper delves into detailed explanations of these operational mechanisms. It further outlines an evaluation framework tailored for a rigorous assessment, highlighting the key vulnerabilities and strengths of various solutions. In addition, the study identifies potential attack vectors that compromise these services. The paper explores the dual nature of mixing services, while they contribute to the preservation of privacy, a cornerstone of blockchain technologies, they can also facilitate illicit activities. By addressing key research questions, this study not only offers a comprehensive overview of the current state of mixing services but also sets the stage for future academic discourse in this evolving field.

cs.CR

Deep reinforcement learning for machine scheduling: Methodology, the state-of-the-art, and future directions

Machine scheduling aims to optimize job assignments to machines while adhering to manufacturing rules and job specifications. This optimization leads to reduced operational costs, improved customer demand fulfillment, and enhanced production efficiency. However, machine scheduling remains a challenging combinatorial problem due to its NP-hard nature. Deep Reinforcement Learning (DRL), a key component of artificial general intelligence, has shown promise in various domains like gaming and robotics. Researchers have explored applying DRL to machine scheduling problems since 1995. This paper offers a comprehensive review and comparison of DRL-based approaches, highlighting their methodology, applications, advantages, and limitations. It categorizes these approaches based on computational components: conventional neural networks, encoder-decoder architectures, graph neural networks, and metaheuristic algorithms. Our review concludes that DRL-based methods outperform exact solvers, heuristics, and tabular reinforcement learning algorithms in terms of computation speed and generating near-global optimal solutions. These DRL-based approaches have been successfully applied to static and dynamic scheduling across diverse machine environments and job characteristics. However, DRL-based schedulers face limitations in handling complex operational constraints, configurable multi-objective optimization, generalization, scalability, interpretability, and robustness. Addressing these challenges will be a crucial focus for future research in this field. This paper serves as a valuable resource for researchers to assess the current state of DRL-based machine scheduling and identify research gaps. It also aids experts and practitioners in selecting the appropriate DRL approach for production scheduling.

cs.LG

Synthesizing Rolling Bearing Fault Samples in New Conditions: A framework based on a modified CGAN

Bearings are one of the vital components of rotating machines that are prone to unexpected faults. Therefore, bearing fault diagnosis and condition monitoring is essential for reducing operational costs and downtime in numerous industries. In various production conditions, bearings can be operated under a range of loads and speeds, which causes different vibration patterns associated with each fault type. Normal data is ample as systems usually work in desired conditions. On the other hand, fault data is rare, and in many conditions, there is no data recorded for the fault classes. Accessing fault data is crucial for developing data-driven fault diagnosis tools that can improve both the performance and safety of operations. To this end, a novel algorithm based on Conditional Generative Adversarial Networks (CGANs) is introduced. Trained on the normal and fault data on any actual fault conditions, this algorithm generates fault data from normal data of target conditions. The proposed method is validated on a real-world bearing dataset, and fault data are generated for different conditions. Several state-of-the-art classifiers and visualization models are implemented to evaluate the quality of the synthesized data. The results demonstrate the efficacy of the proposed algorithm.

cs.LG

InsightiGen: a versatile tool to generate insight for an academic systematic literature review

A comprehensive literature review has always been an essential first step of every meaningful research. In recent years, however, the availability of a vast amount of information in both open-access and subscription-based literature in every field has made it difficult, if not impossible, to be certain about the comprehensiveness of one's survey. This subsequently can lead to reviewers' questioning of the novelties of the research directions proposed, regardless of the quality of the actual work presented. In this situation, statistics derived from the published literature data can provide valuable quantitative and visual information about research trends, knowledge gaps, and research networks and hubs in different fields. Our tool provides an automatic and rapid way of generating insight for systematic reviews in any research area.

stat.OT