Reviewerly/exHarmony huggingface dataset:
A numerical investigation of optimum angles for solar energy receivers in the eastern part of Algeria

Abstract The need to capture the maximum amount of solar energy and to optimize the panels’ collecting surfaces are among the primary objectives of research in solar engineering. The simplest way to accomplish this is to perform a monthly accurate determination of the solar collector’s proper slope and azimuth angles. Indeed, this is the aim of this article, which consists of a graphical optimization based on the Gueymard’s daily integration model. A Matlab program was developed to predict the hourly solar radiation on a solar receiver using the Gueymard model in conjunction with the Liu and Jordan isotropic, Perez, and HDKR anisotropic models. A comprehensive simulation of the monthly solar irradiation throughout 2018 was executed for the city of Annaba, in north–eastern Algeria. The results indicate that the south-facing surface azimuth angle is the most appropriate. In fact, for maximum sunlight capture, the solar collector inclination must be adjusted each month in the range of [10–40°]. Furthermore, the results show that the gains in the amount of solar radiation received throughout the year by the thermal panel mounted at monthly optimum tilt angles are 15.63% in January and 7.37% in July.
Asynchronous Decentralized Learning over Unreliable Wireless Networks

Decentralized learning enables edge users to collaboratively train models by exchanging information via device-to-device communication, yet prior works have been limited to wireless networks with fixed topologies and reliable workers. In this work, we propose an asynchronous decentralized stochastic gradient descent (DSGD) algorithm, which is robust to the inherent computation and communication failures occurring at the wireless network edge. We theoretically analyze its performance and establish a non-asymptotic convergence guarantee. Experimental results corroborate our analysis, demonstrating the benefits of asynchronicity and outdated gradient information reuse in decentralized learning over unreliable wireless networks.
Design, Implementation, and Analysis of a Block Cipher Based on a Secure Chaotic Generator

This work proposes a new secure chaos-based encryption/decryption system, operating in cipher block chaining (CBC) mode, and analyze its performance. The cryptosystem includes a robust pseudorandom number generator of chaotic sequences (PRNG-CS). A strong chaos-based S-box is proposed to perform a circular substitution operation (confusion process). This PRNG-CS consists of four discrete 1-D chaotic maps, weakly coupled by a predefined coupling matrix M, to avoid, on the one hand, the divide-and-conquer attack and, on the other hand, to improve the generated sequence’s randomness and lengths. The noun is also used in the construction of the S-box. Moreover, a 2-D modified cat map and a horizontal addition diffusion (HAD) preceded by a vertical addition diffusion (VAD) are introduced to perform the diffusion process. The security analysis and numerous simulation results of the main components (PRNG-CS and S-box) as well as the whole cryptosystem reveal that the proposed chaos-based cryptosystem holds up against various types of statistical and cryptographic attacks.
An Efficient Supervised Deep Hashing Method for Image Retrieval

In recent years, searching and retrieving relevant images from large databases has become an emerging challenge for the researcher. Hashing methods that mapped raw data into a short binary code have attracted increasing attention from the researcher. Most existing hashing approaches map samples to a binary vector via a single linear projection, which restricts the flexibility of those methods and leads to optimization problems. We introduce a CNN-based hashing method that uses multiple nonlinear projections to produce additional short-bit binary code to tackle this issue. Further, an end-to-end hashing system is accomplished using a convolutional neural network. Also, we design a loss function that aims to maintain the similarity between images and minimize the quantization error by providing a uniform distribution of the hash bits to illustrate the proposed technique's effectiveness and significance. Extensive experiments conducted on various datasets demonstrate the superiority of the proposed method in comparison with state-of-the-art deep hashing methods.
An Optimized Discrete Dragonfly Algorithm Tackling the Low Exploitation Problem for Solving TSP

Optimization problems are prevalent in almost all areas and hence optimization algorithms are crucial for a myriad of real-world applications. Deterministic optimization algorithms tend to be computationally costly and time-consuming. Hence, heuristic and metaheuristic algorithms are more favoured as they provide near-optimal solutions in an acceptable amount of time. Swarm intelligence algorithms are being increasingly used for optimization problems owing to their simplicity and good performance. The Dragonfly Algorithm (DA) is one which is inspired by the swarming behaviours of dragonflies, and it has been proven to have a superior performance than other algorithms in multiple applications. Hence, it is worth considering its application to the traveling salesman problem which is a predominant discrete optimization problem. The original DA is only suitable for solving continuous optimization problems and, although there is a binary version of the algorithm, it is not easily adapted for solving discrete optimization problems like TSP. We have previously proposed a discrete adapted DA algorithm suitable for TSP. However, it has low effectiveness, and it has not been used for large TSP problems. In this paper, we propose an optimized discrete adapted DA by using the steepest ascent hill climbing algorithm as a local search. The algorithm is applied to a TSP problem modelling a package delivery system in the Kuala Lumpur area and to benchmark TSP problems, and it is found to have a higher effectiveness than the discrete adapted DA and some other swarm intelligence algorithms. It also has a higher efficiency than the discrete adapted DA.
Fine-Grained Fragment Diffusion for Cross Domain Crowd Counting

Deep learning improves the performance of crowd counting, but model migration remains a tricky challenge. Due to the reliance on training data and inherent domain shift, model application to unseen scenarios is tough. To facilitate the problem, this paper proposes a cross-domain Fine-Grained Fragment Diffusion model (FGFD) that explores feature-level fine-grained similarities of crowd distributions between different fragments to bridge the cross-domain gap (content-level coarse-grained dissimilarities). Specifically, we obtain features of fragments in both source and target domains, and then perform the alignment of the crowd distribution across different domains. With the assistance of the diffusion of crowd distribution, it is able to label unseen domain fragments and make source domain close to target domain, which is fed back to the model to reduce the domain discrepancy. By monitoring the distribution alignment, the distribution perception model is updated, then the performance of distribution alignment is improved. During the model inference, the gap between different domains is gradually alleviated. Multiple sets of migration experiments show that the proposed method achieves competitive results with other state-of-the-art domain-transfer methods.
Robust Low-Rank Convolution Network for Image Denoising

Convolutional Neural Networks (CNNs) are powerful for image representation, but the convolution operation may be influenced and degraded by the included noise, and the deep features may not be fully learned. In this paper, we propose a new encoder-decoder based image restoration network, termed Robust Low-Rank Convolution Network with Feature Denoising (LRCnet). LRCnet presents a novel low-rank convolution (LR-Conv) for image representation, and a residual dense connection (RDC) for feature fusion between encoding and decoding. Different from directly splitting convolution into ordinary convolution and mirror convolution as existing work, LR-Conv deploys a feature denoising module after the ordinary convolution to remove noise for mirror convolution. A low-rank embedding process is then used to project the convolutional features into a robust low-rank subspace, which can retain the local geometry of input signal to some extent and separate the signal and noise by finding low-rank structure of features to reduce the impact of noise on convolution. Besides, most networks increase the depth of network simply to obtain deep information and lack of effective connections to fuse the multilevel features, which may not fully discover the deep features in various layers. Thus, we design a residual dense connection with a channel attention to connect multilevel feature effectively to obtain more useful information to enhance the data representation. Extensive experiments on several datasets verified the effectiveness of LRCnet for image denoising.
Immersive virtual reality and passive haptic interfaces to improve procedural learning in a formal training course for first responders

Abstract One key aspect for the safety and success of first responders’ operations is the compliance, during the intervention, with all the safety procedures and prescribed behaviors. Although real-world simulation exercises are considered as the best way to verify if operators are ready to handle emergency situations, they are not always a viable approach. Firefighting courses, for example, do not usually include this kind of activities, due to the numerous hazards related to deploying controlled fires for the simulation. However, traditional training approaches based on class lessons and multimedia learning material may not be particularly effective for teaching practical skills and procedural behaviors. In this work, the use of a Virtual Reality Training Simulation (VRTS) combined with passive haptic interfaces and a real-time fire simulation logic is investigated as a complement to a traditional video-based training approach used in the context of forest firefighting. The teaching of safety concepts and correct use of individual firefighting tools was selected as a use case, and a user study involving 45 trainees was carried out in the context of an existing training course. One third of the trainees attended the traditional video-based lessons of the course, whereas the remaining ones also took part to a practice training session, half of them with the devised VRTS, the others in the real world. Experimental results showed that the additional use of the devised VRTS improved the trainees’ procedural learning, as well as their motivation and perceived quality of the overall learning experience.
Multi-party semi-quantum key distribution protocol based on hyperentangled Bell states

Semi-quantum key distribution allows generating a raw key between two communication participants, in which the sender is a quantum participant and the receiver is a classical participant. This article presents an original semi-quantum key distribution protocol based on hyperentangled Bell states. The hyperentangled Bell states can be entangled simultaneously in polarization and spatial degrees of freedom, enhancing channel capacity. According to the characteristics of hyperentangled Bell states, the proposed protocol is more efficient than the protocol based on Bell states. Moreover, the measure–resend attack, the intercept–resend attack, and the entangle–measure attack are analyzed in detail. The security analysis demonstrates that the proposed protocol is secure. In addition, a multi-party semi-quantum key distribution scheme based on hyperentangled Bell states is proposed, which can realize key distribution between one quantum participant and multiple classical participants.
Deep Neural Network for Accurate Age Group Prediction through Pupil Using the Optimized UNet Model

Predicting age automatically from the image is a difficult task and shortening the challenge to be more concise is also a challenging task. Nevertheless, the existing implementations using manually designed features using a wide variety of input features using benchmark datasets are unsatisfactory as they suffer from unknown subject information. It is challenging to judge CNN’s performance using such approaches. The proposed system performs the segmentation through UNet without using a dense layer to perform the segmentation and classification. The proposed system uses the skip connection to hold the loss at the max-pooling layer. Also, the morphological processing and probabilistic classification served as the proposed system’s novelty. The proposed method used three benchmark datasets, MMU, CASIA, and UBIRIS, to experiment with building a training model and tested using various optimization techniques to perform an accurate segmentation. To further test and improve the quality of the proposed method, we experimented with random images. The proposed system’s accuracy is 96% when experimented on random images of subjects collected purely for experimentation. Three optimizers, namely, Stochastic Gradient Descent, RMS Prop, and Adaptive Moment Optimizer, were experimented with in the proposed system to fit the system. The average accuracy we received using optimizers is 71.9, 84.3, and 96.0 for the loss value of 2.36, 2.30, and 1.82, respectively.
[Spatial Differentiation and Influencing Factor Analysis of Soil Heavy Metal Content at Town Level Based on Geographic Detector].

Geographic detectors can quickly detect spatial stratified heterogeneity and quantitatively reveal the intensity of driving factors of heavy metal content, which is of great significance for the prevention, control, and remediation of soil heavy metal pollution. In order to reveal the spatial differentiation and influencing factors of soil heavy metal content on the town-scale, 788 topsoil samples were collected from a town in the hinterland of Chengdu Plain. Soil heavy metal (Cd, Hg, As, Cu, Pb, Cr, Zn, and Ni) pollution risk assessments were carried out by using the geo-accumulation index method. Additionally, based on the geographic detector model, 15 factors such as soil properties, topography, soil forming factors, and distance were taken as independent variables, and the contents of each heavy metal element were taken as dependent variables to explore the spatial differentiation and influencing factors of heavy metal content in soils. The results showed that:the average contents of Hg, As, Pb, Cr, Cu, Ni, and Zn in the study area were 1.06-1.93 times the background value of Chengdu, and the content of Cd was lower than the background value; among them, Hg reached the light pollution level, and the other seven heavy metals were at the non-pollution level. The spatial distribution of eight heavy metals was significantly different, the correlation among the elements was significant, and a significant correlation was found between most heavy meals with soil properties; however, the correlation with distance factor and topographic factor was relatively weak. The factor detection showed that TP, TK, pH, TOC, elevation, and distance from the railway had the most significant explanatory power for the heavy metal contents. Interaction detection showed that the interaction between soil properties and other factors was the dominant factor for the spatial variation in heavy metals, and elevation, distance from residential area, distance from railways, and distance from industrial areas were also important factors. Risk detection showed that Hg had the most significant difference in the subregion of elevation and distance from railway, whereas the other seven heavy metals had the most significant difference in the sub-regions of influencing factors of soil properties. The spatial distribution of heavy metals varied significantly in soil at the town-scale, which was closely related to soil properties, topography, and human activities in the study area.
Disentangling Past-Future Modeling in Sequential Recommendation via Dual Networks

Sequential recommendation (SR) plays an important role in personalized recommender systems because it captures dynamic and diverse preferences from users' real-time increasing behaviors. Unlike the standard autoregressive training strategy, future data (also available during training) has been used to facilitate model training as it provides richer signals about users' current interests and can be used to improve the recommendation quality. However, existing methods suffer from a severe training-inference gap, i.e., both past and future contexts are modeled by the same encoder when training, while only historical behaviors are available during inference. This discrepancy leads to potential performance degradation. To alleviate the training-inference gap, we propose a new framework DualRec, which achieves past-future disentanglement and past-future mutual enhancement by a novel dual network. Specifically, a dual network structure is exploited to model the past and future context separately.And a bi-directional knowledge transferring mechanism enhances the knowledge learnt by the dual network. Extensive experiments on four real-world datasets demonstrate the superiority of our approach over baseline methods. Besides, we demonstrate the compatibility of DualRec by instantiating using different backbones. Further empirical analysis verifies the high utility of modeling future contexts under our DualRec framework.
Leveraging Multiple Types of Domain Knowledge for Safe and Effective Drug Recommendation

Predicting drug combinations according to patients' electronic health records is an essential task in intelligent healthcare systems, which can assist clinicians in ordering safe and effective prescriptions. However, existing work either missed/underutilized the important information lying in the drug molecule structure in drug encoding or has insufficient control over Drug-Drug Interactions (DDIs) rates within the predictions. To address these limitations, we propose CSEDrug, which enhances the drug encoding and DDIs controlling by leveraging multi-faceted drug knowledge, including molecule structures of drugs, Synergistic DDIs (SDDIs), and Antagonistic DDIs (ADDIs). We integrate these types of knowledge into CSEDrug by a graph-based drug encoder and multiple loss functions, including a novel triplet learning loss and a comprehensive DDI controllable loss. We evaluate the performance of CSEDrug in terms of accuracy, effectiveness, and safety on the public MIMIC-III dataset. The experimental results demonstrate that CSEDrug outperforms several state-of-the-art methods and achieves a 2.93% and a 2.77% increase in the Jaccard similarity scores and F1 scores, meanwhile, a 0.68% reduction of the ADDI rate (safer drug combinations), and 0.69% improvement of the SDDI rate (more effective drug combinations).
Partial Least Squares-Discriminant Analysis of the Major and Trace Elements and their Evolutionary Characteristics from the Jinchuan Ni-Cu-(PGE) Sulfide Deposit, NW China

The world-renowned Jinchuan Cu-Ni-(PGE) sulfide deposit consists of four mainly independent intrusive units from west to east, namely Segments III, I, II-W, and II-E, and the main sulfide types are the disseminated, net-textured, massive, and Cu-rich ores. Due to the similar geochemical characteristics of each segment, there is no convenient method to distinguish them and explain their respective variations. Meanwhile, considering that the division of different types of ores is confusing and their formation is still controversial, direct classification using elemental discrimination maps can facilitate subsequent mining and research. In this paper, we report the new major and trace elements data from the Jinchuan deposit and collect the published data to construct a database of 10 major elements for 434 samples and 33 trace elements for 370 samples, respectively, and analyze the data based on multivariate statistical analysis for the first time. Robust estimation of compositional data (robCompositions) was applied to investigate censored geochemical data, and the input censored data were transformed using the centered log-ratios (clr) to overcome the closure effect on compositional data. Exploratory data analysis (EDA) was used to characterize the spatial distribution and internal structural features of the data. The transformed data were classified by partial least squares-discriminant analysis (PLS-DA) to identify different compositional features for each segment and ore type. The receiver operator characteristic (ROC) curve was used to verify the model results, which showed that the PLS-DA model we constructed was reliable. The main discriminant elements were obtained by PLS-DA of the major and trace elements, and based on these elements, we propose the plot of SiO2 + Al2O3 vs. CaO + Na2O + K2O and Cs + Ce vs. Th + U to discriminate the different segments of the Jinchuan deposit, and the Al2O3 + CaO vs. Fe2O3T + Na2O and Co + Cu vs. Rb + Th + U to discriminate the different ore types. In addition, we predict that there are still considerable metal reserves at the bottom of Segment I.
Improved Iterative Quantum Algorithm for Ground‐State Preparation

Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point is to optimize a cost function on the state space via the quantum gradient descent (QGD) implemented on quantum devices. We provide practical guideline on the selection of the learning rate in QGD by finding a fundamental upper bound and establishing a relationship between our algorithm and the first-order approximation of the imaginary time evolution. Furthermore, we adapt a variational quantum state preparation method as a subroutine to generate an ancillary state by utilizing only polylogarithmic quantum resources. The performance of our algorithm is demonstrated by numerical calculations of the deuteron molecule and Heisenberg model without and with noises. Compared with the existing algorithms, our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
Cloud-based blockchain technology to identify counterfeits

Abstract Multi-stakeholder and organizational involvement is an integral part of the medicine supply chain. Keeping track of the activities associated with medical products is difficult when the system is complex. Their complexity limits transparency and data provenance. Deficiencies within existing supply chains result in the counterfeiting of drugs, illegal imports, and inefficient operations. Due to these limitations, product integrity is compromised, resulting in product wastage. Visibility of the entire product supply chain is crucial for the pharmaceutical industry in terms of product safety and reduction of manufacturing costs. The Cloud-based Blockchain-powered architecture of the system provides a platform for addressing the need of pharma-material traceability, data storage, privacy of data, and quality assurance. This framework comprises of the identification of activities through tagging, information sharing in a secure environment; cloud-based storage using an off-chain Interplanetary File System (IPFS) and an on-chain couch DB; and access to this information that is controlled by the system's regulator. Electronic drug records will be accessed via a smart contract in Hyperledger Blockchain. The system assists in identifying false and cross-border products through the manufacturer and country of origin. A scan will identify counterfeit medications, showing that they are unauthorized products which may pose a risk to patients. Our experiments demonstrated the efficiency and usability of the design platform. Finally, we benchmarked the system using Hyperledger Caliper.