Reviewerly/exHarmony huggingface dataset:
Performance comparison of TF-IDF and Word2Vec models for emotion text classification

Emotion is the human feeling when communicating with other humans or reaction to everyday events. Emotion classification is needed to recognize human emotions from text. This study compare the performance of the TF-IDF and Word2Vec models to represent features in the emotional text classification. We use the support vector machine (SVM) and Multinomial Naïve Bayes (MNB) methods for classification of emotional text on commuter line and transjakarta tweet data. The emotion classification in this study has two steps. The first step classifies data that contain emotion or no emotion. The second step classifies data that contain emotions into five types of emotions i.e. happy, angry, sad, scared, and surprised. This study used three scenarios, namely SVM with TF-IDF, SVM with Word2Vec, and MNB with TF-IDF. The SVM with TF-IDF method generate the highest accuracy compared to other methods in the first dan second steps classification, then followed by the MNB with TF-IDF, and the last is SVM with Word2Vec. Then, the evaluation using precision, recall, and F1-measure results that the SVM with TF-IDF provides the best overall method. This study shows TF-IDF modeling has better performance than Word2Vec modeling and this study improves classification performance results compared to previous studies.
Weakly-Supervised Spatio-Temporal Anomaly Detection in Surveillance Video

In this paper, we introduce a novel task, referred to as Weakly-Supervised Spatio-Temporal Anomaly Detection (WSSTAD) in surveillance video. Specifically, given an untrimmed video, WSSTAD aims to localize a spatio-temporal tube (i.e., a sequence of bounding boxes at consecutive times) that encloses the abnormal event, with only coarse video-level annotations as supervision during training. To address this challenging task, we propose a dual-branch network which takes as input the proposals with multi-granularities in both spatial-temporal domains. Each branch employs a relationship reasoning module to capture the correlation between tubes/videolets, which can provide rich contextual information and complex entity relationships for the concept learning of abnormal behaviors. Mutually-guided Progressive Refinement framework is set up to employ dual-path mutual guidance in a recurrent manner, iteratively sharing auxiliary supervision information across branches. It impels the learned concepts of each branch to serve as a guide for its counterpart, which progressively refines the corresponding branch and the whole framework. Furthermore, we contribute two datasets, i.e., ST-UCF-Crime and STRA, consisting of videos containing spatio-temporal abnormal annotations to serve as the benchmarks for WSSTAD. We conduct extensive qualitative and quantitative evaluations to demonstrate the effectiveness of the proposed approach and analyze the key factors that contribute more to handle this task.
A simple and efficient text matching model based on deep interaction

In recent years, text matching has gained increasing research focus and shown great improvements. However, due to the long-distance dependency and polysemy, existing text matching models cannot effectively capture the contextual and implicit semantic information of texts. Additionally, existing models are lack of generalization ability when applied to different scenarios. In this study, we propose a novel Deep Interactive Text Matching (DITM) model by integrating the encoder layer, the co-attention layer, and the fusion layer as an interaction module, based on a matching-aggregation framework. In particular, the interaction process is iterated multiple times to obtain the in-depth interaction information, and the relationship between the text pair is extracted through the multi-perspective pooling. We conduct extensive experiments on four text matching tasks, i.e., opinion retrieval, answer selection, paraphrase identification and natural language inference. Compared with the state-of-the-art text matching methods, the proposed model achieved the best results on most of the tasks, which proves that our model could effectively capture the interactive information between text pairs, and has a high generalization ability among different tasks. Further multi-lingual investigations show the similarities of the performance between English and Chinese, which suggest that our model could be ported to other languages. The research contributes a simple and efficient implementation of text matching in a situation where there is limited computing capacity, and sheds light on leveraging text matching models to facilitate a range of downstream tasks.
Pixelwise H-score: A novel digital image analysis-based metric to quantify membrane biomarker expression from immunohistochemistry images

Immunohistochemistry (IHC) assays play a central role in evaluating biomarker expression in tissue sections for diagnostic and research applications. Manual scoring of IHC images, which is the current standard of practice, is known to have several shortcomings in terms of reproducibility and scalability to large scale studies. Here, by using a digital image analysis-based approach, we introduce a new metric called the pixelwise H-score (pix H-score) that quantifies biomarker expression from whole-slide scanned IHC images. The pix H-score is an unsupervised algorithm that only requires the specification of intensity thresholds for the biomarker and the nuclear-counterstain channels. We present the detailed implementation of the pix H-score in two different whole-slide image analysis software packages Visiopharm and HALO. We consider three biomarkers P-cadherin, PD-L1, and 5T4, and show how the pix H-score exhibits tight concordance to multiple orthogonal measurements of biomarker abundance such as the biomarker mRNA transcript and the pathologist H-score. We also compare the pix H-score to existing automated image analysis algorithms and demonstrate that the pix H-score provides either comparable or significantly better performance over these methodologies. We also present results of an empirical resampling approach to assess the performance of the pix H-score in estimating biomarker abundance from select regions within the tumor tissue relative to the whole tumor resection. We anticipate that the new metric will be broadly applicable to quantify biomarker expression from a wide variety of IHC images. Moreover, these results underscore the benefit of digital image analysis-based approaches which offer an objective, reproducible, and highly scalable strategy to quantitatively analyze IHC images.
Multi-Scale 2D Temporal Adjacency Networks for Moment Localization With Natural Language

We address the problem of retrieving a specific moment from an untrimmed video by natural language. It is a challenging problem because a target moment may take place in the context of other temporal moments in the untrimmed video. Existing methods cannot tackle this challenge well since they do not fully consider the temporal contexts between temporal moments. In this paper, we model the temporal context between video moments by a set of predefined two-dimensional maps under different temporal scales. For each map, one dimension indicates the starting time of a moment and the other indicates the duration. These 2D temporal maps can cover diverse video moments with different lengths, while representing their adjacent contexts at different temporal scales. Based on the 2D temporal maps, we propose a Multi-Scale Temporal Adjacency Network (MS-2D-TAN), a single-shot framework for moment localization. It is capable of encoding the adjacent temporal contexts at each scale, while learning discriminative features for matching video moments with referring expressions. We evaluate the proposed MS-2D-TAN on three challenging benchmarks, i.e., Charades-STA, ActivityNet Captions, and TACoS, where our MS-2D-TAN outperforms the state of the art.
A Real-Time Vehicle Counting, Speed Estimation, and Classification System Based on Virtual Detection Zone and YOLO

In recent years, vehicle detection and classification have become essential tasks of intelligent transportation systems, and real-time, accurate vehicle detection from image and video data for traffic monitoring remains challenging. The most noteworthy challenges are real-time system operation to accurately locate and classify vehicles in traffic flows and working around total occlusions that hinder vehicle tracking. For real-time traffic monitoring, we present a traffic monitoring approach that overcomes the abovementioned challenges by employing convolutional neural networks that utilize You Only Look Once (YOLO). A real-time traffic monitoring system has been developed, and it has attracted significant attention from traffic management departments. Digitally processing and analyzing these videos in real time is crucial for extracting reliable data on traffic flow. Therefore, this study presents a real-time traffic monitoring system based on a virtual detection zone, Gaussian mixture model (GMM), and YOLO to increase the vehicle counting and classification efficiency. GMM and a virtual detection zone are used for vehicle counting, and YOLO is used to classify vehicles. Moreover, the distance and time traveled by a vehicle are used to estimate the speed of the vehicle. In this study, the Montevideo Audio and Video Dataset (MAVD), the GARM Road-Traffic Monitoring data set (GRAM-RTM), and our collection data sets are used to verify the proposed method. Experimental results indicate that the proposed method with YOLOv4 achieved the highest classification accuracy of 98.91% and 99.5% in MAVD and GRAM-RTM data sets, respectively. Moreover, the proposed method with YOLOv4 also achieves the highest classification accuracy of 99.1%, 98.6%, and 98% in daytime, night time, and rainy day, respectively. In addition, the average absolute percentage error of vehicle speed estimation with the proposed method is about 7.6%.
Medical image encryption algorithm based on a new five-dimensional three-leaf chaotic system and genetic operation

Current image encryption methods have many shortcomings for the medical image encryption with high resolution, strong correlation and large storage space, and it is difficult to obtain reliable clinically applicable medical images. Therefore, this paper proposes a medical image encryption algorithm based on a new five-dimensional three-leaf chaotic system and genetic operation. And the dynamic analysis of the phase diagram and bifurcation diagram of the five-dimensional three-leaf chaotic system selected in this paper is carried out, and NIST is used to test the randomness of its chaotic sequence. This algorithm follows the diffusion-scrambling framework, especially using the principle of DNA recombination combined with the five-dimensional three-leaf chaotic system to generate a chaotic matrix that participates in the operation. The bit-level DNA mutation operation is introduced in the diffusion, and the scrambling and diffusion effects have been further improved. Algorithm security and randomness have been enhanced. This paper evaluates the efficiency of this algorithm for medical image encryption in terms of security analysis and time performance. Security analysis is carried out from key space, information entropy, histogram, similarity between decrypted image and original image, PSNR, correlation, sensitivity, noise attack, cropping attack and so on. Perform time efficiency analysis from the perspective of time performance. The comparison between this algorithm and the experimental results obtained by some of the latest medical image encryption algorithms shows that this algorithm is superior to the existing medical image encryption algorithms to a certain extent in terms of security and time efficiency.
Encoding patterns for quantum algorithms

As quantum computers are based on the laws of quantum mechanics, they are capable of solving certain problems faster than their classical counterparts. However, quantum algorithms with a theoretical speed-up often assume that data can be loaded efficiently. In general, the runtime complexity of the loading routine depends on (i) the data encoding that defines how the data is represented by the state of the quantum computer and (ii) the data itself. In some cases, loading the data requires at least exponential time that destroys a potential speed-up. And especially for the first generation of devices that are currently available, the resources (qubits and operations) needed to encode the data are limited. In this work, we, therefore, present six patterns that describe how data is handled by quantum computers.
Applications of data augmentation in mineral prospectivity prediction based on convolutional neural networks

The supervised deep learning methods applied in mineral prospectivity mapping usually need sufficient samples for training models. However, mineralization is a rare event. Insufficient known mineral deposits cannot meet the sample requirement of supervised learning methods, resulting in lower predictive accuracies and poor generalization abilities. For the purpose of solving this issue, this paper adopted a data augmentation method to make mineral prospectivity prediction of gold deposit in the Fengxian Region, China. This data augmentation method adopted cropping operations to generate sufficient training samples without changing spatial directions of geological data. Meanwhile, this paper utilized the continuous buffer distance method to quantify faults and anticline axes, overcoming the loss of geological information caused by using the discrete buffer distance mode. To prove the effectiveness of the data augmentation method, this paper utilized three different convolutional neural networks (LeNet, AlexNet, and VggNet) to extract relationships between multisource ore-indicating factors and mineral deposits. In addition, this paper discussed effects of different parameters on predictive performances. According to series of comparisons, the LeNet model outperformed other models, achieving superior values of accuracy (91.38%), Kappa coefficient (0.8119), and AUC (0.958). Moreover, the LeNet model successfully caught 81.8% of known gold deposits within 18.6% of the study area. The delineated high potential areas offer intuitive guides for exploring more gold deposits in the Fengxian region. The proposed data augmentation method is available for mineral prospectivity modeling by supervised deep learning methods for the areas of lower exploration degrees. For mineral prospectivity modeling based on convolutional neural networks, utilizing the continuous buffer distance to transform faults and anticline axes into predictor variables of the image form is conducive to improve the predictive performance than utilizing the discrete buffer distance.
Stochastic Cognitive Dominance Leading Particle Swarm Optimization for Multimodal Problems

Optimization problems become increasingly complicated in the era of big data and Internet of Things, which significantly challenges the effectiveness and efficiency of existing optimization methods. To effectively solve this kind of problems, this paper puts forward a stochastic cognitive dominance leading particle swarm optimization algorithm (SCDLPSO). Specifically, for each particle, two personal cognitive best positions are first randomly selected from those of all particles. Then, only when the cognitive best position of the particle is dominated by at least one of the two selected ones, this particle is updated by cognitively learning from the better personal positions; otherwise, this particle is not updated and directly enters the next generation. With this stochastic cognitive dominance leading mechanism, it is expected that the learning diversity and the learning efficiency of particles in the proposed optimizer could be promoted, and thus the optimizer is expected to explore and exploit the solution space properly. At last, extensive experiments are conducted on a widely acknowledged benchmark problem set with different dimension sizes to evaluate the effectiveness of the proposed SCDLPSO. Experimental results demonstrate that the devised optimizer achieves highly competitive or even much better performance than several state-of-the-art PSO variants.
Dual Differential Grouping: A More General Decomposition Method for Large-Scale Optimization

Cooperative coevolution (CC) algorithms based on variable decomposition methods are efficient in solving large-scale optimization problems (LSOPs). However, many decomposition methods, such as the differential grouping (DG) method and its variants, are based on the theorem of function additively separable, which may not work well on problems that are not additively separable and will result in a bottleneck for CC to solve various LSOPs. This deficiency motivates us to study how the decomposition method can decompose more kinds of separable functions, such as the multiplicatively separable function, to improve the general problem-solving ability of CC on LSOPs. With this concern, this article makes the first attempt to decompose multiplicatively separable functions and proposes a novel method called dual DG (DDG) for better LSOP decomposition and optimization. The novelty and advantage of DDG are that it can be suitable for not only additively separable functions but also multiplicatively separable functions, which can considerably expand the application scope of CC. In this article, we will first define the multiplicatively separable function, and then mathematically show its relationship to the additively separable function and how they can be transformed into each other. Based on this, the DDG can use two kinds of differences to detect the separable structure of both additively and multiplicatively separable functions. In addition, the time complexity of DDG is analyzed and a DDG-based CC algorithm framework is developed for solving LSOPs. To verify the superiority of DDG, experiments and comparisons with some state-of-the-art and champion algorithms are conducted not only on 30 LSOPs based on the test suite of the IEEE CEC large-scale global optimization competition, but also on a case study of the parameter optimization for a neural network-based application.
Digitization of Accounting: The Premise of the Paradigm Shift of Role of the Professional Accountant

The current pandemic crisis has led to a paradigm shift in the economy. Expressions such as digital transformation and digitalization of business are common in the communication channels of economic entities, which want to benefit from the advantages of information technology (artificial intelligence, software robots, and blockchain) to streamline their business. The aim of this research is to highlight the impact of the digitalization of accounting on the business environment, the work style, and the role of professional accountants: the paradigm shift. The study is based on theoretical research as well as empirical research based on a questionnaire applied in economic entities, and respondents are both decision makers and professional accountants. The results obtained by the statistical analysis of the questionnaire (Chi-square, Crosstabulation, Friedman test) suggest that digitization is more than a conventional change, being equally about technology and people. The orientation towards digitalization implies, in addition to a well-organized implementation plan, a change in the mentalities of the human factor corroborated with the evolution of the organizational culture of economic entities. At the same time, we are witnessing a change in the accounting paradigm, and the role of professional accountants is evolving from “transaction logger” to analyst and consultant for entrepreneurs. Research confirms that the digitalization of accounting is proving to be not only a modern solution, imposed by technological progress, but also timely, necessary, and even mandatory given the difficulty of anticipating the economic and social context due to the pandemic crisis. This study stands out both because of the innovative character of the approached subject, the digitalization of accounting, which represents a concept in full expansion, and because of its practical utility. This is proven by the analyses performed and the conclusions drawn in the context of an economic environment that is constantly looking for solutions. All operations can be moved to a controlled and accessible digital environment that can be accessed from any location.
Vision-Language Pre-Training for Multimodal Aspect-Based Sentiment Analysis

As an important task in sentiment analysis, Multimodal Aspect-Based Sentiment Analysis (MABSA) has attracted increasing attention in recent years.However, previous approaches either (i) use separately pre-trained visual and textual models, which ignore the crossmodal alignment or (ii) use vision-language models pre-trained with general pre-training tasks, which are inadequate to identify finegrained aspects, opinions, and their alignments across modalities.To tackle these limitations, we propose a task-specific Vision-Language Pre-training framework for MABSA (VLP-MABSA), which is a unified multimodal encoder-decoder architecture for all the pretraining and downstream tasks.We further design three types of task-specific pre-training tasks from the language, vision, and multimodal modalities, respectively.Experimental results show that our approach generally outperforms the state-of-the-art approaches on three MABSA subtasks.Further analysis demonstrates the effectiveness of each pretraining task.
Fully Attentional Network for Semantic Segmentation

Recent non-local self-attention methods have proven to be effective in capturing long-range dependencies for semantic segmentation. These methods usually form a similarity map of R^(CxC) (by compressing spatial dimensions) or R^(HWxHW) (by compressing channels) to describe the feature relations along either channel or spatial dimensions, where C is the number of channels, H and W are the spatial dimensions of the input feature map. However, such practices tend to condense feature dependencies along the other dimensions, hence causing attention missing, which might lead to inferior results for small/thin categories or inconsistent segmentation inside large objects. To address this problem, we propose a new approach, namely Fully Attentional Network (FLANet), to encode both spatial and channel attentions in a single similarity map while maintaining high computational efficiency. Specifically, for each channel map, our FLANet can harvest feature responses from all other channel maps, and the associated spatial positions as well, through a novel fully attentional module. Our new method has achieved state-of-the-art performance on three challenging semantic segmentation datasets, i.e., 83.6%, 46.99%, and 88.5% on the Cityscapes test set, the ADE20K validation set, and the PASCAL VOC test set, respectively.