Reviewerly/exHarmony huggingface dataset:
On Improved 3D-CNN-Based Binary and Multiclass Classification of Alzheimer’s Disease Using Neuroimaging Modalities and Data Augmentation Methods

Alzheimer's disease (AD) is an irreversible illness of the brain impacting the functional and daily activities of elderly population worldwide. Neuroimaging sensory systems such as Magnetic Resonance Imaging (MRI) and Positron Emission Tomography (PET) measure the pathological changes in the brain associated with this disorder especially in its early stages. Deep learning (DL) architectures such as Convolutional Neural Networks (CNNs) are successfully used in recognition, classification, segmentation, detection, and other domains for data interpretation. Data augmentation schemes work alongside DL techniques and may impact the final task performance positively or negatively. In this work, we have studied and compared the impact of three data augmentation techniques on the final performances of CNN architectures in the 3D domain for the early diagnosis of AD. We have studied both binary and multiclass classification problems using MRI and PET neuroimaging modalities. We have found the performance of random zoomed in/out augmentation to be the best among all the augmentation methods. It is also observed that combining different augmentation methods may result in deteriorating performances on the classification tasks. Furthermore, we have seen that architecture engineering has less impact on the final classification performance in comparison to the data manipulation schemes. We have also observed that deeper architectures may not provide performance advantages in comparison to their shallower counterparts. We have further observed that these augmentation schemes do not alleviate the class imbalance issue.
Multi-step solar irradiation prediction based on weather forecast and generative deep learning model

With the rapid development of computer technology, more and more deep learning models are used in solar radiation (irradiation) prediction. There have been a lot of studies discussing the research of this type of model. However, how to better apply the deep learning model in the optimization method of building energy system, such as multi-step solar radiation (irradiation) prediction model in model predictive control (MPC), is still a challenging issue due to the complexity of the time series and the accumulation of errors in multi-step forecasts. In this research, a deep generative model based on LSTM is developed for multi-step solar irradiation prediction at least 24 h in the future. Measured data and temperature forecast data from the Tokyo Meteorological Agency were used for training and testing in this experiment. The results show that generating the model first can effectively avoid the problem of error accumulation. The generative model can produce an accuracy improvement of 7.7 % against traditional regression LSTM model. Secondly, the introduction of the temperature forecast data from the previous one day can increase the forecast accuracy by about 18% points. When the earlier temperature forecast is used, the forecast accuracy will gradually decrease, and the use of the temperature forecast released 3 days before can hardly improve the forecast effect. In the end, using hourly temperature forecasts will result in better forecast accuracy than using daily temperature forecasts.
Head pose estimation: An extensive survey on recent techniques and applications

Biometric based systems are involved in many areas, from surveillance to user authentication, from autonomous systems to human-robot interactions. Head pose estimation (HPE) is the task to support biometric systems in which any of the biometric traits of the head is involved, as face, ear or iris. This particular biometric branch finds its application in driver attention detection, surveillance for recognition, face frontalization, best frame selection and so on. The goal of HPE is to determine the head pose orientation (yaw, pitch, roll). The implemented methods use different techniques depending on the kind of input. In this survey we present an overview of involved datasets, recent techniques and applications. We evaluate and compare the different approaches with respect to their advantages and practical usage. In addition, we propose a technical comparison between training and training-free techniques for the most popular HPE methods.
A motivational model‐based virtual reality approach to prompting learners' sense of presence, learning achievements, and higher‐order thinking in professional safety training

Abstract Increasing learners' sense of presence is important in professional training, in particular, when aiming to foster their competences of making judgements and solving problems when facing real cases. However, in conventional training programmes, sometimes it is difficult to situate learners in real cases owing to several considerations, such as cost and potential danger. Scholars have indicated that the lack of opportunities to experience real contexts could seriously affect the training outcomes. To cope with this problem, the present study proposes a spherical video‐based virtual reality (SVVR)‐based professional training (SVVR‐PT) approach based on the attention, relevance, confidence and satisfaction (ARCS) model to situate learners in an authentic training environment to experience the process of solving practical cases before facing real cases. To evaluate the effectiveness of the approach, a true experiment was conducted in a hospital by randomly assigning 70 nurses to an experimental group learning with the SVVR‐PT approach and a control group learning with the conventional training approach. The experimental results show that the proposed approach outperformed the conventional approach in terms of promoting the learners' sense of presence and learning achievement as well as their problem‐solving tendency and critical‐thinking awareness. Moreover, the SVVR‐PT learners also showed higher technology acceptance than the conventional training group. Practitioner notes What is already known about this topic? Spherical video‐based virtual reality (SVVR) immerses learners in an authentic environment that enables them to have more opportunities to experiment and practice. Attention, relevance, confidence and satisfaction model has great potential in promoting learners' motivation and engagement. What this paper adds? A motivational model‐based virtual reality approach is proposed to facilitate learners' professional training performance. In addition to promoting learners' training performance, the results claimed that the proposed approach could promote students' sense of presence, problem‐solving tendency and critical‐thinking awareness. Implications for practice and/or policy It is potentially worth using the motivational model‐based virtual reality approach in professional training to facilitate learners' performances and perceptions. The proposed approach can further analyze and compare the effects of the cooperative learning strategy on learners' performance and recorded learning process.
Time Masking for Temporal Language Models

Our world is constantly evolving, and so is the content on the web. Consequently, our languages, often said to mirror the world, are dynamic in nature. However, most current contextual language models are static and cannot adapt to changes over time. In this work, we propose a temporal contextual language model called TempoBERT, which uses time as an additional context of texts. Our technique is based on modifying texts with temporal information and performing time masking - specific masking for the supplementary time information. We leverage our approach for the tasks of semantic change detection and sentence time prediction, experimenting on diverse datasets in terms of time, size, genre, and language. Our extensive evaluation shows that both tasks benefit from exploiting time masking.
Grasshopper Optimization Algorithm With Crossover Operators for Feature Selection and Solving Engineering Problems

Feature selection (FS) is an irreplaceable phase that makes data mining more efficient. It effectively enhances the implementation and decreases the computational problem of learning models. The comprehensive and greedy algorithms are not suitable for the present growing number of features when detecting the optimal subset. Thus, swarm intelligence algorithms (SI) are becoming more common in dealing with FS problems. The grasshopper optimizer algorithm (GOA) represents a new SI; it showed good performance in different fields. Another promising nature-inspired algorithm is a salp swarm algorithm, denoted as SSA, an SI used to tackle optimization issues. In this paper, two phases are applied to propose a new method using crossover-salp swarm with grasshopper optimization algorithm (cSG). In this method, the crossover operators are used to maintain the population of the SSA then the improved SSA is used as a local search to boost the exploration phase of the GOA. Subsequently, this improvement prevents the cSG from premature convergence, high computation time, and being trapped in local minimum. To confirm the effectiveness of proposed cSG method, it is evaluated in different optimizations problems. Eventually, the obtained results are compared to a number of well-known algorithms over global optimization, feature selection datasets, and six real-engineering problems. Experimental results point out that the cSG is superior in solving different optimization problems due to the integration of crossover operators and SSA which enhances its performance and flexibility.
A novel cryptosystem based on DNA cryptography, hyperchaotic systems and a randomly generated Moore machine for cyber physical systems

Nowadays, a large amount of data is transmitted over the Internet and in Cyber–Physical Systems (CPS). A significant portion of this data is highly confidential. Bank account details, credit card details, One Time Passwords (OTP), financial data and other sensitive information are some examples of highly confidential data. A secure encryption and decryption technique is needed to ensure the secure transmission of data. These techniques use a secret key and guarantee that confidential data is only accessible to authorized individuals. This paper proposes a novel encryption process based on Deoxyribonucleic Acid (DNA) cryptography, a hyperchaotic system and a Moore machine. The hyperchaotic system generates four pseudo-random number sequences used in DNA-based operations. The Moore machine performs substitutions in the DNA sequence that makes the system more secure. The proposed technique can protect a system from various attacks, namely man-in-the-middle attacks, ciphertext-only attacks, known-plaintext attacks, brute force attacks and differential cryptanalysis attacks. The proposed scheme gives an average avalanche effect of 54.75%, which guarantees a high level of robustness. Moreover, experimental results show that the proposed scheme is more secure and efficient than the existing schemes.
An Approximated Gradient Sign Method Using Differential Evolution for Black-Box Adversarial Attack

Recent studies show that deep neural networks are vulnerable to adversarial attacks in the form of subtle perturbations to the input image, which leads the model to output wrong prediction. Such an attack can easily succeed by the existing white-box attack methods, where the perturbation is calculated based on the gradient of the target network. Unfortunately, the gradient is often unavailable in the real-world scenarios, which makes the black-box adversarial attack problems practical and challenging. In fact, they can be formulated as high-dimensional black-box optimization problems at the pixel level. Although evolutionary algorithms are well known for solving black-box optimization problems, they cannot efficiently deal with the high-dimensional decision space. Therefore, we propose an approximated gradient sign method using differential evolution (DE) for solving black-box adversarial attack problems. Unlike most existing methods, it is novel that the proposed method searches the gradient sign rather than the perturbation by a DE algorithm. Also, we transform the pixel-based decision space into a dimension-reduced decision space by combining the pixel differences from the input image to neighbor images, and two different techniques for selecting neighbor images are introduced to build the transferred decision space. In addition, six variants of the proposed method are designed according to the different neighborhood selection and optimization search strategies. Finally, the performance of the proposed method is compared with a number of the state-of-the-art adversarial attack algorithms on CIFAR-10 and ImageNet datasets. The experimental results suggest that the proposed method shows superior performance for solving black-box adversarial attack problems, especially nontargeted attack problems.
Sine Resistance Network-Based Motion Planning Approach for Autonomous Electric Vehicles in Dynamic Environments

This article proposes a motion planning approach for autonomous electric vehicles to generate an appropriate planned path according to the time-varying surrounding information. This approach utilizes the proposed novel sine resistance network to mesh the road with the aim of improving the planned path smoothness, which has the capability of generating a continuous-curvature planned path that contributes to tracking and reducing the jerkiness. Meanwhile, considering that the classical artificial potential field (APF) method is only suitable for the static scenarios, a bias oval APF is constructed to predict the change of relative distance between the ego vehicle and each obstacle by taking the speed information into account. The proposed planning approach can ensure that the planned path is collision-free in dynamic environments and the generated path is smooth simultaneously. Cosimulation results in CarSim and MATLAB/Simulink are provided to prove the advantage and feasibility of the proposed motion planning approach for autonomous electric vehicles.
EAGCN: An Efficient Adaptive Graph Convolutional Network for Item Recommendation in Social Internet of Things

In the era of Internet of Things (IoT), intelligent recommendation is playing an important role in our daily life. How to provide personalized information to users is the core concern of Internet content service providers. To improve the recommendation quality, it is a hot topic to go beyond merely user–item interaction records and take social relations into account in IoT. Recently, emerged graph neural networks (GNNs) shine a light on simulating the recursive social diffusion process, to refine user embedding learning. Nevertheless, two key issues have not been well studied in previous studies: 1) they usually model user preference and social influence within a same semantic space and fail to simultaneously inject high-order connectivity information reflected in both user–item interaction graph and user–user social graph and 2) they typically rely on negative sampling to optimize a recommendation model, which makes them highly sensitive to the design of the sampler and hardly makes full use of GPU’s computing ability. In light of this, we propose a novel framework for item recommendation, namely, an efficient adaptive graph convolutional network (EAGCN). Specifically, we introduce a space-adaptive graph convolutional module, which could jointly explore the propagation process of user interest and social influence. Furthermore, a user-specific gating mechanism is designed to aggregate user representations from both spaces. To make EAGCN practical in social IoT, we devise a fast nonsampling leaner to optimize EAGCN’s parameters with better leveraging matrix computing of GPU. Extensive experiments under four scenarios show that our solution consistently and significantly outperforms strong baseline methods in both model effectiveness and training efficiency.
PIFHC: The Probabilistic Intuitionistic Fuzzy Hierarchical Clustering Algorithm

Hierarchical clustering techniques help in building a tree-like structure called dendrogram from the data points which can be used to find the closest related data objects. This paper presents a novel hierarchical clustering technique which considers intuitionistic fuzzy sets to deal with the uncertainty present in the data. Instead of using traditional hamming distance or Euclidean distance measure to find the distance between the data points, it employs the probabilistic Euclidean distance measure to propose a novel clustering approach which we term as ‘Probabilistic Intuitionistic Fuzzy Hierarchical Clustering (PIFHC) Algorithm’. The proposed PIFHC algorithm considers probabilistic weights from the data to measure the distances between the data points. Clustering results over UCI datasets show that our proposed PIFHC algorithm gives better cluster accuracies than its existing counterparts. PIFHC efficiently provides improvements of 1%–3.5% in the clustering accuracy compared to other fuzzy hierarchical clustering algorithms for most of the datasets. We further provide experimental results with the real-world car dataset and the Listeria monocytogenes dataset for mouse susceptibility to demonstrate the practical efficacy of the proposed algorithm. For Listeria datasets as well, proposed PIFHC records 1.7% improvement against the state-of-the-art methods The dendrograms formed by the proposed PIFHC algorithm exhibits high cophenetic correlation coefficient with an improvement of 0.75% over others. We provide various AGNES methods to update the distance between merged clusters in the proposed PIFHC algorithm.
Leaving No One Behind: A Multi-Scenario Multi-Task Meta Learning Approach for Advertiser Modeling

Advertisers play an essential role in many e-commerce platforms like Taobao and Amazon. Fulfilling their marketing needs and supporting their business growth is critical to the long-term prosperity of platform economies. However, compared with extensive studies on user modeling such as click-through rate predictions, much less attention has been drawn to advertisers, especially in terms of understanding their diverse demands and performance. Different from user modeling, advertiser modeling generally involves many kinds of tasks (e.g. predictions of advertisers' expenditure, active-rate, or total impressions of promoted products). In addition, major e-commerce platforms often provide multiple marketing scenarios (e.g. Sponsored Search, Display Ads, Live Streaming Ads) while advertisers' behavior tend to be dispersed among many of them. This raises the necessity of multi-task and multi-scenario consideration in comprehensive advertiser modeling, which faces the following challenges: First, one model per scenario or per task simply doesn't scale; Second, it is particularly hard to model new or minor scenarios with limited data samples; Third, inter-scenario correlations are complicated, and may vary given different tasks.
A PSO Algorithm Based Task Scheduling in Cloud Computing

Cloud computing is an emerging technology which involves the allocation and de-allocation of the computing resources using the internet. Task scheduling (TS) is one of the fundamental issues in cloud computing and effort has been made to solve this problem. An efficient task scheduling mechanism is always needed for the allocation to the available processing machines in such a manner that no machine is over or under-utilized. Scheduling tasks belongs to the category of NP-hard problem. Through this article, the authors are proposing a particle swarm optimization (PSO) based task scheduling mechanism for the efficient scheduling of tasks among the virtual machines (VMs). The proposed algorithm is compared using the CloudSim simulator with the existing greedy and genetic algorithm-based task scheduling mechanism. The simulation results clearly show that the PSO-based task scheduling mechanism clearly outperforms the others as it results in almost 30% reduction in makespan and increases the resource utilization by 20%.
Where to Hide a Stolen Elephant: Leaps in Creative Writing with Multimodal Machine Intelligence

While developing a story, novices and published writers alike have had to look outside themselves for inspiration. Language models have recently been able to generate text fluently, producing new stochastic narratives upon request. However, effectively integrating such capabilities with human cognitive faculties and creative processes remains challenging. We propose to investigate this integration with a multimodal writing support interface that offers writing suggestions textually, visually, and aurally. We conduct an extensive study that combines elicitation of prior expectations before writing, observation and semi-structured interviews during writing, and outcome evaluations after writing. Our results illustrate the individual and situational variation in machine-in-the-loop writing approaches, suggestion acceptance, and ways the system is helpful. Centrally, we report how participants perform integrative leaps , by which they do cognitive work to integrate suggestions of varying semantic relevance into their developing stories. We interpret these findings, offering modeling and design recommendations for future creative writing support technologies.
Resonant Tunneling Diode Nano-Optoelectronic Excitable Nodes for Neuromorphic Spike-Based Information Processing

In this work, we introduce an interconnected nano-optoelectronic spiking artificial neuron emitter-receiver system capable of operating at ultrafast rates (about $100\phantom{\rule{0.2em}{0ex}}\mathrm{ps}/$optical spike) and with low-energy consumption ( pJ/spike). The proposed system combines an excitable resonant tunneling diode (RTD) element exhibiting negative differential conductance, coupled to a nanoscale light source (forming a master node) or a photodetector (forming a receiver node). We study numerically the spiking dynamical responses and information propagation functionality of an interconnected master-receiver RTD node system. Using the key functionality of pulse thresholding and integration, we utilize a single node to classify sequential pulse patterns and perform convolutional functionality for image feature (edge) recognition. We also demonstrate an optically interconnected spiking neural network model for processing of spatiotemporal data at over 10 Gbit/s with high inference accuracy. Finally, we demonstrate an off-chip supervised learning approach utilizing spike-timing-dependent plasticity for the RTD-enabled photonic spiking neural network. These results demonstrate the potential and viability of RTD spiking nodes for low footprint, low-energy, high-speed optoelectronic realization of spike-based neuromorphic hardware.
Learning Unsupervised Metaformer for Anomaly Detection

Anomaly detection (AD) aims to address the task of classification or localization of image anomalies. This paper addresses two pivotal issues of reconstruction-based approaches to AD in images, namely, model adaptation and reconstruction gap. The former generalizes an AD model to tackling a broad range of object categories, while the latter provides useful clues for localizing abnormal regions. At the core of our method is an unsupervised universal model, termed as Metaformer, which leverages both meta-learned model parameters to achieve high model adaptation capability and instance-aware attention to emphasize the focal regions for localizing abnormal regions, i.e., to explore the reconstruction gap at those regions of interest. We justify the effectiveness of our method with SOTA results on the MVTec AD dataset of industrial images and highlight the adaptation flexibility of the universal Metaformer with multi-class and few-shot scenarios.