Reviewerly/exHarmony huggingface dataset:
Cascade Object Detection and Remote Sensing Object Detection Method Based on Trainable Activation Function

Object detection is an important process in surveillance system to locate objects and it is considered as major application in computer vision. The Convolution Neural Network (CNN) based models have been developed by many researchers for object detection to achieve higher performance. However, existing models have some limitations such as overfitting problem and lower efficiency in small object detection. Object detection in remote sensing hasthe limitations of low efficiency in detecting small object and the existing methods have poor localization. Cascade Object Detection methods have been applied to increase the learning process of the detection model. In this research, the Additive Activation Function (AAF) is applied in a Faster Region based CNN (RCNN) for object detection. The proposed AAF-Faster RCNN method has the advantage of better convergence and clear bounding variance. The Fourier Series and Linear Combination of activation function are used to update the loss function. The Microsoft (MS) COCO datasets and Pascal VOC 2007/2012 are used to evaluate the performance of the AAF-Faster RCNN model. The proposed AAF-Faster RCNN is also analyzed for small object detection in the benchmark dataset. The analysis shows that the proposed AAF-Faster RCNN model has higher efficiency than state-of-art Pay Attention to Them (PAT) model in object detection. To evaluate the performance of AAF-Faster RCNN method of object detection in remote sensing, the NWPU VHR-10 remote sensing data set is used to test the proposed method. The AAF-Faster RCNN model has mean Average Precision (mAP) of 83.1% and existing PAT-SSD512 method has the 81.7%mAP in Pascal VOC 2007 dataset.
WHERE DO WE STAND IN CRYPTOCURRENCIES ECONOMIC RESEARCH? A SURVEY BASED ON HYBRID ANALYSIS

Abstract This survey develops a dual analysis, consisting, first, in a bibliometric examination and, second, in a close literature review of all the scientific production around cryptocurrencies conducted in economics so far. The aim of this paper is twofold. On the one hand, proposes a methodological hybrid approach to perform comprehensive literature reviews. On the other hand, we provide an updated state of the art in cryptocurrency economic literature. Our methodology emerges as relevant when the topic comprises a large number of papers, which make unrealistic to perform a detailed reading of all the papers. This dual perspective offers a full landscape of cryptocurrency economic research. First, by means of the distant reading provided by machine learning bibliometric techniques, we are able to identify main topics, journals, key authors, and other macro aggregates. Second, based on the information provided by the previous stage, the traditional literature review provides a closer look at methodologies, data sources, and other details of the papers. In this way, we offer a classification and analysis of the mounting research produced in a relative short time span.
Enhanced YOLO v3 Tiny Network for Real-Time Ship Detection From Visual Image

Different from ship detection from synthetic aperture radar (SDSAR) and ship detection from spaceborne optical images (SDSOI), ship detection from visual image (SDVI) has better detection accuracy and real-time performance, which can be widely used in port management, cross-border ship detection, autonomous ship, safe navigation, and other real-time applications. In this paper, we proposed a new SDVI algorithm, named enhanced YOLO v3 tiny network for real-time ship detection. The algorithm can be used in video surveillance to realize the accurate classification and positioning of six types of ships (including ore carrier, bulk cargo carrier, general cargo ship, container ship, fishing boat, and passenger ship) in real-time. Based on the original YOLO v3 tiny network, we have made the following fine tunings. 1) The preset anchors trained on Seaship annotation data have the similar “dumpy” shape as the normal ships, helping the network to achieve faster and better training; 2) Convolution layer instead of max-pooling layer and expanding the channels of prediction network improve the small target detection ability of the algorithm. 3) Due to the problem that large-scale ships are easily disturbed by the onshore building, complex waves and light on the water surface, we introduced attention module named CBAM into the backbone network, which make the model more focused on the target. The detection accuracy of the proposed algorism is obviously better than that of the original YOLO v3 tiny work. Although it is slightly inferior to the Yolo v3 network, it has faster speed than Yolo v3. However, the proposed algorithm is a better trade-off between real-time performance and detection accuracy, and is more suitable for actual scenes. Compared with the SOAT algorithm in Z. Shao et al. (2020), our algorithm has a 9.6% improvement in mAP and a faster speed.
A sentiment-aware deep learning approach for personality detection from text

Personality detection based on user-generated text content analysis has a significant impact on information science, for instance, information seeking. Existing deep learning-based approaches, however, have two major limitations. Firstly, they extract only keywords for personality detection and lack the analysis of sentiment information and psycholinguistic features. Secondly, the information about the context and polysemous words are ignored. To tackle these problems, we propose a novel multi-label personality detection model based on neural networks, which combines emotional and semantic features. Specifically, we leverage Bidirectional Encoder Representation from Transformers (BERT) to generate sentence-level embedding for text semantic extraction. In addition, a sentiment dictionary is used for text sentiment analysis in order to consider sentiment information. Finally, we input the above semantic information and emotional information into the neural network to construct an automatic personality detection model. The performance of the model has been evaluated on two public personality datasets. The experiments show that we obtain average accuracy improvements of 6.91% and 6.04% on the Myers-Briggs Type Indicator (MBTI) and Big Five datasets, respectively, compared with the state-of-the-art techniques.
Hybrid Blockchain-Based Resource Trading System for Federated Learning in Edge Computing

By training a machine learning algorithm across multiple decentralized edge nodes, federated learning (FL) ensures the privacy of the data generated by the massive Internet-of-Things (IoT) devices. To economically encourage the participation of heterogeneous edge nodes, a transparent and decentralized trading platform is needed to establish a fair market among distinct edge companies. In this article, we propose a hybrid blockchain-based resource trading system that combines the advantages of both public and consortium blockchains. We design and implement a smart contract to facilitate an automatic, autonomous, and auditable rational reverse auction mechanism among edge nodes. Moreover, we leverage the payment channel technique to enable credible, fast, low-cost, and high-frequency payment transactions between requesters and edge nodes. Simulation results show that the proposed reverse auction mechanism can achieve the properties, including budget feasibility, truthfulness, and computational efficiency.
Graph Neural Networks: Architectures, Stability, and Transferability

Graph neural networks (GNNs) are information processing architectures for signals supported on graphs. They are presented here as generalizations of convolutional neural networks (CNNs) in which individual layers contain banks of graph convolutional filters instead of banks of classical convolutional filters. Otherwise, GNNs operate as CNNs. Filters are composed of pointwise nonlinearities and stacked in layers. It is shown that GNN architectures exhibit equivariance to permutation and stability to graph deformations. These properties help explain the good performance of GNNs that can be observed empirically. It is also shown that if graphs converge to a limit object, a graphon, GNNs converge to a corresponding limit object, a graphon neural network. This convergence justifies the transferability of GNNs across networks with different numbers of nodes. Concepts are illustrated by the application of GNNs to recommendation systems, decentralized collaborative control, and wireless communication networks.
Data Quality Matters: A Case Study on Data Label Correctness for Security Bug Report Prediction

In the research of mining software repositories, we need to label a large amount of data to construct a predictive model. The correctness of the labels will affect the performance of a model substantially. However, limited studies have been performed to investigate the impact of mislabeled instances on a predictive model. To bridge the gap, in this article, we perform a case study on the security bug report (SBR) prediction. We found five publicly available datasets for SBR prediction contains many mislabeled instances, which lead to the poor performance of SBR prediction models of recent studies (e.g., the work of Peters <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> and Shu <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> ). Furthermore, it might mislead the research direction of SBR prediction. In this article, we first improve the label correctness of these five datasets by manually analyzing each bug report, and we find 749 SBRs, which are originally mislabeled as Non-SBRs (NSBRs). We then evaluate the impacts of datasets label correctness by comparing the performance of the classification models on both the noisy (i.e., before our correction) and the clean (i.e., after our correction) datasets. The results show that the cleaned datasets result in improvement in the performance of classification models. The performance of the approaches proposed by Peters <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> and Shu <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> on the clean datasets is much better than on the noisy datasets. Furthermore, with the clean datasets, the simple text classification models could significantly outperform the security keywords-matrix-based approaches applied by Peters <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> and Shu <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i>
Binary fish migration optimization for solving unit commitment

Inspired by migratory graying, Pan et al. proposed the fish migration optimization (FMO) algorithm. It integrates the models of migration and swim into the optimization process. This paper firstly proposes a binary version of FMO, called BFMO. In order to improve the search ability of BFMO, ABFMO is introduced to solve the problems of stagnation and falling into local traps. The transfer function is responsible for mapping the continuous search space to the binary space. It plays a critical factor in the binary meta-heuristics. This paper brings a new transfer function and compares it with the transfer functions used by BPSO, BGSA and BGWO. Experiments prove that the new transfer function has realized good results in the solving quality. Unit commitment (UC) is a NP-hard binary optimization problem. BFMO and ABFMO are tested with the IEEE benchmark systems consisting of various generating units with 24-h demand horizon. The effectivenesses of BFMO and ABFMO are compared with seven binary evolutionary algorithms. The simulation results and non-parametric tests verify that they achieve great performance.
Exploring Rich and Efficient Spatial Temporal Interactions for Real-Time Video Salient Object Detection

The current main stream methods formulate their video saliency mainly from two independent venues, i.e., the spatial and temporal branches. As a complementary component, the main task for the temporal branch is to intermittently focus the spatial branch on those regions with salient movements. In this way, even though the overall video saliency quality is heavily dependent on its spatial branch, however, the performance of the temporal branch still matter. Thus, the key factor to improve the overall video saliency is how to further boost the performance of these branches efficiently. In this paper, we propose a novel spatiotemporal network to achieve such improvement in a full interactive fashion. We integrate a lightweight temporal model into the spatial branch to coarsely locate those spatially salient regions which are correlated with trustworthy salient movements. Meanwhile, the spatial branch itself is able to recurrently refine the temporal model in a multi-scale manner. In this way, both the spatial and temporal branches are able to interact with each other, achieving the mutual performance improvement. Our method is easy to implement yet effective, achieving high quality video saliency detection in real-time speed with 50 FPS.
A survey of face recognition techniques under occlusion

The limited capacity to recognise faces under occlusions is a long-standing problem that presents a unique challenge for face recognition systems and even humans. The problem regarding occlusion is less covered by research when compared to other challenges such as pose variation, different expressions, etc. Nevertheless, occluded face recognition is imperative to exploit the full potential of face recognition for real-world applications. In this article, the scope to occluded face recognition is restricted and a systematic categorisation that new as well as classic methods fit into is presented. First, the authors explore the kind of the occlusion problem and the type of inherent difficulties that can arise. As a part of this review, face detection under occlusion, a preliminary step in face recognition. Second the authors analyse how the existing face recognition methods cope with the occlusion problem and classify them into three categories, which are given as: 1) occlusion robust feature extraction approaches, 2) occlusion aware face recognition approaches, and 3) occlusion recovery based face recognition approaches. Furthermore, the motivations, innovations, pros and cons, and the performance of representative approaches for comparison are analyzed. Finally, future challenges and method trends of occluded face recognition are thoroughly discussed.
Machine Learning Based PV Power Generation Forecasting in Alice Springs

The generation volatility of photovoltaics (PVs) has created several control and operation challenges for grid operators. For a secure and reliable day or hour-ahead electricity dispatch, the grid operators need the visibility of their synchronous and asynchronous generators' capacity. It helps them to manage the spinning reserve, inertia and frequency response during any contingency events. This study attempts to provide a machine learning-based PV power generation forecasting for both the short and long-term. The study has chosen Alice Springs, one of the geographically solar energy-rich areas in Australia, and considered various environmental parameters. Different machine learning algorithms, including Linear Regression, Polynomial Regression, Decision Tree Regression, Support Vector Regression, Random Forest Regression, Long Short-Term Memory, and Multilayer Perceptron Regression, are considered in the study. Various comparative performance analysis is conducted for both normal and uncertain cases and found that Random Forest Regression performed better for our dataset. The impact of data normalization on forecasting performance is also analyzed using multiple performance metrics. The study may help the grid operators to choose an appropriate PV power forecasting algorithm and plan the time-ahead generation volatility.
Graph Neural Network: A Comprehensive Review on Non-Euclidean Space

This review provides a comprehensive overview of the state-of-the-art methods of graph-based networks from a deep learning perspective. Graph networks provide a generalized form to exploit non-euclidean space data. A graph can be visualized as an aggregation of nodes and edges without having any order. Data-driven architecture tends to follow a fixed neural network trying to find the pattern in feature space. These strategies have successfully been applied to many applications for euclidean space data. Since graph data in a non-euclidean space does not follow any kind of order, these solutions can be applied to exploit the node relationships. Graph Neural Networks (GNNs) solve this problem by exploiting the relationships among graph data. Recent developments in computational hardware and optimization allow graph networks possible to learn the complex graph relationships. Graph networks are therefore being actively used to solve many problems including protein interface, classification, and learning representations of fingerprints. To encapsulate the importance of graph models, in this paper, we formulate a systematic categorization of GNN models according to their applications from theory to real-life problems and provide a direction of the future scope for the applications of graph models as well as highlight the limitations of existing graph networks.
Quantization and Deployment of Deep Neural Networks on Microcontrollers

Embedding Artificial Intelligence onto low-power devices is a challenging task that has been partly overcome with recent advances in machine learning and hardware design. Presently, deep neural networks can be deployed on embedded targets to perform different tasks such as speech recognition,object detection or Human Activity Recognition. However, there is still room for optimization of deep neural networks onto embedded devices. These optimizations mainly address power consumption,memory and real-time constraints, but also an easier deployment at the edge. Moreover, there is still a need for a better understanding of what can be achieved for different use cases. This work focuses on quantization and deployment of deep neural networks onto low-power 32-bit microcontrollers. The quantization methods, relevant in the context of an embedded execution onto a microcontroller, are first outlined. Then, a new framework for end-to-end deep neural networks training, quantization and deployment is presented. This framework, called MicroAI, is designed as an alternative to existing inference engines (TensorFlow Lite for Microcontrollers and STM32CubeAI). Our framework can indeed be easily adjusted and/or extended for specific use cases. Execution using single precision 32-bit floating-point as well as fixed-point on 8- and 16-bit integers are supported. The proposed quantization method is evaluated with three different datasets (UCI-HAR, Spoken MNIST and GTSRB). Finally, a comparison study between MicroAI and both existing embedded inference engines is provided in terms of memory and power efficiency. On-device evaluation is done using ARM Cortex-M4F-based microcontrollers (Ambiq Apollo3 and STM32L452RE).
Partially View-aligned Representation Learning with Noise-robust Contrastive Loss

In real-world applications, it is common that only a portion of data is aligned across views due to spatial, temporal, or spatiotemporal asynchronism, thus leading to the so-called Partially View-aligned Problem (PVP). To solve such a less-touched problem without the help of labels, we propose simultaneously learning representation and aligning data using a noise-robust contrastive loss. In brief, for each sample from one view, our method aims to identify its within-category counterparts from other views, and thus the cross-view correspondence could be established. As the contrastive learning needs data pairs as input, we construct positive pairs using the known correspondences and negative pairs using random sampling. To alleviate or even eliminate the influence of the false negatives caused by random sampling, we propose a noise-robust contrastive loss that could adaptively prevent the false negatives from dominating the network optimization. To the best of our knowledge, this could be the first successful attempt of enabling contrastive learning robust to noisy labels. In fact, this work might remarkably enrich the learning paradigm with noisy labels. More specifically, the traditional noisy labels are defined as incorrect annotations for the supervised tasks such as classification. In contrast, this work proposes that the view correspondence might be false, which is remarkably different from the widely-accepted definition of noisy label. Extensive experiments show the promising performance of our method comparing with 10 state-of-the-art multi-view approaches in the clustering and classification tasks. The code will be publicly released at https://pengxi.me.
A city-scale estimation of rooftop solar photovoltaic potential based on deep learning

• A framework for city-scale rooftop solar PV potential estimation was developed. • Labor cost of deep learning was significantly reduced with proposed spatial optimization sampling strategy. • Rooftop extraction model was proved to be robust in districts with different architectural styles and land use. • 311,853 GWh rooftop solar PV potential was estimated for Nanjing in 2019. • 330.36 km 2 rooftop area and 66 GW installed capacity were estimated for Nanjing. The estimation of rooftop solar photovoltaic (PV) potential is crucial for policymaking around sustainable energy plans. But it is difficult to accurately estimate the availability of rooftop area for solar radiation on a city-scale. In this study, a generic framework for estimating the rooftop solar PV potential on a city-scale using publicly available high-resolution satellite images is proposed. A deep learning-based method is developed to extract the rooftop area with image semantic segmentation automatically. A spatial optimization sampling strategy is developed to solve the labor-intensive problem when training the rooftop extraction model based on prior knowledge of urban and rural spatial layout and land use. In the case study of Nanjing, China, the labor cost on preparing the dataset for training the rooftop extraction model has been reduced by about 80% with the proposed spatial optimization sampling strategy. Meanwhile, the robustness of the rooftop extraction model in districts with different architectural styles and land use has been improved. The total rooftop area extracted was 330.36 km 2 , and the overall accuracy reached 0.92. The estimation results show that Nanjing has significant potential for rooftop-mounted PV installations, and the potential installed capacity reached 66 GW. The annual rooftop solar PV potential was approximately 311,853 GWh, with a corresponding estimated power generation of 49,897 GWh in 2019.