Reviewerly/exHarmony huggingface dataset:
Corona Detection and Power Equipment Classification Based on GoogleNet-AlexNet: An Accurate and Intelligent Defect Detection Model Based on Deep Learning for Power Distribution Lines

This paper presents a deep learning-based method for defect detection and classification of power distribution lines using video analysis. The first stage is dataset preparation in which different videos are recorded by a CoroCam 6D2 camera from distribution lines and labeled based on the defect type and the severity level of the defect. Then, a process is followed in such a way that a limited number of frames are used for processing, and power devices are detected in each frame using Faster R-CNN. The detector performance is improved by increasing the training dataset and changing the training hyper-parameters. Next, an equipment tracking technique is applied through the video frames. In the following, a method based on the classification of power equipment is presented. In this method, by corona color thresholding in all frames and applying a median filter over time, the connected components representing the corona are identified. Then, the frame containing the closest component to the component in the median image is selected. In the selected frame, the area around the component is cut and given to AlexNet or GoogleNet to determine the equipment type and the severity level of defect is determined. Also, the defective equipment phase is determined based on the insulators detected in the video. The proposed method not only performs better than the state-of-the-art but also is a practical method, and with the least dependence on environmental conditions, can automatically identify defects in distribution lines, even in videos containing several possible defective devices.
Distilhubert: Speech Representation Learning by Layer-Wise Distillation of Hidden-Unit Bert

Self-supervised speech representation learning methods like wav2vec 2.0 and Hidden-unit BERT (HuBERT) leverage unlabeled speech data for pre-training and offer good representations for numerous speech processing tasks. Despite the success of these methods, they require large memory and high pre-training costs, making them inaccessible for researchers in academia and small companies. Therefore, this paper introduces DistilHuBERT, a novel multi-task learning framework to distill hidden representations from a HuBERT model directly. This method reduces HuBERT’s size by 75% and 73% faster while retaining most performance in ten different tasks. Moreover, DistilHuBERT required little training time and data, opening the possibilities of pre-training personal and on-device SSL models for speech.
MicroNet: Improving Image Recognition with Extremely Low FLOPs

This paper aims at addressing the problem of substantial performance degradation at extremely low computational cost (e.g. 5M FLOPs on ImageNet classification). We found that two factors, sparse connectivity and dynamic activation function, are effective to improve the accuracy. The former avoids the significant reduction of network width, while the latter mitigates the detriment of reduction in network depth. Technically, we propose micro-factorized convolution, which factorizes a convolution matrix into low rank matrices, to integrate sparse connectivity into convolution. We also present a new dynamic activation function, named Dynamic Shift Max, to improve the non-linearity via maxing out multiple dynamic fusions between an input feature map and its circular channel shift. Building upon these two new operators, we arrive at a family of networks, named MicroNet, that achieves significant performance gains over the state of the art in the low FLOP regime. For instance, under the constraint of 12M FLOPs, MicroNet achieves 59.4% top-1 accuracy on ImageNet classification, outperforming MobileNetV3 by 9.6%. Source code is at https://github.com/liyunsheng13/micronet.
Training Multi-Layer Perceptron with Enhanced Brain Storm Optimization Metaheuristics

In the domain of artificial neural networks, the learning process represents one of the most challenging tasks.Since the classification accuracy highly depends on the weights and biases, it is crucial to find its optimal or suboptimal values for the problem at hand.However, to a very large search space, it is very difficult to find the proper values of connection weights and biases.Employing traditional optimization algorithms for this issue leads to slow convergence and it is prone to get stuck in the local optima.Most commonly, back-propagation is used for multi-layer-perceptron training and it can lead to vanishing gradient issue.As an alternative approach, stochastic optimization algorithms, such as nature-inspired metaheuristics are more reliable for complex optimization tax, such as finding the proper values of weights and biases for neural network training.In this work, we propose an enhanced brain storm optimization-based algorithm for training neural networks.In the simulations, ten binary classification benchmark datasets with different difficulty levels are used to evaluate the efficiency of the proposed enhanced brain storm optimization algorithm.The results show that the proposed approach is very promising in this domain and it achieved better results than other state-of-theart approaches on the majority of datasets in terms of classification accuracy and convergence speed, due to the capability of balancing the intensification and diversification and avoiding the local minima.The proposed approach obtained the best accuracy on eight out of ten observed dataset, outperforming all other algorithms by 1-2% on average.When mean accuracy is observed, the proposed algorithm dominated on nine out of ten datasets.
Combined heat and power economic dispatch using an adaptive cuckoo search with differential evolution mutation

In power system operation, the combined heat and power economic dispatch (CHPED) is an attractive and momentous optimization problem where the major objective is to find an optimal generation schedule of heat and power to meet the heat and power demands with the minimum cost, while satisfying various practical operation constraints. This paper puts forward an adaptive cuckoo search with differential evolution mutation (ACS-DEM) for solving the CHPED problem. Compared with the basic cuckoo search (CS), there are three main improvements in the proposed ACS-DEM. The first improvement is that adaptive parameters are employed and therefore no parameter adjustment is required. The second is the incorporation of a Gaussian sampling strategy into the global search phase of the algorithm to increase the exploration capability. The third is the introduction of an improved differential evolution mutation strategy into the local search phase to replace the simple biased random walk in the basic CS, thus discouraging the blindness and enhancing the exploitation capability. The outstanding performance of ACS-DEM is first confirmed through the test suite from the 2017 Conference on Evolutionary Computation and then demonstrated on several CHPED problems. The obtained dispatch schedules from ACS-DEM are feasible and in most cases exhibit a distinct improvement over the results offered by six other CS-based algorithms, one state-of-the-art differential evolution algorithm, as well as recent works in this field.
DistGNN

Full-batch training on Graph Neural Networks (GNN) to learn the structure of large graphs is a critical problem that needs to scale to hundreds of compute nodes to be feasible. It is challenging due to large memory capacity and bandwidth requirements on a single compute node and high communication volumes across multiple nodes. In this paper, we present DistGNN that optimizes the well-known Deep Graph Library (DGL) for full-batch training on CPU clusters via an efficient shared memory implementation, communication reduction using a minimum vertex-cut graph partitioning algorithm and communication avoidance using a family of delayed-update algorithms. Our results on four common GNN benchmark datasets: Reddit, OGB-Products, OGB-Papers and Proteins, show up to 3.7× speed-up using a single CPU socket and up to 97× speed-up using 128 CPU sockets, respectively, over baseline DGL implementations running on a single CPU socket.
RAMS-Trans: Recurrent Attention Multi-scale Transformer for Fine-grained Image Recognition

In fine-grained image recognition (FGIR), the localization and amplification of region attention is an important factor, which has been explored extensively convolutional neural networks (CNNs) based approaches. The recently developed vision transformer (ViT) has achieved promising results in computer vision tasks. Compared with CNNs, Image sequentialization is a brand new manner. However, ViT is limited in its receptive field size and thus lacks local attention like CNNs due to the fixed size of its patches, and is unable to generate multi-scale features to learn discriminative region attention. To facilitate the learning of discriminative region attention without box/part annotations, we use the strength of the attention weights to measure the importance of the patch tokens corresponding to the raw images. We propose the recurrent attention multi-scale transformer (RAMS-Trans), which uses the transformer's self-attention to recursively learn discriminative region attention in a multi-scale manner. Specifically, at the core of our approach lies the dynamic patch proposal module (DPPM) responsible for guiding region amplification to complete the integration of multi-scale image patches. The DPPM starts with the full-size image patches and iteratively scales up the region attention to generate new patches from global to local by the intensity of the attention weights generated at each scale as an indicator. Our approach requires only the attention weights that come with ViT itself and can be easily trained end-to-end. Extensive experiments demonstrate that RAMS-Trans performs better than exising works, in addition to efficient CNN models, achieving state-of-the-art results on three benchmark datasets.
Strategy dynamics particle swarm optimizer

This paper proposes a particle swarm optimization with strategy dynamics (SDPSO) to solve single-objective optimization problems. SDPSO consists of four PSO search strategies. Evolutionary game theory is introduced to control the population state. In evolutionary game theory, through the interaction between players, better strategies will eventually dominate among the players. By extending this idea to PSO, a selection mechanism and a mutation mechanism are proposed. By using the selection mechanism, the adoption probability of the high payoff strategies will increase. The mutation mechanism can examine the stability of the incumbent strategy to evolutionary pressures. The performance of SDPSO is compared with 14 algorithms on the CEC 2014 test suite. The results show that SDPSO has the highest rank. SDPSO is applied to solve a real-world problem. SDPSO can find the best mean results comparing with 4 algorithms. The findings show that the proposed evolutionary game theory-based framework can adaptively control the population state. This study proposes a new application of evolutionary game theory to the design of swarm intelligence and contributes to a better understanding of the usefulness of the evolutionary game theory in the optimization method. The source codes of SDPSO are available at https://github.com/zi-ang-liu/SDPSO.
Robots as restaurant employees - A double-barrelled detective story

The paper evaluates the perceptions of Turkish restaurant managers and customers towards service robots. The sample includes 26 managers and 32 customers. Data were collected through semi-structured interviews. The findings reveal that robots are suitable for dirty, dull, dangerous and repetitive tasks. Customers have mostly positive attitudes towards robots while managers – mostly negative. However, respondents agree that robots improve service quality. A mixed service delivery system based on human-robot collaboration is perceived as the most appropriate. Customers are willing to pay more for the robotic service experience. Theoretical and managerial implications are discussed as well.
Variational mode decomposition based random forest model for solar radiation forecasting: New emerging machine learning technology

Forecasting of solar radiation (Radn) can provide an insight vision for the amount of green and friendly energy sources. Owing to the non-linearity and non-stationarity challenges caused by meteorological variables in forecasting Radn, a variational mode decomposition method is integrated with simulated annealing and random forest (VMD-SA-RF) for resolving this problem. Firstly, the input parameters are separated into training and testing phases​ after generating a one-day ahead significant lags at (t – 1). Secondly, the variational mode decomposition is set to factorize multivariate meteorological data of train and test sets, independently, into their band-limited signals. Thirdly, the simulate annealing based feature selection system is engaged to select the best band-limited signals. Finally, using the pertinent band-limited signals, the daily Radn is forecasted via random forest (RF) model. The outcomes are benchmarked with other comparative models. The hybrid fusion VMD-SA-RF model is tested geographically in Australia, generates reliable performance to forecast Radn. The hybrid VMD-SA-RF system combining the pertinent meteorological features, as the model predictors have substantial implications for renewable and sustainable energy resource management.
Towards a Unified Middle Modality Learning for Visible-Infrared Person Re-Identification

Visible-infrared person re-identification (VI-ReID) aims to search identities of pedestrians across different spectra. In this task, one of the major challenges is the modality discrepancy between the visible (VIS) and infrared (IR) images. Some state-of-the-art methods try to design complex networks or generative methods to mitigate the modality discrepancy while ignoring the highly non-linear relationship between the two modalities of VIS and IR. In this paper, we propose a non-linear middle modality generator (MMG), which helps to reduce the modality discrepancy. Our MMG can effectively project VIS and IR images into a unified middle modality image (UMMI) space to generate middle-modality (M-modality) images. The generated M-modality images and the original images are fed into the backbone network to reduce the modality discrepancy.Furthermore, in order to pull together the two types of M-modality images generated from the VIS and IR images in the UMMI space, we propose a distribution consistency loss (DCL) to make the modality distribution of the generated M-modalities images as consistent as possible. Finally, we propose a middle modality network (MMN) to further enhance the discrimination and richness of features in an explicit manner. Extensive experiments have been conducted to validate the superiority of MMN for VI-ReID over some state-of-the-art methods on two challenging datasets. The gain of MMN is more than 11.1% and 8.4% in terms of Rank-1 and mAP, respectively, even compared with the latest state-of-the-art methods on the SYSU-MM01 dataset.
DeepMultiCap: Performance Capture of Multiple Characters Using Sparse Multiview Cameras

We propose DeepMultiCap, a novel method for multi-person performance capture using sparse multi-view cameras. Our method can capture time varying surface details without the need of using pre-scanned template models. To tackle with the serious occlusion challenge for close interacting scenes, we combine a recently proposed pixel-aligned implicit function with parametric model for robust reconstruction of the invisible surface areas. An effective attention-aware module is designed to obtain the fine-grained geometry details from multi-view images, where high-fidelity results can be generated. In addition to the spatial attention method, for video inputs, we further propose a novel temporal fusion method to alleviate the noise and temporal inconsistencies for moving character reconstruction. For quantitative evaluation, we contribute a high quality multi-person dataset, MultiHuman, which consists of 150 static scenes with different levels of occlusions and ground truth 3D human models. Experimental results demonstrate the state-of-the-art performance of our method and the well generalization to real multiview video data, which outperforms the prior works by a large margin.
Machine learning-based statistical analysis for early stage detection of cervical cancer

Cervical cancer (CC) is the most common type of cancer in women and remains a significant cause of mortality, particularly in less developed countries, although it can be effectively treated if detected at an early stage. This study aimed to find efficient machine-learning-based classifying models to detect early stage CC using clinical data. We obtained a Kaggle data repository CC dataset which contained four classes of attributes including biopsy, cytology, Hinselmann, and Schiller. This dataset was split into four categories based on these class attributes. Three feature transformation methods, including log, sine function, and Z-score were applied to these datasets. Several supervised machine learning algorithms were assessed for their performance in classification. A Random Tree (RT) algorithm provided the best classification accuracy for the biopsy (98.33%) and cytology (98.65%) data, whereas Random Forest (RF) and Instance-Based K-nearest neighbor (IBk) provided the best performance for Hinselmann (99.16%), and Schiller (98.58%) respectively. Among the feature transformation methods, logarithmic gave the best performance for biopsy datasets whereas sine function was superior for cytology. Both logarithmic and sine functions performed the best for the Hinselmann dataset, while Z-score was best for the Schiller dataset. Various Feature Selection Techniques (FST) methods were applied to the transformed datasets to identify and prioritize important risk factors. The outcomes of this study indicate that appropriate system design and tuning, machine learning methods and classification are able to detect CC accurately and efficiently in its early stages using clinical data.
An Update for Taxonomy Designers

Abstract Taxonomies are classification systems that help researchers conceptualize phenomena based on their dimensions and characteristics. To address the problem of ‘ad-hoc’ taxonomy building, Nickerson et al. (2013) proposed a rigorous taxonomy development method for information systems researchers. Eight years on, however, the status quo of taxonomy research shows that the application of this method lacks consistency and transparency and that further guidance on taxonomy evaluation is needed. To fill these gaps, this study (1) advances existing methodological guidance and (2) extends this guidance with regards to taxonomy evaluation. Informed by insights gained from an analysis of 164 taxonomy articles published in information systems outlets, this study presents an extended taxonomy design process together with 26 operational taxonomy design recommendations. Representing an update for taxonomy designers, it contributes to the prescriptive knowledge on taxonomy design and seeks to augment both rigorous taxonomy building and evaluation.
Federated Learning Over Wireless IoT Networks With Optimized Communication and Resources

To leverage massive distributed data and computation resources, machine learning in the network edge is considered to be a promising technique, especially for large-scale model training. Federated learning (FL), as a paradigm of collaborative learning techniques, has obtained increasing research attention with the benefits of communication efficiency and improved data privacy. Due to the lossy communication channels and limited communication resources (e.g., bandwidth and power), it is of interest to investigate fast responding and accurate FL schemes over wireless systems. Hence, we investigate the problem of jointly optimized communication efficiency and resources for FL over wireless Internet of Things (IoT) networks. To reduce complexity, we divide the overall optimization problem into two subproblems, i.e., the client scheduling problem and the resource allocation problem. To reduce the communication costs for FL in wireless IoT networks, a new client scheduling policy is proposed by reusing stale local model parameters. To maximize successful information exchange over networks, a Lagrange multiplier method is first leveraged by decoupling variables, including power variables, bandwidth variables, and transmission indicators. Then, a linear-search-based power and bandwidth allocation method is developed. Given appropriate hyperparameters, we show that the proposed communication-efficient FL (CEFL) framework converges at a strong linear rate. Through extensive experiments, it is revealed that the proposed CEFL framework substantially boosts both the communication efficiency and learning performance of both training loss and test accuracy for FL over wireless IoT networks compared to a basic FL approach with uniform resource allocation.
Optimal Wireless Streaming of Multi-Quality 360 VR Video By Exploiting Natural, Relative Smoothness-Enabled, and Transcoding-Enabled Multicast Opportunities

In this paper, we would like to investigate the optimal wireless streaming of a multi-quality tiled 360 virtual reality (VR) video from a server to multiple users. To this end, we propose to maximally exploit potential multicast opportunities by effectively utilizing characteristics of multi-quality tiled 360 VR videos and computation resources at the users' side. In particular, we consider two requirements for quality variation in one field-of-view (FoV), i.e., the absolute smoothness requirement and the relative smoothness requirement, and two video playback modes, i.e., the direct-playback mode (without user transcoding) and transcode-playback mode (with user transcoding). Besides natural multicast opportunities, we introduce two new types of multicast opportunities, namely, relative smoothness-enabled multicast opportunities, which allow a flexible tradeoff between viewing quality and communications resource consumption, and transcoding-enabled multicast opportunities, which allow a flexible tradeoff between computation and communications resource consumptions. Then, we establish a novel mathematical model that reflects the impacts of natural, relative smoothness-enabled, and transcoding-enabled multicast opportunities on the average transmission energy and transcoding energy. Based on this model, we optimize the transmission resource allocation, playback quality level selection, and transmission quality level selection to minimize the energy consumption in the four cases with different requirements for quality variation and video playback modes. By comparing the optimal values in the four cases, we prove that the energy consumption reduces when more multicast opportunities can be utilized. Finally, numerical results show substantial gains of the proposed solutions over existing schemes, and demonstrate the importance of exploiting of the three types of multicast opportunities.