Reviewerly/exHarmony huggingface dataset:
Implementable hybrid quantum ant colony optimization algorithm

Abstract We propose a new hybrid quantum algorithm based on the classical Ant Colony Optimization algorithm to produce approximate solutions for NP-hard problems, in particular optimization problems. First, we discuss some previously proposed Quantum Ant Colony Optimization algorithms, and based on them, we develop an improved algorithm that can be truly implemented on near-term quantum computers. Our iterative algorithm codifies only the information about the pheromones and the exploration parameter in the quantum state, while subrogating the calculation of the numerical result to a classical computer. A new guided exploration strategy is used in order to take advantage of the quantum computation power and generate new possible solutions as a superposition of states. This approach is specially useful to solve constrained optimization problems, where we can implement efficiently the exploration of new paths without having to check the correspondence of a path to a solution before the measurement of the state. As an example of a NP-hard problem, we choose to solve the Quadratic Assignment Problem. The benchmarks made by simulating the noiseless quantum circuit and the experiments made on IBM quantum computers show the validity of the algorithm.
Metamodeling for Policy Simulations with Multivariate Outcomes

Metamodels are simplified approximations of more complex models that can be used as surrogates for the original models. Challenges in using metamodels for policy analysis arise when there are multiple correlated outputs of interest. We develop a framework for metamodeling with policy simulations to accommodate multivariate outcomes.We combine 2 algorithm adaptation methods-multitarget stacking and regression chain with maximum correlation-with different base learners including linear regression (LR), elastic net (EE) with second-order terms, Gaussian process regression (GPR), random forests (RFs), and neural networks. We optimize integrated models using variable selection and hyperparameter tuning. We compare the accuracy, efficiency, and interpretability of different approaches. As an example application, we develop metamodels to emulate a microsimulation model of testing and treatment strategies for hepatitis C in correctional settings.Output variables from the simulation model were correlated (average ρ = 0.58). Without multioutput algorithm adaptation methods, in-sample fit (measured by R2) ranged from 0.881 for LR to 0.987 for GPR. The multioutput algorithm adaptation method increased R2 by an average 0.002 across base learners. Variable selection and hyperparameter tuning increased R2 by 0.009. Simpler models such as LR, EE, and RF required minimal training and prediction time. LR and EE had advantages in model interpretability, and we considered methods for improving the interpretability of other models.In our example application, the choice of base learner had the largest impact on R2; multioutput algorithm adaptation and variable selection and hyperparameter tuning had a modest impact. Although advantages and disadvantages of specific learning algorithms may vary across different modeling applications, our framework for metamodeling in policy analyses with multivariate outcomes has broad applicability to decision analysis in health and medicine.
NSDF-Cloud

Computational resources are increasingly provisioned to users through cloud-like interfaces. Both academic and commercial cloud offerings exist, but no single standardized interface for common actions such as configuration, launching, and termination of virtual resources exists. This imposes huge technical burden on domain scientist that attempt to take advantage of these resources; even expert users spend considerable time to port their applications from one cloud platform to another.
Industry 4.0: Driving the Digital Transformation in Banking Sector

Industry 4.0 or Digital Revolution is changing the way we live, changing associations with customers and organizations, which unavoidably infer that both existing business techniques and monetary administrations are not excluded from this change. In the monetary world, accelerated digitalization has made banks genuinely re-examine standard strategies, which suggests that they need to respond quickly and gainfully to the solicitations of their clients while offering secured and direct organizations for use. Security and trust are at this point key determinants, and banks have made innovative monetary organizations and things over the span of ongoing years, including got structures that constantly guarantee the data and money of clients. Regardless, really like any cutting edge uprising, both Industry 4.0 and its impact on the difference in the monetary region pass on with themselves both positive and unfriendly after effects of this change. Digitalization of the monetary territory is in as far as possible, with the way that this connection also consolidates other fragment segments of Industry 4.0, for instance, blockchain networks, man-made cognizance, IoT, biometrics, cooperation of deals with a record with FinTech associations, plan of the stage, and various organizations for the Generation Z and other. In this paper, we investigate how expanded rivalry, new enactment, and every one of the progressions that accompanied digitalization, will influence the financial area in the impending time frame, will the financial area look fundamentally changed in the forthcoming years, and will, in spite of every single innovative change, human factor, trust, security actually be the key determinants.
Debiasing Learning for Membership Inference Attacks Against Recommender Systems

Learned recommender systems may inadvertently leak information about their training data, leading to privacy violations. We investigate privacy threats faced by recommender systems through the lens of membership inference. In such attacks, an adversary aims to infer whether a user's data is used to train the target recommender. To achieve this, previous work has used a shadow recommender to derive training data for the attack model, and then predicts the membership by calculating difference vectors between users' historical interactions and recommended items. State-of-the-art methods face two challenging problems: (i) training data for the attack model is biased due to the gap between shadow and target recommenders, and (ii) hidden states in recommenders are not observational, resulting in inaccurate estimations of difference vectors.
Proximal policy optimization-based committee selection algorithm in blockchain-enabled mobile edge computing systems

To cope with the low latency requirements and security issues of the emerging applications such as Internet of Vehicles (IoV) and Industrial Internet of Things (IIoT), the blockchain-enabled Mobile Edge Computing (MEC) system has received extensive attention. However, blockchain is a computing and communication intensive technology due to the complex consensus mechanisms. To facilitate the implementation of blockchain in the MEC system, this paper adopts the committee-based Practical Byzantine Fault Tolerance (PBFT) consensus algorithm and focuses on the committee selection problem. Vehicles and IIoT devices generate the transactions which are records of the application tasks. Base Stations (BSs) with MEC servers, which serve the transactions according to the wireless channel quality and the available computing resources, are blockchain nodes and candidates for committee members. The income of transaction service fees, the penalty of service delay, the decentralization of the blockchain and the communication complexity of the consensus process constitute the performance index. The committee selection problem is modeled as a Markov decision process, and the Proximal Policy Optimization (PPO) algorithm is adopted in the solution. Simulation results show that the proposed PPO-based committee selection algorithm can adapt to the system design requirements with different emphases and outperforms other comparison methods.
Adaptive windowing based recurrent neural network for drift adaption in non-stationary environment

In today’s digital era, many applications generate massive data streams that must be sequenced and processed immediately. Therefore, storing large amounts of data for analysis is impractical. Now, this infinite amount of evolving data confronts concept drifts in data stream classification. Concept drift is a phenomenon in which the distribution of input data or the relationship between input data and target label changes over time. If the drifts are not addressed, the learning model’s performance suffers. Non-stationary data streams must be processed as they arrive, and neural networks’ built-in capabilities aid in the processing of huge non-stationary data streams. We proposed an adaptive windowing approach based on a gated recurrent unit, a variant of the recurrent neural network incrementally trained on incoming data (for the real-world airline and synthetic Streaming Ensemble Algorithm (SEA) datasets), and employed elastic weight consolidation with the Fisher information matrix to prevent forgetting. Unlike the traditional fixed window methodology, the proposed model dynamically increases the window size if the prediction is correct and reduces it if drifts occur. As a result, an adaptive recurrent neural network model can adapt to changes in the non-stationary data stream and provide consistent performance. Moreover, the findings revealed that on the airline and the SEA dataset, the proposed model outperforms state-of-the-art methods by achieving 67.74% and 91.70% accuracy, respectively. Further, the results demonstrated that the proposed model has a better accuracy of 3.6% and 1.6% for the SEA and the airline dataset, respectively.
Interval Prediction of Building Foundation Settlement Using Kernel Extreme Learning Machine

Dynamic building foundation settlement subsidence threatens urban businesses and residential communities. In the temporal domain, building foundation settlement is often dynamic and requires real-time monitoring. Accurate quantification of the uncertainty of foundation settlement in the near future is essential to advanced risk management for buildings. Traditional models for predicting foundation settlement mostly utilize the point estimates approach, which provides a single value that can be close or distant from the actual one. However, such an estimation fails to quantify estimation uncertainties. The interval prediction, as an alternative, can provide a prediction interval for the ground settlement with high confidence bands. This study, proposes a lower upper bound estimation approach integrated with a kernel extreme learning machine to predict ground settlement levels with prediction intervals in the temporal domain. A revised objective function is proposed to further improve the interval prediction performance. In this study, the proposed method is compared to the artificial neural network and classical extreme learning machine. Building settlement data collected from Fuxing City, Liaoning Province in China was used to validate the proposed approach. The comparative results show that the proposed approach can construct superior prediction intervals for foundation settlement.
A structural characterization of shortcut features for prediction

With the rising use of machine learning for healthcare applications, practitioners are increasingly confronted with the limitations of prediction models that are trained in one setting but meant to be deployed in several others. One recently identified limitation is so-called shortcut learning, whereby a model learns to associate features with the prediction target that do not maintain their relationship across settings. Famously, the watermark on chest x-rays has been demonstrated to be an instance of a shortcut feature. In this viewpoint, we attempt to give a structural characterization of shortcut features in terms of causal DAGs. This is the first attempt at defining shortcut features in terms of their causal relationship with a model's prediction target.
The Effect of Using Data Pre-Processing by Imputations in Handling Missing Values

The evolution of big data analytics through machine learning and artificial intelligence techniques has caused organizations in a wide range of sectors including health, manufacturing, e-commerce, governance, and social welfare to realize the value of massive volumes of data accumulating on web-based repositories daily. This has led to the adoption of data-driven decision models; for example, through sentiment analysis in marketing where produces leverage customer feedback and reviews to develop customer-oriented products. However, the data generated in real-world activities is subject to errors resulting from inaccurate measurements or fault input devices, which may result in the loss of some values. Missing attribute/variable values make data unsuitable for decision analytics due to noises and inconsistencies that create bias. The objective of this paper was to explore the problem of missing data and develop an advanced imputation model based on Machine Learning and implemented on K-Nearest Neighbor (KNN) algorithm in R programming language as an approach to handle missing values. The methodology used in this paper relied on the applying advanced machine learning algorithms with high-level accuracy in pattern detection and predictive analytics on the existing imputation techniques, which handle missing values by random replacement or deletion.. According to the results, advanced imputation technique based on machine learning models replaced missing values from a dataset with 89.5% accuracy. The experimental results showed that pre-processing by imputation delivers high-level performance efficiency in handling missing data values. These findings are consistent with the key idea of paper, which is to explore alternative imputation techniques for handling missing values to improve the accuracy and reliability of decision insights extracted from datasets.
Unify Local and Global Information for Top-N Recommendation

Knowledge graph (KG), integrating complex information and containing rich semantics, is widely considered as side information to enhance the recommendation systems. However, most of the existing KG-based methods concentrate on encoding the structural information in the graph, without utilizing the collaborative signals in user-item interaction data, which are important for understanding user preferences. Therefore, the representations learned by these models are insufficient for representing semantic information of users and items in the recommendation environment. The combination of both kinds of data provides a good chance to solve this problem, but it faces the following challenges: i) the inner correlations in user-item interaction data are difficult to capture from one side of the user or item; ii) capturing the knowledge associations on the whole KG would introduce noises and variously influence the recommendation results; iii) the semantic gap between both kinds of data is hard to alleviate.
Self-Supervised Learning for Recommender System

Recommender systems have become key components for a wide spectrum of web applications (e.g., E-commerce sites, video sharing platforms, lifestyle applications, etc), so as to alleviate the information overload and suggest items for users. However, most existing recommendation models follow a supervised learning manner, which notably limits their representation ability with the ubiquitous sparse and noisy data in practical applications. Recently, self-supervised learning (SSL) has become a promising learning paradigm to distill informative knowledge from unlabeled data, without the heavy reliance on sufficient supervision signals. Inspired by the effectiveness of self-supervised learning, recent efforts bring SSL's superiority into various recommendation representation learning scenarios with augmented auxiliary learning tasks. In this tutorial, we aim to provide a systemic review of existing self-supervised learning frameworks and analyze the corresponding challenges for various recommendation scenarios, such as general collaborative filtering paradigm, social recommendation, sequential recommendation, and multi-behavior recommendation. We then raise discussions and future directions of this area. With the introduction of this emerging and promising topic, we expect the audience to have a deep understanding of this domain. We also seek to promote more ideas and discussions, which facilitates the development of self-supervised learning recommendation techniques.
Digital Distance Learning and the Transformation of Vocational Schools From a Qualitative Perspective

Digital distance learning has become one of the main modes of education at vocational schools during the COVID-19 pandemic. A large-scale survey with almost 4,000 stakeholders from 15 vocational schools in Germany was conducted to analyze the current state of digital distance learning, with the goal to identify the challenges teachers, students, school leaders, parents, and training companies face when digital distance learning processes are implemented. A total of N = 1,493 qualitative statements have been analyzed as part of the survey. The results of the deductive structuring content analysis suggest the influence of digital distance learning on eight categories within school development, namely teaching, feedback, organization, collaboration, personal resources, technical infrastructure, perceived learner success, and professionalization. The identification of challenges within these categories can help school leaders at vocational schools and policy makers to transform the experiences during the ad hoc implementation of digital distance practices into sustainable school development processes. The research work also proposes a transformation of existing theoretical frameworks of school development in the light of digitalization.
The Accuracy Comparison Between Word2Vec and FastText On Sentiment Analysis of Hotel Reviews

Word embedding vectorization is more efficient than Bag-of-Word in word vector size. Word embedding also overcomes the loss of information related to sentence context, word order, and semantic relationships between words in sentences. Several kinds of Word Embedding are often considered for sentiment analysis, such as Word2Vec and FastText. Fast Text works on N-Gram, while Word2Vec is based on the word. This research aims to compare the accuracy of the sentiment analysis model using Word2Vec and FastText. Both models are tested in the sentiment analysis of Indonesian hotel reviews using the dataset from TripAdvisor.Word2Vec and FastText use the Skip-gram model. Both methods use the same parameters: number of features, minimum word count, number of parallel threads, and the context window size. Those vectorizers are combined by ensemble learning: Random Forest, Extra Tree, and AdaBoost. The Decision Tree is used as a baseline for measuring the performance of both models. The results showed that both FastText and Word2Vec well-to-do increase accuracy on Random Forest and Extra Tree. FastText reached higher accuracy than Word2Vec when using Extra Tree and Random Forest as classifiers. FastText leverage accuracy 8% (baseline: Decision Tree 85%), it is proofed by the accuracy of 93%, with 100 estimators.&#x0D;
Time-to-Label: Temporal Consistency for Self-Supervised Monocular 3D Object Detection

Monocular 3D object detection continues to attract attention due to the cost benefits and wider availability of RGB cameras. Despite the recent advances and the ability to acquire data at scale, annotation cost and complexity still limit the size of 3D object detection datasets in the supervised settings. Self-supervised methods, on the other hand, aim at training deep networks relying on pretext tasks or various consistency constraints. Moreover, other 3D perception tasks (such as depth estimation) have shown the benefits of temporal priors as a self-supervision signal. In this work, we argue that the temporal consistency on the level of object poses, provides an important supervision signal given the strong prior on physical motion. Specifically, we propose a self-supervised loss which uses this consistency, in addition to render-and-compare losses, to refine noisy pose predictions and derive high-quality pseudo labels. To assess the effectiveness of the proposed method, we finetune a synthetically trained monocular 3D object detection model using the pseudo-labels that we generated on real data. Evaluation on the standard KITTI3D benchmark demonstrates that our method reaches competitive performance compared to other monocular self-supervised and supervised methods.
Hybrid Threats against Industry 4.0: Adversarial Training of Resilience

Industry 4.0 and Smart Manufacturing are associated with the Cyber-Physical-Social Systems populated and controlled by the Collective Intelligence (human and artificial). They are an important component of Critical Infrastructure and they are essential for the functioning of a society and economy. Hybrid Threats nowadays target critical infrastructure and particularly vulnerabilities associated with both human and artificial intelligence. This article summarizes some latest studies of WARN: “Academic Response to Hybrid Threats” (the Erasmus+ project), which aim for the resilience (regarding hybrid threats) of various Industry 4.0 architectures and, especially, of the human and artificial decision-making within Industry 4.0 processes. This study discovered certain analogy between (cognitive) resilience of human and artificial intelligence against cognitive hacks (special adversarial hybrid activity) and suggested the approaches to train the resilience with the special adversarial training techniques. The study also provides the recommendations for higher education institutions on adding such training and related courses to their various programs. The specifics of related courses would be as follows: their learning objectives and related intended learning outcomes are not an update of personal knowledge, skills, beliefs or values (traditional outcomes) but the robustness and resilience of the already available ones.
"You might think about slightly revising the title”: Identifying Hedges in Peer-tutoring Interactions

Hedges play an important role in the management of conversational interaction. In peer tutoring, they are notably used by tutors in dyads (pairs of interlocutors) experiencing low rapport to tone down the impact of instructions and negative feedback. Pursuing the objective of building a tutoring agent that manages rapport with students in order to improve learning, we used a multimodal peer-tutoring dataset to construct a computational framework for identifying hedges. We compared approaches relying on pre-trained resources with others that integrate insights from the social science literature. Our best performance involved a hybrid approach that outperforms the existing baseline while being easier to interpret. We employ a model explainability tool to explore the features that characterize hedges in peer-tutoring conversations, and we identify some novel features, and the benefits of such a hybrid model approach.
NAIST Simultaneous Speech-to-Text Translation System for IWSLT 2022

This paper describes NAIST's simultaneous speech translation systems developed for IWSLT 2022 Evaluation Campaign.We participated the speech-to-speech track for Englishto-German and English-to-Japanese.Our primary submissions were end-to-end systems using adaptive segmentation policies based on Prefix Alignment.