Reviewerly/exHarmony huggingface dataset:
ReaDy: A ReRAM-Based Processing-in-Memory Accelerator for Dynamic Graph Convolutional Networks

Dynamic graph convolutional networks (DGCNs) have emerged as an effective approach to analyzing graph data that is constantly changing. The typical DGCNs incorporate not only graph convolutional networks (GCNs) to extract the structural information but also with recurrent neural networks (RNNs) to capture the temporal information from evolving graph data. These two alternative execution kernels of DGCNs impose unique architecture challenges for both types of kernels to be implemented efficiently. The presence of complex execution patterns of DGCNs renders existing architectures unsuitable. In this article, we present the first DGCN accelerator with an integrated architecture, named ReaDy, to accelerate DGCNs based on emerging PIM-featured ReRAM architectures. ReaDy is novel with an integrated architecture that enables running the GCN and RNN kernels of DGCNs simultaneously. Specifically, ReaDy is equipped with a redundancy-free scheduling mechanism to alleviate intrinsic dynamic irregularity for the GCN kernel, improving hardware utilization. In addition, ReaDy also includes a locality-aware dataflow strategy to exploit the inherent intervertex data locality for the RNN kernel, reducing superfluous data accesses to vertices and weight parameters. In a holistic view, ReaDy further enhances the entire system via an interkernel pipeline to reduce the off-chip accesses of intermediate results, boosting the overall efficiency of DGCNs significantly. Compared to the state-of-the-art software framework, PyGT, running on Intel Xeon E5-2680v4 CPU and NVIDIA Ampere A100 GPU, ReaDy achieves the average speedups of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$955\times $ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$27.33\times $ </tex-math></inline-formula> , and the average energy savings of 1 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$093\times $ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$80.21\times $ </tex-math></inline-formula> , respectively. In addition, ReaDy outperforms ReFlip-ERA, which is obtained by combining a state-of-the-art GCN accelerator ReFlip and RNN accelerator ERA-LSTM, by an average speedup of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$8.30\times $ </tex-math></inline-formula> and an average energy saving of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$7.29\times $ </tex-math></inline-formula> .
White Blood Cell Classification Using Texture and RGB Features of Oversampled Microscopic Images

White blood cell (WBC) type classification is a task of significant importance for diagnosis using microscopic images of WBC, which develop immunity to fight against infections and foreign substances. WBCs consist of different types, and abnormalities in a type of WBC may potentially represent a disease such as leukemia. Existing studies are limited by low accuracy and overrated performance, often caused by model overfit due to an imbalanced dataset. Additionally, many studies consider a lower number of WBC types, and the accuracy is exaggerated. This study presents a hybrid feature set of selective features and synthetic minority oversampling technique-based resampling to mitigate the influence of the above-mentioned problems. Furthermore, machine learning models are adopted for being less computationally complex, requiring less data for training, and providing robust results. Experiments are performed using both machine- and deep learning models for performance comparison using the original dataset, augmented dataset, and oversampled dataset to analyze the performances of the models. The results suggest that a hybrid feature set of both texture and RGB features from microscopic images, selected using Chi2, produces a high accuracy of 0.97 with random forest. Performance appraisal using k-fold cross-validation and comparison with existing state-of-the-art studies shows that the proposed approach outperforms existing studies regarding the obtained accuracy and computational complexity.
Toward Vulnerability Detection for Ethereum Smart Contracts Using Graph-Matching Network

With the blooming of blockchain-based smart contracts in decentralized applications, the security problem of smart contracts has become a critical issue, as vulnerable contracts have resulted in severe financial losses. Existing research works have explored vulnerability detection methods based on fuzzing, symbolic execution, formal verification, and static analysis. In this paper, we propose two static analysis approaches called ASGVulDetector and BASGVulDetector for detecting vulnerabilities in Ethereum smart contacts from source-code and bytecode perspectives, respectively. First, we design a novel intermediate representation called abstract semantic graph (ASG) to capture both syntactic and semantic features from the program. ASG is based on syntax information but enriched by code structures, such as control flow and data flow. Then, we apply two different training models, i.e., graph neural network (GNN) and graph matching network (GMN), to learn the embedding of ASG and measure the similarity of the contract pairs. In this way, vulnerable smart contracts can be identified by calculating the similarity to labeled ones. We conduct extensive experiments to evaluate the superiority of our approaches to state-of-the-art competitors. Specifically, ASGVulDetector improves the best of three source-code-only static analysis tools (i.e., SmartCheck, Slither, and DR-GCN) regarding the F1 score by 12.6% on average, while BASGVulDetector improves that of the three detection tools supporting bytecode (i.e., ContractFuzzer, Oyente, and Securify) regarding the F1 score by 25.6% on average. We also investigate the effectiveness and advantages of the GMN model for detecting vulnerabilities in smart contracts.
GR(1)-Guided Deep Reinforcement Learning for Multi-Task Motion Planning under a Stochastic Environment

Motion planning has been used in robotics research to make movement decisions under certain movement constraints. Deep Reinforcement Learning (DRL) approaches have been applied to the cases of motion planning with continuous state representations. However, current DRL approaches suffer from reward sparsity and overestimation issues. It is also challenging to train the agents to deal with complex task specifications under deep neural network approximations. This paper considers one of the fragments of Linear Temporal Logic (LTL), Generalized Reactivity of rank 1 (GR(1)), as a high-level reactive temporal logic to guide robots in learning efficient movement strategies under a stochastic environment. We first use the synthesized strategy of GR(1) to construct a potential-based reward machine, to which we save the experiences per state. We integrate GR(1) with DQN, double DQN and dueling double DQN. We also observe that the synthesized strategies of GR(1) could be in the form of directed cyclic graphs. We develop a topological-sort-based reward-shaping approach to calculate the potential values of the reward machine, based on which we use the dueling architecture on the double deep Q-network with the experiences to train the agents. Experiments on multi-task learning show that the proposed approach outperforms the state-of-art algorithms in learning rate and optimal rewards. In addition, compared with the value-iteration-based reward-shaping approaches, our topological-sort-based reward-shaping approach has a higher accumulated reward compared with the cases where the synthesized strategies are in the form of directed cyclic graphs.
What perceptron neural networks are (not) good for?

Perceptron Neural Networks (PNNs) are essential components of intelligent systems because they produce efficient solutions to problems of overwhelming complexity for conventional computing methods. Many papers show that PNNs can approximate a wide variety of functions, but comparatively, very few discuss their limitations and the scope of this paper. To this aim, we define two classes of Boolean functions – sensitive and robust –, and prove that an exponentially large set of sensitive functions are exponentially difficult to compute by multi-layer PNNs (hence incomputable by single-layer PNNs). A comparatively large set of functions in the second one, but not all, are computable by single-layer PNNs. Finally, we used polynomial threshold PNNs to compute all Boolean functions with quantum annealing and present in detail a QUBO computation on the D-Wave Advantage. These results confirm that the successes of PNNs, or lack of them, are in part determined by properties of the learned data sets and suggest that sensitive functions may not be (efficiently) computed by PNNs.
A lightweight convolutional neural network as an alternative to DIC to measure in-plane displacement fields

Convolutional Neural Networks (CNNs) are now commonly used in the computer vision community, in particular for optical flow estimation. Some attempts to use such tools to measure displacement and strain fields from pairs of reference/deformed speckle images (like Digital Image Correlation) have been recently reported in the literature. The aim of this work is twofold. The first one is to customize a state-of-the-art CNN dedicated to optical flow estimation to reach better performance when processing speckle images. This is mainly obtained by removing the deepest levels. The second one is to further simplify the CNN by reducing as much as possible the number of filters in the remaining levels while keeping equivalent metrological performance to the original version, in order to accelerate image processing on a power-efficient compact Graphics Processing Unit (GPU). Synthetic images deformed through a suitable displacement field are used to assess the metrological performance of the different versions of the CNN tested in this study. We focus the sub-pixel part of the displacement is considered for this first attempt, this part being much more challenging to determine than integer displacements obtained at the pixel scale. The latter can be found by cross-correlation or with a rough version of DIC. Real images are tested with the simplest version of the CNN and obtained results are compared with those provided by classic subset-based Digital Image Correlation. The two main conclusions are i- that the customization procedure improves the metrological performance of the original version, and that ii- the metrological performance of the ultimate simplified version of the CNN is globally equivalent to the one of the initial version despite the drastic simplification obtained at the end of the procedure. This performance lies between that of DIC used with first- and second-order subset shape functions.
Decouple and Resolve: Transformer-Based Models for Online Anomaly Detection From Weakly Labeled Videos

As one of the vital topics in intelligent surveillance, weakly supervised online video anomaly detection (WS-OVAD) aims to identify the ongoing anomalous events moment-to-moment in streaming videos, trained with only video-level annotations. Previous studies tended to utilize a unified single-stage framework, which struggled to simultaneously address the issues of online constraints and weakly supervised settings. To solve this dilemma, in this paper, we propose a two-stage-based framework, namely “decouple and resolve” (DAR), which consists of two modules, i.e., temporal proposal producer (TPP) and online anomaly localizer (OAL). With the supervision of video-level binary labels, the TPP module targets fully exploiting hierarchical temporal relations among snippets for generating precise snippet-level pseudo-labels. Then, given fine-grained supervisory signals produced by TPP, the Transformer-based OAL module is trained to aggregate both the useful cues retrieved from historical observations and anticipated future semantics, for making predictions at the current time step. Both the TPP and OAL modules are jointly trained to share the beneficial knowledge in a multi-task learning paradigm. Extensive experimental results on three public data sets validate the superior performance of the proposed DAR framework over the competing methods.
Effects of cavity birefringence in polarisation-encoded quantum networks

Abstract The generation of entanglement between distant atoms via single photons is the basis for networked quantum computing, a promising route to large-scale trapped-ion and trapped-atom processors. Locating the emitter within an optical cavity provides an efficient matter-light interface, but mirror-induced birefringence within the cavity introduces time-dependence to the polarisation of the photons produced. We show that such ‘polarisation oscillation’ effects can lead to severe loss of fidelity in the context of two-photon, polarisation encoded measurement-based remote entanglement schemes. It is always preferable to suppress these errors at source by minimising mirror ellipticity, but we propose two remedies for systems where this cannot be achieved. We conclude that even modest cavity birefringence can be detrimental to remote entanglement performance, to an extent that may limit the suitability of polarisation-encoded schemes for large-scale quantum networks.
Artificial-Intelligence-Assisted Activities of Daily Living Recognition for Elderly in Smart Home

Activity Recognition (AR) is a method to identify a certain activity from the set of actions. It is commonly used to recognize a set of Activities of Daily Living (ADLs), which are performed by the elderly in a smart home environment. AR can be beneficial for monitoring the elder’s health condition, where the information can be further shared with the family members, caretakers, or doctors. Due to the unpredictable behaviors of an elderly person, performance of ADLs can vary in day-to-day life. Each activity may perform differently, which can affect the sequence of the sensor’s raw data. Due to this issue, recognizing ADLs from the sensor’s raw data remains a challenge. In this paper, we proposed an Activity Recognition for the prediction of the Activities of Daily Living using Artificial Intelligence approach. Data acquisition techniques and modified Naive Bayes supervised learning algorithm are used to design the prediction model for ADL. Our experiment results establish that the proposed method can achieve high accuracy in comparison to other well-established supervised learning algorithms.
Credit Card-Not-Present Fraud Detection and Prevention Using Big Data Analytics Algorithms

Currently, fraud detection is employed in numerous domains, including banking, finance, insurance, government organizations, law enforcement, and so on. The amount of fraud attempts has recently grown significantly, making fraud detection critical when it comes to protecting your personal information or sensitive data. There are several forms of fraud issues, such as stolen credit cards, forged checks, deceptive accounting practices, card-not-present fraud (CNP), and so on. This article introduces the credit card-not-present fraud detection and prevention (CCFDP) method for dealing with CNP fraud utilizing big data analytics. In order to deal with suspicious behavior, the proposed CCFDP includes two steps: the fraud detection Process (FDP) and the fraud prevention process (FPP). The FDP examines the system to detect harmful behavior, after which the FPP assists in preventing malicious activity. Five cutting-edge methods are used in the FDP step: random undersampling (RU), t-distributed stochastic neighbor embedding (t-SNE), principal component analysis (PCA), singular value decomposition (SVD), and logistic regression learning (LRL). For conducting experiments, the FDP needs to balance the dataset. In order to overcome this issue, Random Undersampling is used. Furthermore, in order to better data presentation, FDP must lower the dimensionality characteristics. This procedure employs the t-SNE, PCA, and SVD algorithms, resulting in a speedier data training process and improved accuracy. The logistic regression learning (LRL) model is used by the FPP to evaluate the success and failure probability of CNP fraud. Python is used to implement the suggested CCFDP mechanism. We validate the efficacy of the hypothesized CCFDP mechanism based on the testing results.
DizSpec: Digitalization of Requirements Specification Documents to Automate Traceability and Impact Analysis

Requirement engineering in many IT services industries continues to be a document-centric and heavily manual activity, relying on the expertise of business analysts. Requirement specification documents contain details of product features, process flows, activities, rules, parameters, etc. Intricate knowledge of dependencies between these specification elements is necessary for carrying out the effective evolution of the product over time. Today, Business Analysts (BA) are forced to recourse to keyword-based search across multiple requirement specification documents which is a time-, effort-and intellect-intensive endeavor, and vulnerable to the errors of omission and commission. To overcome these lacunae, we propose DizSpec, an automated approach for digitalizing the requirement specification documents into a model form through automatic extraction of specification model elements and the various dependencies between them. The proposed approach creates a digital thread providing machine-processable traceability from product features to its specification elements. It also provides an easy natural language querying mechanism to generate traceability and impact analysis reports of interest. In this paper, we describe the application of this approach to two real-world products thus bringing out its efficacy as well as lessons learned from this transformation journey of the document-centric process to a model-centric and automated process. Though the findings are shared in the specific context of two industry products, we believe, researchers, practitioners, and tool vendors will find the takeaways from this approach and experience applicable in other contexts too.
Explainable Time-Series Prediction Using a Residual Network and Gradient-Based Methods

Researchers are employing deep learning (DL) in many fields, and the scope of its application is expanding. However, because understanding the rationale and validity of DL decisions is difficult, a DL model is occasionally called a black-box model. Here, we focus on a DL-based explainable time-series prediction model. We propose a model based on long short-term memory (LSTM) followed by a convolutional neural network (CNN) with a residual connection, referred to as the LSTM-resCNN. In comparison to one-dimensional CNN, bidirectional LSTM, CNN-LSTM, LSTM-CNN, and MTEX-CNN models, the proposed LSTM-resCNN performs best on the three datasets of fine dust (PM2.5), bike-sharing, and bitcoin. Additionally, we tested with Grad-CAM, Integrated Gradients, and Gradients, three gradient-based approaches for the model explainability. These gradient-based techniques combined very well with the LSTM-resCNN model. Variables and time lags that considerably influence the explainable time-series prediction can be identified and visualized using gradients and integrated gradients.
Securing a Local Training Dataset Size in Federated Learning

Federated learning (FL) is an emerging paradigm that helps to train a global machine learning (ML) model by utilizing decentralized data among clients without sharing them. Although FL is a more secure way of model training than a general ML, industries where training data are primarily personal information, such as MRI images or Electronic Health Records (EHR), should be more precautious of privacy and security issues when using FL. For example, unbalanced dataset sizes may denote some meaningful information that can lead to security vulnerabilities even if the training data of the clients are not exposed. In this paper, we present a Privacy-Preserving Federated Averaging(PP - FedAvg) protocol specialized for healthcare settings to limit user data privacy leakage in FL. We particularly protect the size of datasets as well as the aggregated local update parameters by securely computing among clients based on homomorphic encryption. This approach ensures that the server does not access the size of datasets and local update parameters while updating the global model. Our protocol has the advantage of protecting the size of datasets when datasets are not uniformly distributed among clients and when some clients drop out each iteration.
Object-Based Attention Mechanism for Color Calibration of UAV Remote Sensing Images in Precision Agriculture

Color calibration is a critical step for Unmanned Aerial Vehicles (UAV) remote sensing, especially in precision agriculture, which relies mainly on correlating color changes to specific quality attributes, e.g., plant health, disease, and pest stresses. In UAV remote sensing, the exemplar-based color transfer is popularly used for color calibration, where the automatic search for the semantic correspondences is the key to ensuring the color transfer accuracy. However, the existing attention mechanisms encounter difficulties in building the precise semantic correspondences between the reference image and the target one, in which the normalized cross correlation is often computed for feature reassembling. As a result, the color transfer accuracy is inevitably decreased by the disturbance from the semantically unrelated pixels, leading to semantic mismatch due to the absence of semantic correspondences. In this paper, we proposed an unsupervised object-based attention mechanism (OBAM) to suppress the disturbance of the semantically unrelated pixels, along with a further introduced weight-adjusted AdaIN (WAA) method to tackle the challenges caused by the absence of semantic correspondences. By embedding the proposed modules into a photorealistic style transfer method with progressive stylization, the color transfer accuracy can be improved while better preserving the structural details. We evaluated our approach on the UAV data of different crop types including rice, beans, and cotton. Extensive experiments demonstrate that our proposed method outperforms several state-of-the-art methods. As our approach requires no annotated labels, it can be easily embedded into the off-the-shelf color transfer approaches. Relevant codes and configurations will be available at http://github.com/huanghsheng/object-based-attention-mechanism.