Reviewerly/exHarmony huggingface dataset:
The Impact of Branding in Building and Enhancing Customer Loyalty for Banking Services: an Applied Study of Commercial Bank Customers in Jordan

Purpose: The aim of this study is to examine the impact of branding in building and enhancing customer loyalty for banking services. Theoretical framework: branding dimensions are the first factors, which affect a customer’s opinion of the quality and features a particular product, including brand recognition, mental image, trust, satisfaction, market value, and perceived quality. A large number of studies indicate that customer loyalty influences brand value (Janghyeon &amp; Yuksel, 2011). Design/methodology/approach: The research reports on field study that operationalizes a theoretical framework to examine the impact of branding in building and enhancing customer loyalty for banking services. Findings: Evidence from the study indicates that the dimensions of branding have a statistically significant impact in building and enhancing customer loyalty for banking services in Jordan Research, Practical &amp; Social implications: the study suggests improving customer trust in their brand and banking services, because such trust is one of the most important dimensions that enhances customer satisfaction, and persuades them to have the desired level of loyalty for these services. Originality/value: The results indicate the role of the branding can build and enhance customer loyalty for banking services in commercial bank in Jordan.
Machine Learning Technique Predicting Video Streaming Views to Reduce Cost of Cloud Services

Video streams tremendously occupied the highest portion of the online traffic. Multiple versions of a video are created to fit the user's device specifications. In cloud storage, Keeping all versions of frequently accessed video streams in the repository for the long term imposes a significant cost paid by video streaming providers. Generally, the popularity of a video changes each period time, which means the number of views received by a video could be dropped, thus, the video must be deleted from the repository. Therefore, in this paper, we develop a method that predicts the popularity of each video stream in the repository in the next period. On the other hand, we propose an algorithm that utilizes the predicted popularity of a video to compute the storage cost, and then it decides whether the video will be kept or deleted from the cloud repository. The experiment results show a cost reduction of the cloud services by 15% compared to keeping all video streams.
Causal Recurrent Variational Autoencoder for Medical Time Series Generation

We propose causal recurrent variational autoencoder (CR-VAE), a novel generative model that is able to learn a Granger causal graph from a multivariate time series x and incorporates the underlying causal mechanism into its data generation process. Distinct to the classical recurrent VAEs, our CR-VAE uses a multi-head decoder, in which the p-th head is responsible for generating the p-th dimension of x (i.e., x^p). By imposing a sparsity-inducing penalty on the weights (of the decoder) and encouraging specific sets of weights to be zero, our CR-VAE learns a sparse adjacency matrix that encodes causal relations between all pairs of variables. Thanks to this causal matrix, our decoder strictly obeys the underlying principles of Granger causality, thereby making the data generating process transparent. We develop a two-stage approach to train the overall objective. Empirically, we evaluate the behavior of our model in synthetic data and two real-world human brain datasets involving, respectively, the electroencephalography (EEG) signals and the functional magnetic resonance imaging (fMRI) data. Our model consistently outperforms state-of-the-art time series generative models both qualitatively and quantitatively. Moreover, it also discovers a faithful causal graph with similar or improved accuracy over existing Granger causality-based causal inference methods. Code of CR-VAE is publicly available at https://github.com/hongmingli1995/CR-VAE.
Untargeted Attack against Federated Recommendation Systems via Poisonous Item Embeddings and the Defense

Federated recommendation (FedRec) can train personalized recommenders without collecting user data, but the decentralized nature makes it susceptible to poisoning attacks. Most previous studies focus on the targeted attack to promote certain items, while the untargeted attack that aims to degrade the overall performance of the FedRec system remains less explored. In fact, untargeted attacks can disrupt the user experience and bring severe ﬁnancial loss to the service provider. However, existing untargeted attack methods are either inapplicable or ineffective against FedRec systems. In this paper, we delve into the untargeted attack and its defense for FedRec systems. (i) We propose ClusterAttack, a novel untargeted attack method. It uploads poisonous gradients that converge the item embeddings into several dense clusters, which make the recommender generate similar scores for these items in the same cluster and perturb the ranking order. (ii) We propose a uniformity-based defense mechanism (UNION) to protect FedRec systems from such attacks. We design a contrastive learning task that regularizes the item embeddings toward a uniform distribution. Then the server ﬁlters out these malicious gradients by estimating the uniformity of updated item embeddings. Experiments on two public datasets show that ClusterAttack can effectively degrade the performance of FedRec systems while circumventing many defense methods, and UNION can improve the resistance of the system against various untargeted attacks, including our ClusterAttack.
Domain-General Crowd Counting in Unseen Scenarios

Domain shift across crowd data severely hinders crowd counting models to generalize to unseen scenarios. Although domain adaptive crowd counting approaches close this gap to a certain extent, they are still dependent on the target domain data to adapt (e.g. finetune) their models to the specific domain. In this paper, we instead target to train a model based on a single source domain which can generalize well on any unseen domain. This falls into the realm of domain generalization that remains unexplored in crowd counting. We first introduce a dynamic sub-domain division scheme which divides the source domain into multiple sub-domains such that we can initiate a meta-learning framework for domain generalization. The sub-domain division is dynamically refined during the meta-learning. Next, in order to disentangle domain-invariant information from domain-specific information in image features, we design the domain-invariant and -specific crowd memory modules to re-encode image features. Two types of losses, i.e. feature reconstruction and orthogonal losses, are devised to enable this disentanglement. Extensive experiments on several standard crowd counting benchmarks i.e. SHA, SHB, QNRF, and NWPU, show the strong generalizability of our method. Our code is available at: https://github.com/ZPDu/Domain-general-Crowd-Counting-in-Unseen-Scenarios
Demonstration of three- and four-body interactions between trapped-ion spins

Quantum processors use the native interactions between effective spins to simulate Hamiltonians or execute quantum gates. In most processors, the native interactions are pairwise, limiting the efficiency of controlling entanglement between many qubits. The capability of manipulating entanglement generated by higher-order interactions is a key challenge for the simulation of many Hamiltonian models appearing in various fields, including high-energy and nuclear physics, as well as quantum chemistry and error correction applications. Here we experimentally demonstrate control over a class of native interactions between trapped-ion qubits, extending conventional pairwise interactions to a higher order. By exploiting state-dependent squeezing operations, we realize and characterize high-fidelity gates and spin Hamiltonians comprising three- and four-body spin interactions. Our results demonstrate the potential of high-order spin interactions as a toolbox for quantum information applications. Generation of entanglement in quantum computers stems from the native interactions between qubits, which are usually restricted to the pairwise limit. A method to control three- and four-body interactions has now been demonstrated with trapped ions.
A new detection algorithm for alien intrusion on highway

In recent years, highway accidents occur frequently, the main reason is that there is always foreign body invasion on the highway, which makes people unable to respond to emergencies in time. In order to reduce the occurrence of highway incidents, an object detection algorithm for highway intrusion was proposed in this paper. Firstly, a new feature extraction module was proposed to better preserve the main information. Secondly, a new feature fusion method was proposed to improve the accuracy of object detection. Finally, a lightweight method was proposed to reduce the computational complexity. We compare the algorithm in this paper with existing algorithms, the experimental results showed that: On the Visdrone dataset (small size targets), (a) the CS-YOLO was 3.6% more accurate than the YOLO v8. (b) The CS-YOLO was 1.2% more accurate than the YOLO v8 on the Tinypersons dataset (minimal size targets). (c) CS-YOLO was 1.4% more accurate than YOLO v8 on VOC2007 data set (normal size).
Data-Efficient Learning of Natural Language to Linear Temporal Logic Translators for Robot Task Specification

To make robots accessible to a broad audience, it is critical to endow them with the ability to take universal modes of communication, like commands given in natural language, and extract a concrete desired task specification, defined using a formal language like linear temporal logic (LTL). In this paper, we present a learning-based approach for translating from natural language commands to LTL specifications with very limited human-labeled training data. This is in stark contrast to existing natural-language to LTL translators, which require large human-labeled datasets, often in the form of labeled pairs of LTL formulas and natural language commands, to train the translator. To reduce reliance on human data, our approach generates a large synthetic training dataset through algorithmic generation of LTL formulas, conversion to structured English, and then exploiting the paraphrasing capabilities of modern large language models (LLMs) to synthesize a diverse corpus of natural language commands corresponding to the LTL formu-las. We use this generated data to finetune an LLM and apply a constrained decoding procedure at inference time to ensure the returned LTL formula is syntactically correct. We evaluate our approach on three existing LTL/natural language datasets and show that we can translate natural language commands at 75% accuracy with far less human data (≤12 annotations). Moreover, when training on large human-annotated datasets, our method achieves higher test accuracy (95% on average) than prior work. Finally, we show the translated formulas can be used to plan long-horizon, multi-stage tasks on a 12D quadrotor.
Research on path planning of autonomous vehicle based on RRT algorithm of Q-learning and obstacle distribution

Purpose The goal of this research is to develop a dynamic step path planning algorithm based on the rapidly exploring random tree (RRT) algorithm that combines Q-learning with the Gaussian distribution of obstacles. A route for autonomous vehicles may be swiftly created using this algorithm. Design/methodology/approach The path planning issue is divided into three key steps by the authors. First, the tree expansion is sped up by the dynamic step size using a combination of Q-learning and the Gaussian distribution of obstacles. The invalid nodes are then removed from the initially created pathways using bidirectional pruning. B-splines are then employed to smooth the predicted pathways. Findings The algorithm is validated using simulations on straight and curved highways, respectively. The results show that the approach can provide a smooth, safe route that complies with vehicle motion laws. Originality/value An improved RRT algorithm based on Q-learning and obstacle Gaussian distribution (QGD-RRT) is proposed for the path planning of self-driving vehicles. Unlike previous methods, the authors use Q-learning to steer the tree's development direction. After that, the step size is dynamically altered following the density of the obstacle distribution to produce the initial path rapidly and cut down on planning time even further. In the aim to provide a smooth and secure path that complies with the vehicle kinematic and dynamical restrictions, the path is lastly optimized using an enhanced bidirectional pruning technique.
Method of the development of students' foreign language communication skills based on practice with a chatbot

Introduction. Chatbot is a program based on machine learning and natural language that allows the organisation of learners’ foreign language communication practice. However, the effectiveness of the teaching method depends on how and to what extent the foreign language practice with the chatbot is integrated into the foreign language learning process. The aim of the study is to develop and test the author's step-by-step method of the development of learners' foreign language communication skills based on chatbot practice. Materials and methods. Participants of the research were 1st year students of Derzhavin Tambov State University (Russian Federation), majoring in English as a Foreign Language. Students of the control group (N=25) were trained in foreign-language speech communication in traditional foreign language classes, and participants of the experimental group (N=25) in addition to regular classes for a semester once a week participated in a foreign language communication practice with a chatbot and performed tasks for the analysis of practice results. Ten foreign language speech skills were under controlled. The data analysis was carried out using the Student’s t-test. Research results. The step-by-step method of the development of students' foreign language communication skills based of practice with a chatbot proved to be effective with regard to the development of the following skills: asking for information on the topic of the dialogue (t = 2.49; p ≤ 0.05); responding to a dialogue partner's requests (t = 2.24; p ≤ 0.05); stating thoughts on the topic of the dialogue in short or extended form (t = 1.78; p ≤ 0.05); drawing conclusions (t = 1, 8; p ≤ 0.05) Expression of students’ own opinion on the topic of discussion (t = 1.91; p ≤ 0.05); providing arguments for their opinion on the topic of discussion (t = 1.41; p ≤ 0.05); interrogation, clarification, reformulation, expression ideas by other language means (t = 4, 11; p ≤ 0.05). The study did not show the effectiveness of the proposed method on the development of students' abilities to initiate a dialogue (t = 0.58; p&gt; 0.05); welcome dialogue participants and exchange greeting phrases (t = 0.58; p&gt; 0.05); end a conversation (t = 0.58; p&gt; 0.05) because of students' high proficiency in these skills at the time of participation in the experiment. Conclusion. The novelty of the study is in the development of a step-by-step method of the development of learners' foreign language communication skills based on practice with a chatbot. The results of the study can be used in foreign language teaching to secondary school university level students.
Characterizing (non-)Markovianity through Fisher information

A non-isolated physical system typically loses information to its environment, and when such loss is irreversible the evolution is said to be Markovian. Non-Markovian effects are studied by monitoring how information quantifiers, such as the distance between physical states, evolve in time. Here we show that the Fisher information metric emerges as a natural object to study in this context; we fully characterize the relation between its contractivity properties and Markovianity, both from the mathematical and operational point of view. We prove, for classical dynamics, that Markovianity is equivalent to the monotonous contraction of the Fisher metric at all points of the set of states. At the same time, operational witnesses of non-Markovianity based on the dilation of the Fisher distance cannot, in general, detect all non-Markovian evolutions, unless specific physical postprocessing is applied to the dynamics. Finally, we show for the first time that non-Markovian dilations of Fisher distance between states at any time correspond to backflow of information about the initial state of the dynamics at time 0, via Bayesian retrodiction. All the presented results can be lifted to the case of quantum dynamics by considering the standard CP-divisibility framework.
RAT: A Refactoring-Aware Traceability Model for Bug Localization

A large number of bug reports are created during the evolution of a software system. Locating the source code files that need to be changed in order to fix these bugs is a challenging task. Information retrieval-based bug localization techniques do so by correlating bug reports with historical information about the source code (e.g., previously resolved bug reports, commit logs). These techniques have shown to be efficient and easy to use. However, one flaw that is nearly omnipresent in all these techniques is that they ignore code refactorings. Code refactorings are common during software system evolution, but from the perspective of typical version control systems, they break the code history. For example, a class when renamed then appears as two separate classes with separate histories. Obviously, this is a problem that affects any technique that leverages code history. This paper proposes a refactoring-aware traceability model to keep track of the code evolution history. With this model, we reconstruct the code history by analyzing the impact of code refactorings to correctly stitch together what would otherwise be a fragmented history. To demonstrate that a refactoring aware history is indeed beneficial, we investigated three widely adopted bug localization techniques that make use of code history, which are important components in existing approaches. Our evaluation on 11 open source projects shows that taking code refactorings into account significantly improves the results of these bug localization techniques without significant changes to the techniques themselves. The more refactorings are used in a project, the stronger the benefit we observed. Based on our findings, we believe that much of the state of the art leveraging code history should benefit from our work.
The battle of clean and dirty qubits in the era of partial error correction

When error correction becomes possible it will be necessary to dedicate a large number of physical qubits to each logical qubit. Error correction allows for deeper circuits to be run, but each additional physical qubit can potentially contribute an exponential increase in computational space, so there is a trade-off between using qubits for error correction or using them as noisy qubits. In this work we look at the effects of using noisy qubits in conjunction with noiseless qubits (an idealized model for error-corrected qubits), which we call the "clean and dirty" setup. We employ analytical models and numerical simulations to characterize this setup. Numerically we show the appearance of Noise-Induced Barren Plateaus (NIBPs), i.e., an exponential concentration of observables caused by noise, in an Ising model Hamiltonian variational ansatz circuit. We observe this even if only a single qubit is noisy and given a deep enough circuit, suggesting that NIBPs cannot be fully overcome simply by error-correcting a subset of the qubits. On the positive side, we find that for every noiseless qubit in the circuit, there is an exponential suppression in concentration of gradient observables, showing the benefit of partial error correction. Finally, our analytical models corroborate these findings by showing that observables concentrate with a scaling in the exponent related to the ratio of dirty-to-total qubits.
Differential Evolution and Engineering Problems

In this paper, the performance of the Differential Evolution algorithm is evaluated when solving real-world problems. A Set of 13 engineering optimisation problems was selected from the fields of mechanics and industry to illustrate the usability of the Differential Evolution algorithm. Twelve variants of the standard Differential Evolution with various settings of the control parameters are compared with 19 state-of-the-art adaptive variants of this algorithm. The results are analysed statistically to achieve significant differences. Three variants of adaptive Differential Evolution provided better results compared to other algorithms. Some adaptive variants of Differential Evolution perform significantly worse than the original Differential Evolution with the fixed setting of the control parameters.
A Memorizing and Generalizing Framework for Lifelong Person Re-Identification

In this paper, we introduce a challenging yet practical setting for person re-identification (ReID) task, named lifelong person re-identification (LReID), which aims to continuously train a ReID model across multiple domains and the trained model is required to generalize well on both seen and unseen domains. It is therefore critical to learn a ReID model that can learn a generalized representation without forgetting knowledge of seen domains. In this paper, we propose a new MEmorizing and GEneralizing framework (MEGE) for LReID, which can jointly prevent the model from forgetting and improve its generalization ability. Specifically, our MEGE is composed of two novel modules, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.</i> , Adaptive Knowledge Accumulation (AKA) and differentiable Ranking Consistency Distillation (RCD). Taking inspiration from the cognitive processes in the human brain, we endow AKA with two special capacities, knowledge representation and knowledge operation by graph convolution networks. AKA can effectively mitigate catastrophic forgetting on seen domains while improving the generalization ability to unseen domains. By considering the ranking factor that is specifically important in ReID, RCD is designed to distill the ranking knowledge in a differentiable manner, which can further prevent the catastrophic forgetting. To supporting the study of LReID, we build a new and large-scale benchmark with two practical evaluation protocols that consider the metrics of non-forgetting and generalization. Experiments demonstrate that 1) our MEGE framework can effectively improve the performance on seen and unseen domains under the domain-incremental learning constraint, and that 2) the proposed MEGE outperforms state-of-the-art competitors by large margins.