Reviewerly/exHarmony huggingface dataset:
Look Ahead! Revealing Complete Composite Refactorings and their Smelliness Effects

Recent studies have revealed that developers often apply composite refactorings (or, simply, composites). A composite consists of two or more interrelated refactorings applied together. Previous studies investigated the effect of composites on code smells. A composite is considered “complete” whenever it completely removes one target code smell. They proposed descriptions of complete composites with recommendations to remove certain code smell types, such as Long Methods and Feature Envies. These studies also present different recommendations to remove the same code smell type. However, these studies: (i) are limited to composites only consisting of a small subset of Fowler's refactoring types, (ii) do not detail the scenarios in which each recommendation can be applied to remove the code smell, and (iii) fail in reporting possible side effects of the described composites, such as adversely introducing certain smell types. This paper aims to cover these limitations by performing a systematic analysis of 618 complete composites on removing four common smell types identified in 20 software projects. Our results indicated that: (i) 64% complete composites consisted of refactoring types not covered by existing descriptions of complete composites, and (ii) 36% complete composites formed by Extract Methods can introduce Feature Envies and Intensive Couplings. This information is not documented by existing descriptions, and it can alert developers about alternatives to remove Feature Envy, mainly in methods that are fully envious. These results suggest existing descriptions of complete composites should be either revisited or enhanced to explicitly highlight known side effects. We present a catalog of composites with details about side effects, recommendations to remove or minimize them, and some scenarios in which each recommendation can be applied to remove the code smell. Our catalog can be useful to improve existing tooling support for refactorings, such as IDEs, informing about possible side effects when refactorings are composed.
Detecting Taxi Trajectory Anomaly Based on Spatio-Temporal Relations

Researchers have proposed many novel methods to detect abnormal taxi trajectories. However, most of the existing methods usually adopt a counting-based strategy, which may cause high false positives due to imprecisely identifying diverse trajectories as anomalies and therefore, they need the support of large-scale historical trajectories to work properly. To improve detection precision and efficiency, in this article, we propose STR, an online abnormal taxi trajectory detection method based on spatio-temporal relations. The basic principle behind STR is that given the displacement from the source point to a testing point, if the driving time and driving distance are not within the normal ranges, the point is identified as anomalous. To learn the two normal ranges for driving time and driving distance, STR defines two spatio-temporal models which characterize the relationship between displacement and driving distance/driving time. To improve detection efficiency, STR reduces the number of models that need to be learned by making full use of the similarity of transportation modes in different time periods and neighboring areas. The effectiveness and performance of STR are evaluated on real-world taxi trajectories. The experiment results show that compared with counting-based methods, STR achieves greater precision by reducing false positives. Furthermore, STR is more efficient than its counterparts and is suitable for online detection.
Benchmarking Domain Adaptation Methods on Aerial Datasets

Deep learning grew in importance in recent years due to its versatility and excellent performance on supervised classification tasks. A core assumption for such supervised approaches is that the training and testing data are drawn from the same underlying data distribution. This may not always be the case, and in such cases, the performance of the model is degraded. Domain adaptation aims to overcome the domain shift between the source domain used for training and the target domain data used for testing. Unsupervised domain adaptation deals with situations where the network is trained on labeled data from the source domain and unlabeled data from the target domain with the goal of performing well on the target domain data at the time of deployment. In this study, we overview seven state-of-the-art unsupervised domain adaptation models based on deep learning and benchmark their performance on three new domain adaptation datasets created from publicly available aerial datasets. We believe this is the first study on benchmarking domain adaptation methods for aerial data. In addition to reporting classification performance for the different domain adaptation models, we present t-SNE visualizations that illustrate the benefits of the adaptation process.
Constructing driver Hamiltonians for optimization problems with linear constraints

Abstract Recent advances in the field of adiabatic quantum computing and the closely related field of quantum annealing have centered around using more advanced and novel Hamiltonian representations to solve optimization problems. One of these advances has centered around the development of driver Hamiltonians that commute with the constraints of an optimization problem—allowing for another avenue to satisfying those constraints instead of imposing penalty terms for each of them. In particular, the approach is able to use sparser connectivity to embed several practical problems on quantum devices in comparison to the standard approach of using penalty terms. However, designing the driver Hamiltonians that successfully commute with several constraints has largely been based on strong intuition for specific problems and with no simple general algorithm for generating them for arbitrary constraints. In this work, we develop a simple and intuitive algebraic framework for reasoning about the commutation of Hamiltonians with linear constraints—one that allows us to classify the complexity of finding a driver Hamiltonian for an arbitrary set of linear constraints as NP-complete. Because unitary operators are exponentials of Hermitian operators, these results can also be applied to the construction of mixers in the quantum alternating operator ansatz framework.
Multiuser physical layer security mechanism in the wireless communication system of the IIOT

Wireless system in industrial scene plays an important role in the process of automation. This kind of system urgently needs low complexity, lightweight, high security authentication mechanism. The emergence of physical layer authentication meets these requirements. However, the existing authentication mechanism based on binary hypothesis testing can only perform ideally under fixed conditions, and cannot distinguish multiple users; The authentication mechanism based on deep neural network (DNN) algorithm has limitations in small sample learning and parameter setting. In order to further improve the accuracy of authentication in dynamic industrial scenarios, a new multiuser physical layer authentication scheme is proposed. The mechanism uses machine learning algorithm based on autonomous parameter optimization to replace the traditional decision making method based on user-defined threshold, and is suitable for small sample learning. This paper takes the channel matrix estimated by the mobile node as the authentication input, obtains different channel matrix dimensions through down sampling, and finds out the optimal channel matrix dimension through experiments, so as to reduce the running time and improve the authentication accuracy. A large number of simulations are carried out using the public dynamic industrial scene data set. Compared with the existing authentication schemes, the proposed authentication scheme further improves the accuracy of multiuser authentication in dynamic industrial scenarios.
Optimizing Parameterized Quantum Circuits with Free-Axis Selection

Parameterized quantum circuits (PQCs), which are essential for variational quantum algorithms, have conventionally been optimized by parameterized rotational angles of single-qubit gates around predetermined set of axes. We propose a new method to optimize a PQC by continuous parameterization of both the angles and the axes of its single-qubit rotations. The method is based on the observation that when rotational angles are fixed, optimal axes of rotations can be computed by solving a system of linear equations whose coefficients can be determined from the PQC with small computational overhead. The method can be further simplified to select axes freely from continuous parameters with rotational angles fixed to π. We show the simplified free-axis selection method has better expressibility against other structural optimization methods when measured with Kullback-Leibler (KL) divergence. We also demonstrate PQCs with free-axis selection are more effective to search the ground states of Heisenberg models and molecular Hamiltoni- ans. Because free-axis selection allows designing PQCs without specifying their single-qubit rotational axes, it may significantly improve the handiness of PQCs.
Social Context-aware Person Search in Videos via Multi-modal Cues

Person search has long been treated as a crucial and challenging task to support deeper insight in personalized summarization and personality discovery. Traditional methods, e.g., person re-identification and face recognition techniques, which profile video characters based on visual information, are often limited by relatively fixed poses or small variation of viewpoints and suffer from more realistic scenes with high motion complexity (e.g., movies). At the same time, long videos such as movies often have logical story lines and are composed of continuously developmental plots. In this situation, different persons usually meet on a specific occasion, in which informative social cues are performed. We notice that these social cues could semantically profile their personality and benefit person search task in two aspects. First, persons with certain relationships usually co-occur in short intervals; in case one of them is easier to be identified, the social relation cues extracted from their co-occurrences could further benefit the identification for the harder ones. Second, social relations could reveal the association between certain scenes and characters (e.g., classmate relationship may only exist among students), which could narrow down candidates into certain persons with a specific relationship. In this way, high-level social relation cues could improve the effectiveness of person search. Along this line, in this article, we propose a social context-aware framework, which fuses visual and social contexts to profile persons in more semantic perspectives and better deal with person search task in complex scenarios. Specifically, we first segment videos into several independent scene units and abstract out social contexts within these scene units. Then, we construct inner-personal links through a graph formulation operation for each scene unit, in which both visual cues and relation cues are considered. Finally, we perform a relation-aware label propagation to identify characters’ occurrences, combining low-level semantic cues (i.e., visual cues) and high-level semantic cues (i.e., relation cues) to further enhance the accuracy. Experiments on real-world datasets validate that our solution outperforms several competitive baselines.
Research on Lightweight Infrared Pedestrian Detection Model Algorithm for Embedded Platform

Due to the limitation of energy consumption and power consumption, the embedded platform cannot meet the real-time requirements of the far-infrared image pedestrian detection algorithm. To solve this problem, this paper proposes a new real-time infrared pedestrian detection algorithm (RepVGG-YOLOv4, Rep-YOLO), which uses RepVGG to reconstruct the YOLOv4 backbone network, reduces the amount of model parameters and calculations, and improves the speed of target detection; using space spatial pyramid pooling (SPP) obtains different receptive field information to improve the accuracy of model detection; using the channel pruning compression method reduces redundant parameters, model size, and computational complexity. The experimental results show that compared with the YOLOv4 target detection algorithm, the Rep-YOLO algorithm reduces the model volume by 90%, the floating-point calculation is reduced by 93.4%, the reasoning speed is increased by 4 times, and the model detection accuracy after compression reaches 93.25%.
Nonlinear Hyperparameter Optimization of a Neural Network in Image Processing for Micromachines

Deep neural networks are widely used in the field of image processing for micromachines, such as in 3D shape detection in microelectronic high-speed dispensing and object detection in microrobots. It is already known that hyperparameters and their interactions impact neural network model performance. Taking advantage of the mathematical correlations between hyperparameters and the corresponding deep learning model to adjust hyperparameters intelligently is the key to obtaining an optimal solution from a deep neural network model. Leveraging these correlations is also significant for unlocking the "black box" of deep learning by revealing the mechanism of its mathematical principle. However, there is no complete system for studying the combination of mathematical derivation and experimental verification methods to quantify the impacts of hyperparameters on the performances of deep learning models. Therefore, in this paper, the authors analyzed the mathematical relationships among four hyperparameters: the learning rate, batch size, dropout rate, and convolution kernel size. A generalized multiparameter mathematical correlation model was also established, which showed that the interaction between these hyperparameters played an important role in the neural network's performance. Different experiments were verified by running convolutional neural network algorithms to validate the proposal on the MNIST dataset. Notably, this research can help establish a universal multiparameter mathematical correlation model to guide the deep learning parameter adjustment process.
A Critical Analysis of Apache Hadoop and Spark for Big Data Processing

The emergence of big data processing platforms that can work globally in an integrated manner and process the huge datasets efficiently has become very significant. A critical analysis of two big data processing platforms, Apache Hadoop MapReduce and Apache Spark, has been done in this paper. Earlier Hadoop MapReduce was one of the most popular platforms for batch-processing of huge size datasets but variation in the nature of data from static to dynamic, Apache Spark proves to be better for iterative jobs and live data streams. This paper aims to critically compare and analyze Hadoop-l.x, 2. x and 3. x, Spark-l.x, 2. x and 3. x on well-known key parameters like components, storage system, resource management, fault tolerance, data processing, scalability and performance etc.
Automating the synthesis of recommender systems for modelling languages

We are witnessing an increasing interest in building recommender systems (RSs) for all sorts of Software Engineering activities. Modelling is no exception to this trend, as modelling environments are being enriched with RSs that help building models by providing recommendations based on previous solutions to similar problems in the same domain. However, building a RS from scratch requires considerable effort and specialized knowledge. To alleviate this problem, we propose an automated approach to the generation of RSs for modelling languages. Our approach is model-based, and we provide a domain-specific language called Droid to configure every aspect of the RS (like the type and features of the recommended items, the recommendation method, and the evaluation metrics). The RS so configured can be deployed as a service, and we offer out-of-the-box integration of this service with the EMF tree editor. To assess the usefulness of our proposal, we present a case study on the integration of a generated RS with a modelling chatbot, and report on an offline experiment measuring the precision and completeness of the recommendations.
Are Vision Transformers Robust to Patch Perturbations?

Recent advances in Vision Transformer (ViT) have demonstrated its impressive performance in image classification, which makes it a promising alternative to Convolutional Neural Network (CNN). Unlike CNNs, ViT represents an input image as a sequence of image patches. The patch-based input image representation makes the following question interesting: How does ViT perform when individual input image patches are perturbed with natural corruptions or adversarial perturbations, compared to CNNs? In this work, we study the robustness of ViT to patch-wise perturbations. Surprisingly, we find that ViTs are more robust to naturally corrupted patches than CNNs, whereas they are more vulnerable to adversarial patches. Furthermore, we discover that the attention mechanism greatly affects the robustness of vision transformers. Specifically, the attention module can help improve the robustness of ViT by effectively ignoring natural corrupted patches. However, when ViTs are attacked by an adversary, the attention mechanism can be easily fooled to focus more on the adversarially perturbed patches and cause a mistake. Based on our analysis, we propose a simple temperature-scaling based method to improve the robustness of ViT against adversarial patches. Extensive qualitative and quantitative experiments are performed to support our findings, understanding, and improvement of ViT robustness to patch-wise perturbations across a set of transformer-based architectures.
Implementing Virtual Reality Laboratory Accidents Using The Half Life Game Engine, Worldup, And Java3 D

This paper describes recent developments in an ongoing project [1][2][3] to develop a series of virtual reality based laboratory accident simulations, designed to impress upon users the importance of following proper lab safety procedures, and the potential consequences of not doing so.The primary goal of the project is that users will remember the experience of suffering a lab accident longer and more vividly than a written set of lab safety rules, and will hopefully conduct themselves in a safer manner as a result.A secondary goal is to explore a variety of different development platforms, to determine which are most practical and effective for this type of first-person educational simulation.The following sections will describe the current status of the overall project, and describe the most recently developed modules.
Exploring scientific trajectories of a large-scale dataset using topic-integrated path extraction

Main path analysis (MPA) is the most widely accepted approach to tracing knowledge transfer in a research field. In this study, we extracted multiple longest paths from the multidisciplinary academic field's citation network and integrating topic modeling to the extracted paths. We consider three main aspects of trajectory analysis when analyzing the represented documents through the extracted paths: emergence, authority, and topic dynamics. For path extraction, we adopt the longest path algorithm that consists of the following three steps: 1) topological sort, 2) edge relaxation, and 3) multiple path extraction. For topic integration into multiple paths, we employ latent Dirichlet allocation (LDA) by utilizing the topic-document matrix that LDA derives to select an article's topic from the citation network, where each article is labeled with the topic that is assigned with the highest topical probability for that article. We conduct a series of experiments to examine the results on a dataset from the field of healthcare informatics that PubMed provides.
A quality framework for statistical algorithms

As national statistical offices (NSOs) modernize, interest in integrating machine learning (ML) into official statisticians’ toolbox is growing. Two challenges to such an integration are the potential loss of transparency from using “black-boxes” and the need to develop a quality framework. In 2019, the High-Level Group for the Modernisation of Official Statistics (HLG-MOS) launched a project on machine learning with one of the objectives being to address these two challenges. One of the outputs of the HLG-MOS project is a Quality Framework for Statistical Algorithms (QF4SA). While many quality frameworks exist, they have been conceived with traditional methods in mind, and they tend to target statistical outputs. Currently, machine learning methods are being looked at for use in processes producing intermediate outputs, which lead to a final statistical output. Therefore, the QF4SA does not replace existing quality frameworks; it complements them. As the QF4SA targets intermediate outputs and not necessarily the final statistical output, it should be used in conjunction with existing quality frameworks to ensure that high-quality outputs are produced. This paper presents the QF4SA, as well as some recommendations for NSOs considering the use of machine learning in the production of official statistics.
A Survey on Credit Card Fraud Detection Techniques in Banking Industry for Cyber Security

The technological revolution is accelerating due to a number of key enabling technologies, such as Artificial Intelligence (AI)/Machine Learning (ML), big data, blockchain, cloud computing, Internet of Thing (IoT). With the broad adoption of ever-improving internet technology, cyber security is of great importance in the banking industry due to the rising number of cyber attacks and crimes. Credit card fraud is one of the most serious threats facing the banking industry worldwide. Credit card fraud is expanding at an alarming rate and has developed into a significant problem, particularly as the volume of financial transactions involving credit cards continues to expand. In this paper, we have reviewed various credit card fraud detection techniques that can strengthen the defense against a range of frauds. Additionally, we analysed the findings and reported the research challenges. Finally, we compared various techniques and highlighted their advantages and disadvantages. This will help provide guidance for determining the most appropriate techniques for credit card fraud detection.
Towards real-time object detection in GigaPixel-level video

Object detection aims to locate and recognize objects in images or videos, which contributes to many downstream intelligent applications. Recently, emerging gigapixel videography has attracted considerable attention from computer vision, microscopy, telescopy and many other communities. Its large field of view and high spatial resolution provide sufficient global and local information simultaneously. Although state-of-the-art detection methods have achieved success in common images, they can not be transferred to gigapixel images with both effectiveness and efficiency. To solve this problem, we make the first attempt towards accurate and real-time object detection in giga-pixel video. In this paper we propose a novel framework, termed as GigaDet, which adopts an efficient global-to-local strategy, following the principle of human vision system. Based on the spatial sparsity of objects, a patch generation network (PGN) is introduced to globally locate possible regions containing objects and determine the proper resize ratio of each patch. Then the collected multi-scale patches are fed into a decorated detector (DecDet) in parallel to perform accurate and fast detection in a local way. We carry out extensive experiments on PANDA dataset and GigaDet yields 76.2% AP and 5 FPS on a single 2080ti GPU, which is comparably accurate but 50x faster than Faster RCNN. We believe this research can inspire new applications based on gigapixel video for a large range of fields.