Reviewerly/exHarmony huggingface dataset:
The impact of extreme dust storms on the national photovoltaic energy supply

Authors:
raw_author_name: Leonardo Micheli
raw_affiliation_string: Dept. of Astronautical, Electrical and Energy Engineering (DIAEE), Sapienza University of Rome, Rome, Italy
raw_author_name: Florencia Almonacid
raw_affiliation_string: Advances in Photovoltaic Technology (AdPVTech), CEACTEMA, University of Jaén, Jaén, Spain
raw_author_name: João Gabriel Bessa
raw_affiliation_string: Advances in Photovoltaic Technology (AdPVTech), CEACTEMA, University of Jaén, Jaén, Spain
raw_author_name: Eduardo F. Fernández
raw_affiliation_string: Advances in Photovoltaic Technology (AdPVTech), CEACTEMA, University of Jaén, Jaén, Spain

Abstract: This study analyses the consequences of an extreme dust storm that occurred in March 2022 on the Spanish national photovoltaic (PV) energy supply. This event, indeed, substantially raised the particulate matter concentrations and the aerosol optical depths across the country, seriously affecting the surface radiation and posing a substantial threat not only to individual PV systems but also to the national electricity grid. The research, based on the analysis and the forecast of weather, environmental and electrical data, reveals that such event halved the capacity factor of the national PV fleet over a period longer than two weeks. A peak drop as high as 80% was registered, at national level, on the worst day. This underperformance also affected the market share of PV in the national electricity mix, whose monthly average value fell from the predicted 10.9% to 7.1%. Despite the expectations, however, no significant difference in soiling was found compared to the typical losses, thanks to the occurrence of heavier-than-usual rainfall events. This facilitated the recovery of the national PV capacity, which returned to the expected performance factors as soon as the sky cleared.
Deployment of interpretable machine learning in a water treatment device - feasibility exploration of performance enhancement

Authors:
raw_author_name: Bowen Li
raw_affiliation_string: College of Environmental Science and Engineering, Nankai University, Tianjin 300350, China
raw_author_name: Jianwei Jiang
raw_affiliation_string: Tianjin Sino French Jieyuan Water Company Limited, Tianjin 300121, China
raw_author_name: Linfa Guo
raw_affiliation_string: Tianjin Sino French Jieyuan Water Company Limited, Tianjin 300121, China

Abstract: Machine learning (ML) provides a promising tool for predictive control and unattended operation of water treatment processes, especially in decentralized water supply due to its high variability of water quality and scarcity of manpower. However, model deployment after ML development is a challenge that hinders their implementation. Herein, this study constructed a novel electrocoagulation membrane cathode reactor (ECMCR) as an example of decentralized water treatment due to its highly integratable. Nine ML models were established to determine the ECMCR operational current density (CD) and the Bayesian technique was employed for adaptive hyperparameters tuning of each ML model. Light gradient boosting machine (LightGBM) with turbidity, humic acid (HA), pH, temperature and time as input performed best (R2 = 0.99, MSE = 0.0004) during training, whereas the random forest (RF) was effective and robust for test data (R2 = 0.98, MSE = 0.0056) with same inputs. The mean decrease impurity (MDI) and Shapley Additive exPlanation (SHAP) method indicated that the RF model made predictions based primarily on influent turbidity, which implied a correct "understanding" of the RF model. Finally, the model was deployed to the ECMCR to explore the regulation capability, and the HA removal and turbidity removal of the ECMCR increased by 23.68 % and 23.83 %, respectively. The results demonstrate that ML technology could assist in achieving the desired performance of drinking water treatment devices without manual involvement.
Asymmetric Learning for Graph Neural Network based Link Prediction

Authors:
raw_author_name: Kai-Lang Yao
raw_affiliation_string: National Key Laboratory for Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, China
raw_author_name: Wu-Jun Li
raw_affiliation_string: National Key Laboratory for Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, China

Abstract: Link prediction is a fundamental problem in many graph-based applications, such as protein-protein interaction prediction. Recently, graph neural network (GNN) has been widely used for link prediction. However, existing GNN-based link prediction (GNN-LP) methods suffer from scalability problem during training for large-scale graphs, which has received little attention from researchers. In this paper, we first analyze the computation complexity of existing GNN-LP methods, revealing that one reason for the scalability problem stems from their symmetric learning strategy in applying the same class of GNN models to learn representation for both head nodes and tail nodes. We then propose a novel method, called a sym m etric l earning (AML), for GNN-LP. More specifically, AML applies a GNN model to learn head node representation while applying a multi-layer perceptron (MLP) model to learn tail node representation. To the best of our knowledge, AML is the first GNN-LP method to adopt an asymmetric learning strategy for node representation learning. Furthermore, we design a novel model architecture and apply a row-wise mini-batch sampling strategy to ensure promising model accuracy and training efficiency for AML. Experiments on three real large-scale datasets show that AML is 1.7×∼7.3× faster in training than baselines with a symmetric learning strategy while having almost no accuracy loss.
Semi-supervised possibilistic c-means clustering algorithm based on feature weights for imbalanced data

Authors:
raw_author_name: Haiyan Yu
raw_affiliation_string: School of Telecommunication and Information Engineering, Xi'an University of Posts and Telecommunications, Xi'an 710121, China
raw_author_name: Yuting Wu
raw_affiliation_string: School of Telecommunication and Information Engineering, Xi'an University of Posts and Telecommunications, Xi'an 710121, China
raw_author_name: Bo Lei
raw_affiliation_string: School of Telecommunication and Information Engineering, Xi'an University of Posts and Telecommunications, Xi'an 710121, China

Abstract: The possibilistic c-means clustering (PCM) algorithm improves the robustness of fuzzy c-means clustering (FCM) to noise and outliers by releasing the probabilistic constraint of memberships. The semi-supervised possibilistic c-means clustering (SSPCM) algorithm improves the clustering effect on datasets with imbalanced sizes by introducing a small amount of label information. However, the traditional semi-supervised algorithm still faces the problem of low utilization of supervision information for datasets with large differences in sample sizes. Moreover, the Euclidean distance, which treats features equally, cannot handle feature-imbalanced data. Therefore, this paper proposes a semi-supervised possibilistic c-means clustering algorithm based on feature weights (FW-SSPCM) by introducing the ideas of supervised centers. First, the algorithm introduces the supervised center into the objective function of the SSPCM to improve the utilization rate of supervision information and thus guide the center iteration of small clusters. Second, the feature weighting strategy is introduced in the objective function to adaptively assign feature weights according to the importance of different features in different clusters, thus improving the adaptability of the algorithm to feature-imbalanced datasets. In addition, to improve the robustness of the antinoise effect and retain additional image details, a new image segmentation algorithm based on FW-SSPCM and local information (LFW-SSPCM) is proposed by introducing local spatial information obtained by bilateral filtering. Finally, through clustering experiments on synthetic data, UCI datasets and on color images characteristic of multiple features, including imbalanced sizes, imbalanced features and strong noise injection, the clustering performances of the proposed FW-SSPCM and LFW-SSPCM proposed in this paper are significantly better than those of several related clustering algorithms.
Multi-granularity Knowledge Sharing in Low-resource Neural Machine Translation

Authors:
raw_author_name: Chenggang Mi
raw_affiliation_string: Foreign Language and Literature Institute, Xi'an International Studies University, China
raw_author_name: Yi Fan
raw_affiliation_string: School of Aeronautics, Northwestern Polytechnical University China

Abstract: As the rapid development of deep learning methods, neural machine translation (NMT) has attracted more and more attention in recent years. However, lack of bilingual resources decreases the performance of the low-resource NMT model seriously. To overcome this problem, several studies put their efforts on knowledge transfer from high-resource language pairs to low-resource language pairs. However, these methods usually focus on one single granularity of language and the parameter sharing among different granularities in NMT is not well studied. In this article, we propose to improve the parameter sharing in low-resource NMT by introducing multi-granularity knowledge such as word, phrase and sentence. This knowledge can be monolingual and bilingual. We build the knowledge sharing model for low-resource NMT based on a multi-task learning framework, three auxiliary tasks such as syntax parsing, cross-lingual named entity recognition, and natural language generation are selected for the low-resource NMT. Experimental results show that the proposed method consistently outperforms six strong baseline systems on several low-resource language pairs.
Improving extreme learning machine model using deep learning feature extraction and grey wolf optimizer: Application to image classification

Authors:
raw_author_name: Selma Kali Ali
raw_author_name: Dalila Boughaci

Abstract: The Extreme Learning Machine (ELM) is a highly efficient model for real-time network retraining due to its fast learning speed, unlike traditional machine learning methods. However, the performance of ELM can be negatively impacted by the random initialization of weights and biases. Moreover, poor input feature quality can further degrade performance, particularly with complex visual data. To overcome these issues, this paper proposes optimizing the input features as well as the initial weights and biases. We combine both Convolutional Neural Network (CNN) and Convolutional AutoEncoder (CAE) extracted features to optimize the quality of the input features. And we use our hybrid Grey Wolf Optimizer-Multi-Verse Optimizer (GWO-MVO) metaheuristic for initializing weights and biases by applying four fitness functions based on: the norm of the output weights, the error rate on the training set, and the error rate on the validation set. Our method is evaluated on image classification tasks using two benchmark datasets: CIFAR-10 and CIFAR-100. Since image quality may vary in real-world applications, we trained and tested our models on the dataset’s original and noisy versions. The results demonstrate that our method provides a robust and efficient alternative for image classification tasks, offering improved accuracy and reduced overfitting.
Event-Driven Fringe Projection Structured Light 3-D Reconstruction Based on Time–Frequency Analysis

Authors:
raw_author_name: Yuhui Li
raw_affiliation_string: State Key Laboratory of Optoelectronic Materials and Technology, School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China
raw_author_name: Chen Xu
raw_affiliation_string: Pazhou Laboratory (Huangpu), Huangpu, Guangzhou, China
raw_author_name: Lilin Liu
raw_affiliation_string: State Key Laboratory of Optoelectronic Materials and Technology, School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China

Abstract: Event-based structured light 3D measurement systems (eSL) overcome intrinsic limitations of frame-based structured light 3D measurement systems (fSL) such as sensor dynamic range, pixel bandwidth, and system optical power. However, most of the existing methods are based on laser scanning, and they are not only limited by the speed of acquisition, but are also very sensitive to noise events. This paper proposes an efficient event-driven fringe projection structured light 3D reconstruction system (eFPSL), aiming for high-precision 3D measurements at increased acquisition speeds. Leveraging a digital light processing fringe projection system, eFPSL enhances the acquisition speed. We further develop a time-frequency analysis algorithm capable of efficiently converting event streams into 2D fringe intensity images with high signal-to-noise ratio and excellent sinusoidality thus mitigating noise event impacts. Moreover, a novel events-count-based shadow mask extraction (eSME) strategy is proposed to eliminate shadow noise. Experimental validations demonstrate eFPSL’s ability to produce higher precision 3D reconstructions, reducing mean absolute error (MAE) by 64% compared to existing eSL methods. In addition, eFPSL impressively safeguards comprehensive 3D results while reducing system power consumption, achieving an 82% reduction in system optical power compared to traditional fSL systems. Most importantly, for high dynamic range (HDR) scenes, eFPSL achieves visual representation and measurement accuracy comparable to eight measurements of fSL systems using only a single measurement, indicating an 87.5% improvement in measurement efficiency. Hence, our experiments confirm eFPSL’s adaptability can extend to HDR scenes involving high-speed motion.
Motion segmentation using Ward’s hierarchical agglomerative clustering for crowd disaster risk mitigation

Authors:
raw_author_name: Adel Hafeezallah
raw_affiliation_string: Department of Electrical Engineering, Taibah University, Madinah, Saudi Arabia
raw_author_name: Ahlam Al-Dhamari
raw_affiliation_string: Department of Computer Engineering, Hodeidah University, Hodeidah, Yemen; Department of Electronic and Computer Engineering, Faculty of Electrical Engineering, Universiti Teknologi Malaysia, Johor 81310, Malaysia
raw_author_name: Syed Abd Rahman Abu-Bakar
raw_affiliation_string: Department of Electronic and Computer Engineering, Faculty of Electrical Engineering, Universiti Teknologi Malaysia, Johor 81310, Malaysia

Abstract: Motion segmentation has gained increasing attention due to its significance for many public surveillance applications, such as behavior understanding and density estimation. Thus ensuring crowd risk mitigation and safety. Although numerous solutions have been put out to deal with this issue, it remains challenging due to factors like scene fluctuations, cluttered backgrounds, and severe occlusions. The present paper proposes a novel framework, spatio-angular-shape Ward linkage (SAS-WL), to segment human motion based on tracked trajectories features in crowd scenes. In the proposed SAS-WL, first the motion features are captured from the crowd video through the generalized-KLT (gKLT) keypoint tracker. The tracklets are then examined to keep only the significant and long-term tracklets. Then, spatio-angular-shape motion features are obtained from those long-term tracklets. Next, Ward's linkage was utilized for performing motion pattern segmentation. In addition, we propose an improved Ward's linkage method and integrate it with the obtained features to increase the quality of the clustering results. One of the significant advantages of the SAS-WL is its capability to address various densities in different crowd scenes. Moreover, the SAS-WL achieves accurate segmentation results. We validated our findings with videos of real-world crowd scenes. We introduce a novel dataset along with its manually annotated ground truth, comprising 21 diverse crowd videos. This dataset aims to enhance the assessment of our framework's performance. Obtaining results on a diversity of challenging crowd scenarios demonstrates that this framework provides precise motion segmentation results.
Generalized GHZ entanglement states for optimal rotation detection of quantum spin systems using majorana representation

Authors:
raw_author_name: Yousef Mafi
raw_affiliation_string: University of Tehran College of Engineering, Amirabad, North Kargar St. , College of Engineering , School of Electrical and Computer Engineering, Tehran, Tehran, Tehran, 1439957131, Iran (the Islamic Republic of)
raw_author_name: Payman Kazemikhah
raw_affiliation_string: University of Tehran College of Engineering, Amirabad, North Kargar St. , College of Engineering , School of Electrical and Computer Engineering, Tehran, Tehran, 1439957131, Iran (the Islamic Republic of)
raw_author_name: Hossein Aghababa
raw_affiliation_string: Electrical and Computer Engineering, University of Tehran, North Karegar ave, Tehran, 1439957131, Iran (the Islamic Republic of)
raw_author_name: Mohammadreza Kolahdouz
raw_affiliation_string: ECE department, University of Tehran, North Karegar, Engineering Faculty, ECE department, Tehran, 1439957131, IRAN, ISLAMIC REPUBLIC OF

Abstract: Abstract A multitude of engineering and scientific applications require the estimation of an unknown axis’ rotation, known as the reference frame alignment problem. These problems can be categorized using the quantum Cramer–Rao bound. Detecting rotations is typically focused on smaller angles, as errors are more significant in this range. Therefore, selecting the optimal combination of measurement techniques based on a quantum entangled state for a particular setup is a critical step. This paper proposes a linear combination of anticoherence and coherence measures based on the generalized GHZ entanglement states. The anticoherence measures, optimizes the spin system’s average fidelity in detecting rotated states, while the overlap between states in any spin number is minimal. The optimal quantum rotosensors are characterized by the minimal average fidelity given by the overlap before and after averaging over all directions. The individual subsystems’ states have substantial overlap with GHZ states, making the generalized GHZ state the entanglement quantum spin-j state with coherence decay rate ϵ beneficial in finding the optimal rotation detection on noncoherent entanglement state.
Time-aware and task-transferable adversarial attack for perception of autonomous vehicles

Authors:
raw_author_name: Haining Ren
raw_affiliation_string: Department of Electrical Engineering and Computer Science, Purdue University, West Lafayette, IN, USA
raw_author_name: Weiheng Chai
raw_affiliation_string: Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY, USA
raw_author_name: Senem Velipasalar
raw_affiliation_string: Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY, USA
raw_author_name: Yilan Li
raw_affiliation_string: Department of Computer Science, Xi'an University of Technology, Xi'an, China

Abstract: With rapid development of self-driving vehicles, recent work in adversarial machine learning started to study adversarial examples (AEs) for perception of autonomous driving (AD). However, generating practical AEs for the perception module remains a significant challenge. Traditional adversarial attacks tend to focus on a single computer vision task, making it difficult to compromise multiple perception tasks such as object detection and segmentation simultaneously. Additionally, the limited computational resources available on-board and the necessity for online operation pose further obstacles to deploying adversarial attacks on real autonomous driving platforms. To address the aforementioned issues, we propose the Time-aware Perception Attack (TPA), which is a real-time cross-task adversarial attack for perception of autonomous driving. In particular, we propose a novel backbone based adversarial attack method to modify input images to approach Lipschitz Constant Point (LCP), which results in erroneous inferences for all the sub-models in perception module. The novel part of this work is proposing an efficient yet effective LCP approaching algorithm. Comparing to conventional LCP based attacks, which consume significant amount of computation resources and can be only applied on small DNNs, TPA generates AEs on an intermediate layer of surrogate backbone, significantly enhancing the cross-task transferability and accelerates the attack process. Evaluation results on Berkeley Driving Dataset 100k (BDD100k) show that, comparing to the state-of-the-art baselines, the proposed TPA achieves higher attack effectiveness and faster processing speed and outperforms the baselines by a large margin.
GPL-GNN: Graph prompt learning for graph neural network

Authors:
raw_author_name: Zihao Chen
raw_affiliation_string: College of Computer Science and Technology, Jilin University, Changchun, 130012, China
raw_author_name: Ying Wang
raw_affiliation_string: College of Computer Science and Technology, Jilin University, Changchun, 130012, China; Key Laboratory of Symbol Computation and Knowledge Engineering, Jilin University, Changchun, 130012, China
raw_author_name: Fuyuan Ma
raw_affiliation_string: College of Computer Science and Technology, Jilin University, Changchun, 130012, China
raw_author_name: Xin Wang
raw_affiliation_string: Key Laboratory of Symbol Computation and Knowledge Engineering, Jilin University, Changchun, 130012, China

Abstract: Despite the impressive results achieved in many areas of graph machine learning, through graph representation learning using supervised learning techniques, the limited availability of labeled training data has led to a bottleneck in terms of performance. To address this challenge, transfer learning has been proposed as an effective solution. It involves designing pre-training methods in an unsupervised manner to learn representations, which are then adapted to downstream tasks with limited labeled data. However, transfer learning can suffer from negative transfer when there is a major gap between the objectives of pre-training and the downstream tasks. To overcome these challenges, we introduce a novel framework, graph prompt learning-graph neural network (GPL-GNN), to narrow the gap between different tasks. GPL-GNN employs unsupervised methods, which require no labeled data, and incorporates unsupervised pre-trained structural representations into downstream tasks as prompt information. This information is combined with downstream data to train GNNs adapting them to the downstream tasks, and resulting in more adaptive, task-specific representations. Furthermore, the ability of GPL-GNN to learn graph representations without the constraints of pre-training and fine-tuning for model consistency increases the flexibility in choosing task-specific GNNs. In addition, the introduction of prototype networks as classification heads enables quick adaptation of GPL-GNNs to downstream tasks. Finally, we conduct extensive experiments on a benchmark dataset to demonstrate the effectiveness of GPL-GNN. The code is available in: https://github.com/chenzihaoww/GPL-GNN.