Reviewerly/exHarmony huggingface dataset:
Evolutionary Optimization of Residual Neural Network Architectures for Modulation Classification

Automatic modulation classification receives significant interest in the context of current and future wireless communication systems. Deep learning emerged as a powerful tool for modulation classification, as it allows for joint discriminative features learning and signal classification. However, the optimization of deep neural network architectures for modulation classification is a manual and time-consuming process that requires profound domain knowledge and much effort. Most state-of-the-art solutions focus mainly on classification accuracy, while optimization of network complexity is neglected. This paper presents a novel bi-objective memetic algorithm, BO-NSMA, to search optimal deep neural network architectures for modulation classification to maximize classification accuracy and minimize network complexity. The experiments show that BO-NSMA, with an initial population of six individuals and only ten generations, finds a deep neural network architecture that outperforms all human-crafted architectures. Furthermore, BO-NSMA discovered the first low-complexity Convolutional neural network architecture, which achieves slightly better performance than costly Recurrent neural network architectures, allowing a 2.9-fold reduction in network complexity with 1.43% performance improvement. Compared to counterparts from network architecture search, BO-NSMA finds the best architecture, which achieves up to 18.73% accuracy gain and up to an 82-fold reduction in network complexity. The results are validated using the Wilcoxon signed-rank test.
Leakage Power Analysis in Different S-Box Masking Protection Schemes

Internet-of- Things (IoT) devices are natural targets for side-channel attacks. Still, side-channel leakage can be com-plex: its modeling can be assisted by statistical tools. Projection of the leakage into an orthonormal basis allows to understand its structure, typically linear (1st-order leakage) or non-linear (sometimes referred to as glitches). In order to ensure cryptosystems protection, several masking methods have been published. Unfortunately, they follow different strategies; thus it is hard to compare them. Namely, ISW is constructive, GLUT is systematic, RSM is a low-entropy version of GLUT, RSM-ROM is a further optimization aiming at balancing the leakage further, and TI aims at avoiding, by design, the leakage arising from the glitches. In practice, no study has compared these styles on an equal basis. Accordingly, in this paper, we present a consistent methodology relying on a Walsh-Hadamard transform in this respect. We consider different masked implementations of substitution boxes of PRESENT algorithm, as this function is the most leaking in symmetric cryptography. We show that ISW is the most secure among the considered masking implementations. For sure, it takes strong advantage of the knowledge of the PRESENT substitution box equation. Tabulated masking schemes appear as providing a lesser amount of security compared to unprotected counterparts. The leakage is assessed over time, i.e., considering device aging which contributes to mitigate the leakage differently according to the masking style.
Solar Irradiance Prediction Interval Estimation and Deterministic Forecasting Model Using Ground-based Sky Image

Due to the explosive penetration of photovoltaic (PV) systems in the power grid, accurate and well-informed solar PV power forecasting has become extraordinarily crucial, while accurate irradiance prediction is the basis of PV power forecasting. Yet most research on PV power/irradiance forecasting focus on deterministic forecasting, whereas it is difficult to express the credibility of the forecasting results, especially in the scene of instantaneous fluctuation of irradiance and photovoltaic power caused by cloud movement. Therefore, in this paper, we use the ground-based sky image to accurately estimate and track the rapid fluctuation of solar irradiance and meanwhile considers the uncertain constrained optimization problem to establish a high-quality joint point-interval real-time estimation model, which can not only provide the result points from deterministic forecasting, but also achieve the prediction intervals. The results show that the model can produce tight intervals while simultaneously achieving deterministic forecasting results of high quality and strong robustness, regardless of the weather conditions. Besides, compared with the traditional way of taking the middle position of the interval as the deterministic forecasting result, the performance of our model is greatly enhanced.
General Roadmap and Core Steps for the Development of AI Tools in Digital Pathology

Integrating artificial intelligence (AI) tools in the tissue diagnostic workflow will benefit the pathologist and, ultimately, the patient. The generation of such AI tools has two parallel and yet interconnected processes, namely the definition of the pathologist's task to be delivered in silico, and the software development requirements. In this review paper, we demystify this process, from a viewpoint that joins experienced pathologists and data scientists, by proposing a general pathway and describing the core steps to build an AI digital pathology tool. In doing so, we highlight the importance of the collaboration between AI scientists and pathologists, from the initial formulation of the hypothesis to the final, ready-to-use product.
Learned iterative segmentation of highly variable anatomy from limited data: Applications to whole heart segmentation for congenital heart disease

Training deep learning models that segment an image in one step typically requires a large collection of manually annotated images that captures the anatomical variability in a cohort. This poses challenges when anatomical variability is extreme but training data is limited, as when segmenting cardiac structures in patients with congenital heart disease (CHD). In this paper, we propose an iterative segmentation model and show that it can be accurately learned from a small dataset. Implemented as a recurrent neural network, the model evolves a segmentation over multiple steps, from a single user click until reaching an automatically determined stopping point. We develop a novel loss function that evaluates the entire sequence of output segmentations, and use it to learn model parameters. Segmentations evolve predictably according to growth dynamics encapsulated by training data, which consists of images, partially completed segmentations, and the recommended next step. The user can easily refine the final segmentation by examining those that are earlier or later in the output sequence. Using a dataset of 3D cardiac MR scans from patients with a wide range of CHD types, we show that our iterative model offers better generalization to patients with the most severe heart malformations.
RAPIDS cuGraph

In this chapter, the authors discuss the design and implementation of cuGraph, which provides drop-in GPU acceleration of graph analytics as part of RAPIDS, a complete end-to-end data science ecosystem. Graph analytics applications are often limited by the large amount of random memory accesses, which means that the random access effective memory bandwidth of the system tends to be the most important performance metric. Data scientists often develop approaches to answer critical business analytic questions and then, potentially, turn those approaches into something that can be run in production. Data scientists often refer to vertices using string labels and store relationships as a simple list of pairs while GPUs are particularly great at solving mathematical problems. The vision of cuGraph is to make graph analysis ubiquitous to the point that users just think in terms of analysis and not in terms of technologies or frameworks.
Clinically Interpretable Machine Learning Models for Early Prediction of Mortality in Older Patients with Multiple Organ Dysfunction Syndrome: An International Multicenter Retrospective Study

Abstract Background Multiple organ dysfunction syndrome (MODS) is associated with a high risk of mortality among older patients. Current severity scores are limited in their ability to assist clinicians with triage and management decisions. We aim to develop mortality prediction models for older patients with MODS admitted to the ICU. Methods The study analyzed older patients from 197 hospitals in the United States and 1 hospital in the Netherlands. The cohort was divided into the young-old (65–80 years) and old-old (≥80 years), which were separately used to develop and evaluate models including internal, external, and temporal validation. Demographic characteristics, comorbidities, vital signs, laboratory measurements, and treatments were used as predictors. We used the XGBoost algorithm to train models, and the SHapley Additive exPlanations (SHAP) method to interpret predictions. Results Thirty-four thousand four hundred and ninety-seven young-old (11.3% mortality) and 21 330 old-old (15.7% mortality) patients were analyzed. Discrimination AUROC of internal validation models in 9 046 U.S. patients was as follows: 0.87 and 0.82, respectively; discrimination of external validation models in 1 905 EUR patients was as follows: 0.86 and 0.85, respectively; and discrimination of temporal validation models in 8 690 U.S. patients: 0.85 and 0.78, respectively. These models outperformed standard clinical scores like Sequential Organ Failure Assessment and Acute Physiology Score III. The Glasgow Coma Scale, Charlson Comorbidity Index, and Code Status emerged as top predictors of mortality. Conclusions Our models integrate data spanning physiologic and geriatric-relevant variables that outperform existing scores used in older adults with MODS, which represents a proof of concept of how machine learning can streamline data analysis for busy ICU clinicians to potentially optimize prognostication and decision making.
Data encryption based on a 9D complex chaotic system with quaternion for smart grid

With the development of smart grid, the operation and control of power system is realized through power communication network, especially the power production and enterprise management business involve a large amount of sensitive information, and the requirements for data security and real-time transmission are gradually improved. In this paper, a new 9D complex chaotic system with quaternion is proposed for the encryption of smart grid data. Firstly, a new 9D complex chaotic system with quaternion is proposed, and its attractors, bifurcation diagram, complexity, and 0-1 test are analyzed. Secondly, the pseudo-random sequences are generated by the new chaotic system to encrypt power data. Finally, the proposed encryption algorithm is verifed with power data and images in the smart grid, which can ensure the encryption security and real-time. The verifcation results show that the proposed encryption scheme is technically feasible and available for power data and image encryption in smart grid.
Deep convolutional neural network model for bad code smells detection based on oversampling method

Code &lt;span&gt;smells refers to any symptoms or anomalies in the source code that shows violation of design principles or implementation. Early detection of bad code smells improves software quality. Nowadays several artificial neural network (ANN) models have been used for different topics in software engineering: software defect prediction, software vulnerability detection, and code clone detection. It is not necessary to know the source of the data when using ANN models but require large training sets. Data imbalance is the main challenge of artificial intelligence techniques in detecting the code smells. To overcome these challenges, the objective of this study is to presents deep convolutional neural network (D-CNN) model with synthetic minority over-sampling technique (SMOTE) to detect bad code smells based on a set of Java projects. We considered four code-smell datasets which are God class, data class, feature envy and long method and the results were compared based on different performance measures. Experimental results show that the proposed model with oversampling techniques can provide better performance for code smells detection and prediction results can be further improved when the model is trained with more datasets. Moreover, more epochs and hidden layers help increase the accuracy of the model.&lt;/span&gt;
Evolutionary game study on the governance and development of online car-hailing based on blockchain technology

Changes in the online car-hailing industry have brought new challenges to government governance. Effectively enhancing governance efficiency has become the focus of academic research. Based on the technical governance perspective, this paper introduces the consortium blockchain to construct an evolutionary game model between the online car-hailing platform and the government under blockchain technology. By solving the replicated dynamic equations and the Jacobian matrix, the influences of the change in initial conditions and decision parameters on the evolutionary stability results are revealed, and numerical experiments are carried out by using the Python programming language. This paper claims that the system presents three evolutionary stable results and a periodic stochastic state when the key parameters are located in different thresholds. The additional cost of the platform's negative regulation and the government's punishment intensity have a positive effect on the evolution of the system to the ideal state (active regulation, active governance). Platform technology R&D cost and government innovation input have a negative effect on the evolution of the system to the ideal state. Therefore, using blockchain to increase the additional cost of the platform's negative regulation, appropriately increasing the government's punishment intensity, reasonably controlling the government's innovation input to the platform, and reducing the technology R&D cost of the platform will help the system evolve into an ideal state. This paper provides useful references to implement effective governance and the innovative and healthy development of the online car-hailing industry.
IFAttn: Binary code similarity analysis based on interpretable features with attention

Binary code similarity analysis (BCSA1) is meaningful in various software security applications, including vulnerability discovery, clone detection, and malware detection. Although many BCSA studies have been based on neural networks in recent years, some significant problems are challenging to solve. First, most existing methods focus more on the function pair similarity detection task (FPSDT2) while ignoring the function search task (FST3), which is more major in vulnerability discovery. Moreover, they care more about the final result, which is to improve the success rate of FPSDT by using unexplainable neural networks. Finally, in practice, most methods are difficult to resist cross-optimization and cross-obfuscation in BCSA. We first proposed an adaptive BCSA architecture combining interpretable feature engineering and learnable attention mechanism to solve these problems. We design an adaptive model with rich interpretable features, and the experimental results on FPSDT and FST are better than the state-of-the-art methods. In addition, we also found that the attention mechanism has outstanding advantages in functional semantic expression. Finally, the evaluation shows that our approach can significantly improve FST performance between cross-architecture, cross-optimization, cross-obfuscation and cross-compiler binaries.
Correlation-Based Anomaly Detection Method for Multi-sensor System

In industry, sensor-based monitoring of equipment or environment has become a necessity. Instead of using a single sensor, multi-sensor system is used to fully detect abnormalities in complex scenarios. Recently, physical models, signal processing technology, and various machine learning models have improved the performance. However, these methods either do not consider the potential correlation between features or do not take advantage of the sequential changes of correlation while constructing an anomaly detection model. This paper firstly analyzes the correlation characteristic of a multi-sensor system, which shows a lot of clues to the anomaly/fault propagation. Then, a multi-sensor anomaly detection method, which finds and uses the correlation between features contained in the multidimensional time-series data, is proposed. The method converts the multidimensional time-series data into temporal correlation graphs according to time window. By transforming time-series data into graph structure, the task of anomaly detection is considered as a graph classification problem. Moreover, based on the stability and dynamics of the correlation between features, a structure-sensitive graph neural network is used to establish the anomaly detection model, which is used to discover anomalies from multi-sensor system. Experiments on three real-world industrial multi-sensor systems with anomalies indicate that the method obtained better performance than baseline methods, with the mean value of F1 score reaching more than 0.90 and the mean value of AUC score reaching more than 0.95. That is, the method can effectively detect anomalies of multidimensional time series.
The Empirical Analysis of Bitcoin Price Prediction Based on Deep Learning Integration Method

As a new type of electronic currency, bitcoin is more and more recognized and sought after by people, but its price fluctuation is more intense, the market has certain risks, and the price is difficult to be accurately predicted. The main purpose of this study is to use a deep learning integration method (SDAE-B) to predict the price of bitcoin. This method combines two technologies: one is an advanced deep neural network model, which is called stacking denoising autoencoders (SDAE). The SDAE method is used to simulate the nonlinear complex relationship between the bitcoin price and its influencing factors. The other is a powerful integration method called bootstrap aggregation (Bagging), which generates multiple datasets for training a set of basic models (SDAES). In the empirical study, this study compares the price sequence of bitcoin and selects the block size, hash rate, mining difficulty, number of transactions, market capitalization, Baidu and Google search volume, gold price, dollar index, and relevant major events as exogenous variables uses SDAE-B method to compare the price of bitcoin for prediction and uses the traditional machine learning method LSSVM and BP to compare the price of bitcoin for prediction. The prediction results are as follows: the MAPE of the SDAE-B prediction price is 0.016, the RMSE is 131.643, and the DA is 0.817. Compared with the other two methods, it has higher accuracy and lower error, and can well track the randomness and nonlinear characteristics of bitcoin price.
Towards Practical Oblivious Join

Many individuals and companies choose the public cloud as their data and IT infrastructure platform. But remote accesses over the data inevitably bring the issue of trust. Despite strong encryption schemes, adversaries can still learn sensitive information from encrypted data by observing data access patterns. Oblivious RAMs (ORAMs) are proposed to protect against access pattern attacks. However, directly deploying ORAM constructions in an encrypted database brings large computational overhead.
Image Encryption Using a Spectrally Efficient Halton Logistics Tent (HaLT) Map and DNA Encoding for Secured Image Communication

With the advancement of technology worldwide, security is essential for online information and data. This research work proposes a novel image encryption method based on combined chaotic maps, Halton sequence, five-dimension (5D) Hyper-Chaotic System and Deoxyribonucleic Acid (DNA) encoding. Halton sequence is a known low-discrepancy sequence having uniform distribution in space for application in numerical methods. In the proposed work, we derived a new chaotic map (HaLT map) by combining chaotic maps and Halton sequence to scramble images for cryptography applications. First level scrambling was done by using the HaLT map along with a modified quantization unit. In addition, the scrambled image underwent inter- and intra-bit scrambling for enhanced security. Hash values of the original and scrambled image were used for initial conditions to generate a 5D hyper-chaotic map. Since a 5D chaotic map has complex dynamic behavior, it could be used to generate random sequences for image diffusion. Further, DNA level permutation and pixel diffusion was applied. Seven DNA operators, i.e., ADD, SUB, MUL, XOR, XNOR, Right-Shift and Left-Shift, were used for pixel diffusion. The simulation results showed that the proposed image encryption method was fast and provided better encryption compared to ‘state of the art’ techniques. Furthermore, it resisted various attacks.
Satellite Video Tracking by Multi-Feature Correlation Filters with Motion Estimation

As a novel method of earth observation, video satellites can observe dynamic changes in ground targets in real time. To make use of satellite videos, target tracking in satellite videos has received extensive interest. However, this also faces a variety of new challenges such as global occlusion, low resolution, and insufficient information compared with traditional target tracking. To handle the abovementioned problems, a multi-feature correlation filter with motion estimation is proposed. First, we propose a motion estimation algorithm that combines a Kalman filter and an inertial mechanism to alleviate the boundary effects. This can also be used to track the occluded target. Then, we fuse a histogram of oriented gradient (HOG) features and optical flow (OF) features to improve the representation information of the target. Finally, we introduce a disruptor-aware mechanism to weaken the influence of background noise. Experimental results verify that our algorithm can achieve high tracking performance.
Supporting Smart Home Scenarios Using OWL and SWRL Rules

Despite the pervasiveness of IoT domotic devices in the home automation landscape, their potential is still quite under-exploited due to the high heterogeneity and the scarce expressivity of the most commonly adopted scenario programming paradigms. The aim of this study is to show that Semantic Web technologies constitute a viable solution to tackle not only the interoperability issues, but also the overall programming complexity of modern IoT home automation scenarios. For this purpose, we developed a knowledge-based home automation system in which scenarios are the result of logical inferences over the IoT sensors data combined with formalised knowledge. In particular, we describe how the SWRL language can be employed to overcome the limitations of the well-known trigger-action paradigm. Through various experiments in three distinct scenarios, we demonstrated the feasibility of the proposed approach and its applicability in a standardised and validated context such as SAREF.