Reviewerly/exHarmony huggingface dataset:
Multi-scale Matching Networks for Semantic Correspondence

Deep features have been proven powerful in building accurate dense semantic correspondences in various previous works. However, the multi-scale and pyramidal hierarchy of convolutional neural networks has not been well studied to learn discriminative pixel-level features for semantic correspondence. In this paper, we propose a multi-scale matching network that is sensitive to tiny semantic differences between neighboring pixels. We follow the coarse-to-fine matching strategy and build a top-down feature and matching enhancement scheme that is coupled with the multi-scale hierarchy of deep convolutional neural networks. During feature enhancement, intra-scale enhancement fuses same-resolution feature maps from multiple layers together via local self-attention and cross-scale enhancement hallucinates higher-resolution feature maps along the top-down pathway. Besides, we learn complementary matching details at different scales thus the overall matching score is refined by features of different semantic levels gradually. Our multi-scale matching network can be trained end-to-end easily with few additional learnable parameters. Experimental results demonstrate that the proposed method achieves state-of-the-art performance on three popular benchmarks with high computational efficiency. The code has been released at https://github.com/wintersun661/MMNet.
Comparative Analysis of Network Forensic Tools and Network Forensics Processes

Network Forensics (NFs) is a branch of digital forensics which used to detect and capture potential digital crimes over computer networked environments crime. Network Forensic Tools (NFTs) and Network Forensic Processes (NFPs) have abilities to examine networks, collect all normal and abnormal traffic/data, help in network incident analysis, and assist in creating an appropriate incident detection and reaction and also create a forensic hypothesis that can be used in a court of law. Also, it assists in examining the internal incidents and exploitation of assets, attack goals, executes threat evaluation, also by evaluating network performance. According to existing literature, there exist quite a number of NFTs and NTPs that are used for identification, collection, reconstruction, and analysing the chain of incidents that happen on networks. However, they were vary and differ in their roles and functionalities. The main objective of this paper, therefore, is to assess and see the distinction that exist between Network Forensic Tools (NFTs) and Network Forensic Processes (NFPs). Precisely, this paper focuses on comparing among four famous NFTs: Xplico, OmniPeek, NetDetector, and NetIetercept. The outputs of this paper show that the Xplico tool has abilities to identify, collect, reconstruct, and analyse the chain of incidents that happen on networks than other NF tools.
Effective Model Integration Algorithm for Improving Link and Sign Prediction in Complex Networks

Link and sign prediction in complex networks bring great help to decision-making and recommender systems, such as in predicting potential relationships or relative status levels. Many previous studies focused on designing the special algorithms to perform either link prediction or sign prediction. In this work, we propose an effective model integration algorithm consisting of network embedding, network feature engineering, and an integrated classifier, which can perform the link and sign prediction in the same framework. Network embedding can accurately represent the characteristics of topological structures and cooperate with the powerful network feature engineering and integrated classifier can achieve better prediction. Experiments on several datasets show that the proposed model can achieve state-of-the-art or competitive performance for both link and sign prediction in spite of its generality. Interestingly, we find that using only very low network embedding dimension can generate high prediction performance, which can significantly reduce the computational overhead during training and prediction. This study offers a powerful methodology for multi-task prediction in complex networks.
Automated News Summarization Using Transformers

The amount of text data available online is increasing at a very fast pace; hence, text summarization has become essential. Most of the modern recommender and text classification systems require going through a huge amount of data. Manually generating precise and fluent summaries of lengthy articles is a very tiresome and time-consuming task. Hence, generating automated summaries for the data and using it to train machine learning models will make these models space and time efficient. Extractive summarization and abstractive summarization are two separate methods of generating summaries. The extractive technique identifies the relevant sentences from the original document and extracts only those from the text. Whereas in abstractive summarization techniques, the summary is generated after interpreting the original text, hence making it more complicated. In this paper, we will be presenting a comprehensive comparison of a few transformer architecture-based pretrained models for text summarization. For analysis and comparison, we have used the BBC news dataset that contains text data that can be used for summarization and human-generated summaries for evaluating and comparing the summaries generated by machine learning models.
Toward Improving Confidence in Autonomous Vehicle Software: A Study on Traffic Sign Recognition Systems

This article proposes an approach named SafeML II, which applies empirical cumulative distribution function-based statistical distance measures in a designed human-in-the loop procedure to ensure the safety of machine learning-based classifiers in autonomous vehicle software.
Generalized Oppositional Moth Flame Optimization with Crossover Strategy: An Approach for Medical Diagnosis

Abstract In the original Moth-Flame Optimization (MFO), the search behavior of the moth depends on the corresponding flame and the interaction between the moth and its corresponding flame, so it will get stuck in the local optimum easily when facing the multi-dimensional and high-dimensional optimization problems. Therefore, in this work, a generalized oppositional MFO with crossover strategy, named GCMFO, is presented to overcome the mentioned defects. In the proposed GCMFO, GOBL is employed to increase the population diversity and expand the search range in the initialization and iteration jump phase based on the jump rate; crisscross search (CC) is adopted to promote the exploitation and/or exploration ability of MFO. The proposed algorithm’s performance is estimated by organizing a series of experiments; firstly, the CEC2017 benchmark set is adopted to evaluate the performance of GCMFO in tackling high-dimensional and multimodal problems. Secondly, GCMFO is applied to handle multilevel thresholding image segmentation problems. At last, GCMFO is integrated into kernel extreme learning machine classifier to deal with three medical diagnosis cases, including the appendicitis diagnosis, overweight statuses diagnosis, and thyroid cancer diagnosis. Experimental results and discussions show that the proposed approach outperforms the original MFO and other state-of-the-art algorithms on both convergence speed and accuracy. It also indicates that the presented GCMFO has a promising potential for application.
Let’s Play<tt>Mono</tt>-<tt>Poly</tt>: BERT Can Reveal Words’ Polysemy Level and Partitionability into Senses

Pre-trained language models (LMs) encode rich information about linguistic structure but their knowledge about lexical polysemy remains unclear. We propose a novel experimental setup for analyzing this knowledge in LMs specifically trained for different languages (English, French, Spanish, and Greek) and in multilingual BERT. We perform our analysis on datasets carefully designed to reflect different sense distributions, and control for parameters that are highly correlated with polysemy such as frequency and grammatical category. We demonstrate that BERT-derived representations reflect words’ polysemy level and their partitionability into senses. Polysemy-related information is more clearly present in English BERT embeddings, but models in other languages also manage to establish relevant distinctions between words at different polysemy levels. Our results contribute to a better understanding of the knowledge encoded in contextualized representations and open up new avenues for multilingual lexical semantics research.
Three-way decision and conformal prediction: Isomorphisms, differences and theoretical properties of cautious learning approaches

The aim of this article is to study the relationship between two popular Cautious Learning approaches, namely: Three-way decision (TWD) and conformal prediction (CP). Based on the novel proposal of a technique to transform three-way decision classifiers into conformal predictors, and vice versa, we provide conditions for the equivalence between TWD and CP. These theoretical results provide error-bound guarantees for TWD, together with a formal construction to define cost-sensitive cautious classifiers based on CP. The proposed techniques are then applied and evaluated on a collection of benchmark and real-world datasets. The results of the experiments show that the proposed techniques can be used to obtain cautious learning classifiers that are competitive with, and often out-perform, state-of-the-art approaches. Further, through a qualitative medical case study we discuss the usefulness of cautious learning in the development of robust Machine Learning.
Optimization of Online Education and Teaching Evaluation System Based on GA-BP Neural Network

With the popularization and application of online education in the world, how to evaluate and analyze the classroom teaching effect through scientific methods has become one of the important teaching tasks in colleges. Based on this, this paper studies the application of the GA-BP neural network algorithm. Firstly, it gives a brief overview of the current situation of online education and GA-BP neural network algorithm. Secondly, through the investigation of the online education system in many aspects, it evaluates students' online education classroom teaching quality from five aspects, and this paper proposes a more scientific online education classroom teaching quality evaluation optimization model and finally verifies the reliability of the online education teaching evaluation model through the practice in a university. The results show that the GA-BP neural network-based evaluation optimization model can effectively evaluate the online education in the process of analyzing the quality of online education classroom teaching of most professional students.
Improving video anomaly detection performance by mining useful data from unseen video frames

Existing state-of-the-art (SOTA) video anomaly detection methods have mainly focused on the network design for obtaining their performance improvements. Different to the main research trend, this paper focuses on the data perspective, where the key idea is to mine useful ‘normal’ data from the unseen video frames. For any off-the-shelf anomaly deep model, these newly mined data could help the deep model in familiarizing more normal feature patterns. Thus, those previously miss-detected abnormal patterns and false-alarms detections would have more chances to be rectified if the target anomaly detection deep model has been finetuned on these newly mined normal data. Extensive quantitative evaluations have verified the effectiveness of the proposed approach in achieving persistent performance improvement by almost 7% AUC improvement.
Progressive domain adaptation for detecting hate speech on social media with small training set and its application to COVID-19 concerned posts

In this world of information and experience era, microblogging sites have been commonly used to express people feelings including fear, panic, hate and abuse. Monitoring and control of abuse on social media, especially during pandemics such as COVID-19, can help in keeping the public sentiment and morale positive. Developing the fear and hate detection methods based on machine learning requires labelled data. However, obtaining the labelled data in suddenly changed circumstances as a pandemic is expensive and acquiring them in a short time is impractical. Related labelled hate data from other domains or previous incidents may be available. However, the predictive accuracy of these hate detection models decreases significantly if the data distribution of the target domain, where the prediction will be applied, is different. To address this problem, we propose a novel concept of unsupervised progressive domain adaptation based on a deep-learning language model generated through multiple text datasets. We showcase the efficacy of the proposed method in hate speech and fear detection on the tweets collection during COVID-19 where the labelled information is unavailable.
Quantum-enhanced analysis of discrete stochastic processes

Abstract Discrete stochastic processes (DSP) are instrumental for modeling the dynamics of probabilistic systems and have a wide spectrum of applications in science and engineering. DSPs are usually analyzed via Monte-Carlo methods since the number of realizations increases exponentially with the number of time steps, and importance sampling is often required to reduce the variance. We propose a quantum algorithm for calculating the characteristic function of a DSP, which completely defines its probability distribution, using the number of quantum circuit elements that grows only linearly with the number of time steps. The quantum algorithm reduces the Monte-Carlo sampling to a Bernoulli trial while taking all stochastic trajectories into account. This approach guarantees the optimal variance without the need for importance sampling. The algorithm can be further furnished with the quantum amplitude estimation algorithm to provide quadratic speed-up in sampling. The Fourier approximation can be used to estimate an expectation value of any integrable function of the random variable. Applications in finance and correlated random walks are presented. Proof-of-principle experiments are performed using the IBM quantum cloud platform.
Performance analysis of clustering methods for balanced multi-robot task allocations

This paper models the Multi-Robot Task Allocation (MRTA) problem with a balance constraint to improve the utilisation (completion time) of the robots. Our balancing constraint attempts to minimise the travel distance difference among the robots as well as allocates an equal set of tasks to these robots. The clustering-based approach is employed to solve the Balanced Multi-Robot Task Allocation (BMRTA) problem for two principal reasons. That is, this approach clusters given tasks into groups using various clustering techniques for each robot and sequences the route for each robot using the travelling salesman problem (TSP) conhull algorithm. This work analyses the suitability and performance of the clustering techniques with respect to the balancing criteria using a benchmark dataset. Our findings suggest that K-means clustering is the most suitable for the solving BMRTA problem with complex topologies and it is scalable to deal with any number of tasks and robots compared with Gaussian Mixtures Models (GMM) and hierarchical clustering methods.
The role of vision and proprioception in self-motion encoding: An immersive virtual reality study

Past research on the advantages of multisensory input for remembering spatial information has mainly focused on memory for objects or surrounding environments. Less is known about the role of cue combination in memory for own body location in space. In a previous study, we investigated participants' accuracy in reproducing a rotation angle in a self-rotation task. Here, we focus on the memory aspect of the task. Participants had to rotate themselves back to a specified starting position in three different sensory conditions: a blind condition, a condition with disrupted proprioception, and a condition where both vision and proprioception were reliably available. To investigate the difference between encoding and storage phases of remembering proprioceptive information, rotation amplitude and recall delay were manipulated. The task was completed in a real testing room and in immersive virtual reality (IVR) simulations of the same environment. We found that proprioceptive accuracy is lower when vision is not available and that performance is generally less accurate in IVR. In reality conditions, the degree of rotation affected accuracy only in the blind condition, whereas in IVR, it caused more errors in both the blind condition and to a lesser degree when proprioception was disrupted. These results indicate an improvement in encoding own body location when vision and proprioception are optimally integrated. No reliable effect of delay was found.
Track Student Attendance at a Time of the COVID-19 Pandemic Using Location-Finding Technology

With the improvement of innovation that has become increasingly unexpected and modern, the use of cell phones has become the primary option in supervising various issues of life. The Covid-19 episode is starting to take the course to move from learning strategies to open distance learning. Open distance learning is an idea where students rate addresses from different locations. Among the exercises affected by this change is the way to record student participation and collaboration through web addresses, rather than the usual way of being in a similar classroom while talking. Global Positioning System (GPS) is a global satellite path frame that provides area and time synchronization. This methodology can help teachers monitor their students' attitudes throughout the learning meeting. GPS activity is based on the triangulation technique where the area is determined by estimating the distance to the satellites. Accordingly, iHadir was recommended to overcome the issue of pursuing student participation. iHadir is a versatile application framework that can find the student's area during a learning meeting. This app can be used as another option in checking student engagement during web-based learning. IHadir will help increase the validity of sharing records during web-based learning.
Pandemic platform governance: Mapping the global ecosystem of COVID-19 response apps

This article provides an exploratory systematic mapping of the global ecosystem of COVID-19 pandemic response apps.After considering policy updates by Google Play's and Apple's App Store, we analyse all the available response apps in July 2020; their different response types; the apps' developers and geographical distribution; the ecosystem's ' generativity' and developers' responsiveness during the unfolding pandemic; the apps' discursive positioning; and material conditions of their development.Google and Apple are gatekeepers of these app ecosystems and exercise control on different layers, shaping the pandemic app response as well as the relationships between governments, citizens, and other actors.We suggest that this global ecosystem of pandemic responses reflects an exceptional mode of what we call 'pandemic platform governance' , where platforms have negotiated their commercial interests and the public interest in exceptional circumstances.
Dynamic-weighting hierarchical segmentation network for medical images

Automatic medical image segmentation plays a crucial role in many medical image analysis applications, such as disease diagnosis and prognosis. Despite the extensive progress of existing deep learning based models for medical image segmentation, they focus on extracting accurate features by designing novel network structures and solely utilize fully connected (FC) layer for pixel-level classification. Considering the insufficient capability of FC layer to encode the extracted diverse feature representations, we propose a Hierarchical Segmentation (HieraSeg) Network for medical image segmentation and devise a Hierarchical Fully Connected (HFC) layer. Specifically, it consists of three classifiers and decouples each category into several subcategories by introducing multiple weight vectors to denote the diverse characteristics in each category. A subcategory-level and a category-level learning schemes are then designed to explicitly enforce the discrepant subcategories and automatically capture the most representative characteristics. Hence, the HFC layer can fit the variant characteristics so as to derive an accurate decision boundary. To enhance the robustness of HieraSeg Network with the variability of lesions, we further propose a Dynamic-Weighting HieraSeg (DW-HieraSeg) Network, which introduces an Image-level Weight Net (IWN) and a Pixel-level Weight Net (PWN) to learn data-driven curriculum. Through progressively incorporating informative images and pixels in an easy-to-hard manner, DW-HieraSeg Network is able to eliminate local optimums and accelerate the training process. Additionally, a class balanced loss is proposed to constrain the PWN for preventing the overfitting problem in minority category. Comprehensive experiments on three benchmark datasets, EndoScene, ISIC and Decathlon, show our newly proposed HieraSeg and DW-HieraSeg Networks achieve state-of-the-art performance, which clearly demonstrates the effectiveness of the proposed approaches for medical image segmentation.
Learning Bias-Invariant Representation by Cross-Sample Mutual Information Minimization

Deep learning algorithms mine knowledge from the training data and thus would likely inherit the dataset’s bias information. As a result, the obtained model would generalize poorly and even mislead the decision process in real-life applications. We propose to remove the bias information misused by the target task with a crosssample adversarial debiasing (CSAD) method. CSAD explicitly extracts target and bias features disentangled from the latent representation generated by a feature extractor and then learns to discover and remove the correlation between the target and bias features. The correlation measurement plays a critical role in adversarial debiasing and is conducted by a cross-sample neural mutual information estimator. Moreover, we propose joint content and local structural representation learning to boost mutual information estimation for better performance. We conduct thorough experiments on publicly available datasets to validate the advantages of the proposed method over state-of-the-art approaches.
BMDS: A Blockchain-based Medical Data Sharing Scheme with Attribute-Based Searchable Encryption

In recent years, more and more medical institutions have been using electronic medical records (EMRs) to improve service efficiency and reduce storage cost. However, it is difficult for medical institutions with different management methods to share medical data. The medical data of patients is easy to be abused, and there are security risks of privacy data leakage. The above problems seriously impede the sharing of medical data. To solve these problems, we propose a blockchain-based medical data sharing scheme with attribute-based searchable encryption, named BMDS. In BMDS, encrypted EMRs are securely stored in the interplanetary file system (IPFS), while corresponding indexes and other information are stored in a medical consortium blockchain. The proposed BMDS has the features of tamper-proof, privacy preservation, verifiability and secure key management, and there is no single point of failure. The performance evaluation of computational overhead and security analysis show that the proposed BMDS has more comprehensive security features and practicability.