Reviewerly/exHarmony huggingface dataset:
Cloud failure prediction based on traditional machine learning and deep learning

Abstract Cloud failure is one of the critical issues since it can cost millions of dollars to cloud service providers, in addition to the loss of productivity suffered by industrial users. Fault tolerance management is the key approach to address this issue, and failure prediction is one of the techniques to prevent the occurrence of a failure. One of the main challenges in performing failure prediction is to produce a highly accurate predictive model. Although some work on failure prediction models has been proposed, there is still a lack of a comprehensive evaluation of models based on different types of machine learning algorithms. Therefore, in this paper, we propose a comprehensive comparison and model evaluation for predictive models for job and task failure. These models are built and trained using five traditional machine learning algorithms and three variants of deep learning algorithms. We use a benchmark dataset, called Google Cloud Traces, for training and testing the models. We evaluated the performance of models using multiple metrics and determined their important features, as well as measured their scalability. Our analysis resulted in the following findings. Firstly, in the case of job failure prediction, we found that Extreme Gradient Boosting produces the best model where the disk space request and CPU request are the most important features that influence the prediction. Second, for task failure prediction, we found that Decision Tree and Random Forest produce the best models where the priority of the task is the most important feature for both models. Our scalability analysis has determined that the Logistic Regression model is the most scalable as compared to others.
Human Detection Algorithm Based on Improved YOLO v4

The human behavior datasets have the characteristics of complex background, diverse poses, partial occlusion, and diverse sizes. Firstly, this paper adopts YOLO v3 and YOLO v4 algorithms to detect human objects in videos, and qualitatively analyzes and compares detection performance of two algorithms on UTI, UCF101, HMDB51 and CASIA datasets. Then, this paper proposed an improved YOLO v4 algorithm since the vanilla YOLO v4 has incomplete human detection in specific video frames. Specifically, the improved YOLO v4 introduces the Ghost module in the CBM module to further reduce the number of parameters. Lateral connection is added in the CSP module to improve the feature representation capability of the network. Furthermore, we also substitute MaxPool with SoftPool in the primary SPP module, which not only avoids the feature loss, but also provides a regularization effect for the network, thus improving the generalization ability of the network. Finally, this paper qualitatively compares the detection effects of the improved YOLO v4 and primary YOLO v4 algorithm on specific datasets. The experimental results show that the improved YOLO v4 can solve the problem of complex targets in human detection tasks effectively, and further improve the detection speed.
Accurate separation of mixed high-dimension optical-chaotic signals using optical reservoir computing based on optically pumped VCSELs

In this work, with the mixing fractions being known in advance or unknown, the schemes and theories for the separations of two groups of the mixed optical chaotic signals are proposed in detail, using the VCSEL-based reservoir computing (RC) systems. Here, two groups of the mixed optical chaotic signals are linearly combined with many beams of the chaotic x-polarization components (X-PCs) and Y-PCs emitted by the optically pumped spin-VCSELs operation alone. Two parallel reservoirs are performed by using the chaotic X-PC and Y-PC output by the optically pumped spin-VCSEL with both optical feedback and optical injection. Moreover, we further demonstrate the separation performances of the mixed chaotic signal linearly combined with no more than three beams of the chaotic X-PC or Y-PC. We find that two groups of the mixed optical chaos signals can be effectively separated by using two reservoirs in single RC system based on optically pumped Spin-VCSEL and their corresponding separated errors characterized by the training errors are no more than 0.093, when the mixing fractions are known as a certain value in advance. If the mixing fractions are unknown, we utilize two cascaded RC systems based on optically pumped Spin-VCSELs to separate each group of the mixed optical signals. The mixing fractions can be accurate predicted by using two parallel reservoirs in the first RC system. Based on the values of the predictive mixing fractions, two groups of the mixed optical chaos signals can be effectively separated by utilizing two parallel reservoirs in the second RC system, and their separated errors also are no more than 0.093. In the same way, the mixed optical chaos signal linearly superimposed with more than three beams of optical chaotic signals can be effectively separated. The method and idea for separation of complex optical chaos signals proposed by this paper may provide an impact to development of novel principles of multiple access and demultiplexing in multi-channel chaotic cryptography communication.
Self-Consistent Contrastive Attributed Graph Clustering With Pseudo-Label Prompt

Attributed graph clustering, which learns node representation from node attribute and topological graph for clustering, is a fundamental but challenging task for graph analysis. Recently, methods based on graph contrastive learning (GCL) have obtained impressive clustering performance on this task. Yet, we observe that existing GCL-based methods 1) fail to benefit from imprecise clustering labels; 2) require a post-processing operation to get clustering labels; 3) cannot solve out-of-sample (OOS) problem. To address these issues, we propose a novel attributed graph clustering network, namely Self-supervised Contrastive Attributed Graph Clustering (SCAGC). In SCAGC, by leveraging inaccurate clustering labels, a self-supervised contrastive loss, which aims to maximize the similarities of intra-cluster nodes while minimizing the similarities of inter-cluster nodes, are designed for node representation learning. Meanwhile, a clustering module is built to directly output clustering labels by contrasting the representation of different clusters. Thus, for the OOS nodes, SCAGC can directly calculate their clustering labels. Extensive experimental results on four benchmark datasets have shown that SCAGC consistently outperforms 11 competitive clustering methods.
German Medical Named Entity Recognition Model and Data Set Creation Using Machine Translation and Word Alignment: Algorithm Development and Validation

Data mining in the field of medical data analysis often needs to rely solely on the processing of unstructured data to retrieve relevant data. For German natural language processing, few open medical neural named entity recognition (NER) models have been published before this work. A major issue can be attributed to the lack of German training data.We developed a synthetic data set and a novel German medical NER model for public access to demonstrate the feasibility of our approach. In order to bypass legal restrictions due to potential data leaks through model analysis, we did not make use of internal, proprietary data sets, which is a frequent veto factor for data set publication.The underlying German data set was retrieved by translation and word alignment of a public English data set. The data set served as a foundation for model training and evaluation. For demonstration purposes, our NER model follows a simple network architecture that is designed for low computational requirements.The obtained data set consisted of 8599 sentences including 30,233 annotations. The model achieved a class frequency-averaged F1 score of 0.82 on the test set after training across 7 different NER types. Artifacts in the synthesized data set with regard to translation and alignment induced by the proposed method were exposed. The annotation performance was evaluated on an external data set and measured in comparison with an existing baseline model that has been trained on a dedicated German data set in a traditional fashion. We discussed the drop in annotation performance on an external data set for our simple NER model. Our model is publicly available.We demonstrated the feasibility of obtaining a data set and training a German medical NER model by the exclusive use of public training data through our suggested method. The discussion on the limitations of our approach includes ways to further mitigate remaining problems in future work.
Deep Active Learning for Computer Vision: Past and Future

As an important data selection schema, active learning emerges as the essential component when iterating an Artificial Intelligence (AI) model. It becomes even more critical given the dominance of deep neural network based models, which are composed of a large number of parameters and data hungry, in application. Despite its indispensable role for developing AI models, research on active learning is not as intensive as other research directions. In this paper, we present a review of active learning through deep active learning approaches from the following perspectives: 1) technical advancements in active learning, 2) applications of active learning in computer vision, 3) industrial systems leveraging or with potential to leverage active learning for data iteration, 4) current limitations and future research directions. We expect this paper to clarify the significance of active learning in a modern AI model manufacturing process and to bring additional research attention to active learning. By addressing data automation challenges and coping with automated machine learning systems, active learning will facilitate democratization of AI technologies by boosting model production at scale.
Performance Enhancement of INS and UWB Fusion Positioning Method Based on Two-Level Error Model

In GNSS-denied environments, especially when losing measurement sensor data, inertial navigation system (INS) accuracy is critical to the precise positioning of vehicles, and an accurate INS error compensation model is the most effective way to improve INS accuracy. To this end, a two-level error model is proposed, which comprehensively utilizes the mechanism error model and propagation error model. Based on this model, the INS and ultra-wideband (UWB) fusion positioning method is derived relying on the extended Kalman filter (EKF) method. To further improve accuracy, the data prefiltering algorithm of the wavelet shrinkage method based on Stein's unbiased risk estimate-Shrink (SURE-Shrink) threshold is summarized for raw inertial measurement unit (IMU) data. The experimental results show that by employing the SURE-Shrink wavelet denoising method, positioning accuracy is improved by 76.6%; by applying the two-level error model, the accuracy is further improved by 84.3%. More importantly, at the point when the vehicle motion state changes, adopting the two-level error model can provide higher computational stability and less fluctuation in trajectory curves.
A novel hybrid PSO based on levy flight and wavelet mutation for global optimization

The concise concept and good optimization performance are the advantages of particle swarm optimization algorithm (PSO), which makes it widely used in many fields. However, when solving complex multimodal optimization problems, it is easy to fall into early convergence. The rapid loss of population diversity is one of the important reasons why the PSO algorithm falls into early convergence. For this reason, this paper attempts to combine the PSO algorithm with wavelet theory and levy flight theory to propose a new hybrid algorithm called PSOLFWM. It applies the random wandering of levy flight and the mutation operation of wavelet theory to enhance the population diversity and seeking performance of the PSO to make it search more efficiently in the solution space to obtain higher quality solutions. A series of classical test functions and 19 optimization algorithms proposed in recent years are used to evaluate the optimization performance accuracy of the proposed method. The experimental results show that the proposed algorithm is superior to the comparison method in terms of convergence speed and convergence accuracy. The success of the high-dimensional function test and dynamic shift performance test further verifies that the proposed algorithm has higher search stability and anti-interference performance than the comparison algorithm. More importantly, both t-Test and Wilcoxon's rank sum test statistical analyses were carried out. The results show that there are significant differences between the proposed algorithm and other comparison algorithms at the significance level α = 0.05, and the performance is better than other comparison algorithms.
Specular Reflections Detection and Removal for Endoscopic Images Based on Brightness Classification

Specular Reflections often exist in the endoscopic image, which not only hurts many computer vision algorithms but also seriously interferes with the observation and judgment of the surgeon. The information behind the recovery specular reflection areas is a necessary pre-processing step in medical image analysis and application. The existing highlight detection method is usually only suitable for medium-brightness images. The existing highlight removal method is only applicable to images without large specular regions, when dealing with high-resolution medical images with complex texture information, not only does it have a poor recovery effect, but the algorithm operation efficiency is also low. To overcome these limitations, this paper proposes a specular reflection detection and removal method for endoscopic images based on brightness classification. It can effectively detect the specular regions in endoscopic images of different brightness and can improve the operating efficiency of the algorithm while restoring the texture structure information of the high-resolution image. In addition to achieving image brightness classification and enhancing the brightness component of low-brightness images, this method also includes two new steps: In the highlight detection phase, the adaptive threshold function that changes with the brightness of the image is used to detect absolute highlights. During the highlight recovery phase, the priority function of the exemplar-based image inpainting algorithm was modified to ensure reasonable and correct repairs. At the same time, local priority computing and adaptive local search strategies were used to improve algorithm efficiency and reduce error matching. The experimental results show that compared with the other state-of-the-art, our method shows better performance in terms of qualitative and quantitative evaluations, and the algorithm efficiency is greatly improved when processing high-resolution endoscopy images.
Prevalence of Positive COVID-19 Test Results Collected by Digital Self-report in the US and Germany

This cohort study examines traditional surveillance and self-reported COVID-19 test result data collected from independent smartphone app–based studies in the US and Germany.
Six Days Ahead Forecasting of Energy Production of Small Behind-the-Meter Solar Sites

Due to the growing penetration of behind-the-meter (BTM) photovoltaic (PV) installations, accurate solar energy forecasts are required for a reliable economic energy system operation. A new hybrid methodology is proposed in this paper with a sequence of one-step ahead models to accumulate 144 h for a small-scale BTM PV site. Three groups of models with different inputs are developed to cover 6 days of forecasting horizon, with each group trained for each hour of the above zero irradiance. In addition, a novel dataset preselection is proposed, and neighboring solar farms’ power predictions are used as a feature to boost the accuracy of the model. Two techniques are selected: XGBoost and CatBoost. An extensive assessment for 1 year is conducted to evaluate the proposed method. Numerical results highlight that training the models with the previous, current, and 1 month ahead from the previous year referenced by the target month can improve the model’s accuracy. Finally, when solar energy predictions from neighboring solar farms are incorporated, this further increases the overall forecast accuracy. The proposed method is compared with the complete-history persistence ensemble (CH-PeEn) model as a benchmark.
A Combination of Real-World Experiments and Augmented Reality When Learning about the States of Wax—An Eye-Tracking Study

Burning candles show the solid and liquid states of wax on a macroscopic level. With augmented reality, the submicroscopic and symbolic level of all three states of wax can be shown. The augmented reality environment developed in this study lets students test their knowledge about the position of the three states of wax. So far, how the design parameters of augmented reality learning environments influence users’ eye movement and learning performance has not been researched. Twenty-three German students between the ages of 9 and 15 form the randomized sample of this study with three different groups. AR learning scenarios were created, varying only in one design parameter: ‘congruence with reality’. Our analysis using audio, video, and eye-tracking data showed that all the participants learned mostly the same and that the participants who saw the real experiment on screen experienced the highest degree of immersion. This study indicates that the presented AR learning environment is an opportunity to learn about what exact part of a candle is burning with the submicroscopic level shown in comparison; before using the learning environment, the students were uncertain about what substance burns when a candle is lit and what function the wick has. This study suggests teachers should think about implementing learning environments such as this to help students connect different levels of representation.
A Mapless Local Path Planning Approach Using Deep Reinforcement Learning Framework

The key module for autonomous mobile robots is path planning and obstacle avoidance. Global path planning based on known maps has been effectively achieved. Local path planning in unknown dynamic environments is still very challenging due to the lack of detailed environmental information and unpredictability. This paper proposes an end-to-end local path planner n-step dueling double DQN with reward-based ϵ-greedy (RND3QN) based on a deep reinforcement learning framework, which acquires environmental data from LiDAR as input and uses a neural network to fit Q-values to output the corresponding discrete actions. The bias is reduced using n-step bootstrapping based on deep Q-network (DQN). The ϵ-greedy exploration-exploitation strategy is improved with the reward value as a measure of exploration, and an auxiliary reward function is introduced to increase the reward distribution of the sparse reward environment. Simulation experiments are conducted on the gazebo to test the algorithm's effectiveness. The experimental data demonstrate that the average total reward value of RND3QN is higher than that of algorithms such as dueling double DQN (D3QN), and the success rates are increased by 174%, 65%, and 61% over D3QN on three stages, respectively. We experimented on the turtlebot3 waffle pi robot, and the strategies learned from the simulation can be effectively transferred to the real robot.
Improved Cattle Disease Diagnosis Based on Fuzzy Logic Algorithms

The health and productivity of animals, as well as farmers' financial well-being, can be significantly impacted by cattle illnesses. Accurate and timely diagnosis is therefore essential for effective disease management and control. In this study, we consider the development of models and algorithms for diagnosing diseases in cattle based on Sugeno's fuzzy inference. To achieve this goal, an analytical review of mathematical methods for diagnosing animal diseases and soft computing methods for solving classification problems was performed. Based on the clinical signs of diseases, an algorithm was proposed to build a knowledge base to diagnose diseases in cattle. This algorithm serves to increase the reliability of informative features. Based on the proposed algorithm, a program for diagnosing diseases in cattle was developed. Afterward, a computational experiment was performed. The results of the computational experiment are additional tools for decision-making on the diagnosis of a disease in cattle. Using the developed program, a Sugeno fuzzy logic model was built for diagnosing diseases in cattle. The analysis of the adequacy of the results obtained from the Sugeno fuzzy logic model was performed. The processes of solving several existing (model) classification and evaluation problems and comparing the results with several existing algorithms are considered. The results obtained enable it to be possible to promptly diagnose and perform certain therapeutic measures as well as reduce the time of data analysis and increase the efficiency of diagnosing cattle. The scientific novelty of this study is the creation of an algorithm for building a knowledge base and improving the algorithm for constructing the Sugeno fuzzy logic model for diagnosing diseases in cattle. The findings of this study can be widely used in veterinary medicine in solving the problems of diagnosing diseases in cattle and substantiating decision-making in intelligent systems.
Fake Accounts Identification in Mobile Communication Networks Based on Machine Learning

Fake accounts on online social networks are increasing today with an increase in the number of active social network users. Social media websites allow users to share thoughts, facts, views and re-sharing these into various networks. Social media platforms provide users with enormous valuable information but with this great amount of information in social media, many issues like fake profile, online hacking have also grown. The fake profiles in online social sites create fake news and share unwanted material which contains spam links that affect natural users. The massive issue in social media communication networks is spam and it is necessary to identify fake profiles to stop spam. In this paper, a supervised machine learning algorithm called support vector machine (SVM) is used to identify fake accounts on social media effectively. In order to automatically identify fake online profiles, Random Forest classifier is used with SVM. With this concept, it can be applied online easily to identify millions of accounts that cannot be examined manually. The result of this model is compared with other identification techniques and the results show that the proposed algorithm performs better with high precision and recall. This method efficiently safeguards social media networks from online threats and attacks.