Reviewerly/exHarmony huggingface dataset:
Generative AI in Higher Education

This chapter provides a comprehensive exploration of generative artificial intelligence (AI), particularly focusing on its implications and applications in higher education. It discusses the evolution and fundamental concepts of AI, including large language models and their development, emphasizing the intricate processes involved in creating and refining these models. The chapter delves into the ethical considerations and potential biases inherent in AI systems, highlighting the importance of responsible AI development. Moreover, the chapter examines the transformative potential of generative AI in enhancing learning, creativity, and information processing in higher education settings.
Kernel-based mapping of reliability in predictions for consensus modelling

Approaches of high-level data fusion, also known as consensus, combine predictions of individual models to increase reliability and overcome limitations of single models. Consensus strategies are frequently applied in the framework of Quantitative Structure - Activity Relationships (QSARs) to reduce the uncertainties in the prediction of molecular activities and provide better accuracy of the model outcomes. However, specific regions of the chemical space may systematically be associated with low accuracy and even consensus modelling cannot improve prediction reliability through the multiple outcomes of individual models. In this study, a new heuristic metric to assess the degree of accuracy of consensus predictions in the chemical space is proposed. This metric can assist the mapping of reliability in prediction and enhance the delineation of a safe zone, where consensus predictions are expected to have better accuracy. The new metric is calculated by kernel-based potential functions and it can be used in the framework of both classification and regression consensus modelling. Four case studies, including extensive datasets for consensus modelling, were used to test the proposed approach. Results demonstrated that a potential can be associated with regions of the chemical space as a function of accuracy of consensus modelling and it can be used to enable the mapping of reliability in prediction and the definition of specific regions where predictions are expected to be more reliable.
Optical computing metasurfaces: applications and advances

Abstract Integrated photonic devices and artificial intelligence have presented a significant opportunity for the advancement of optical computing in practical applications. Optical computing technology is a unique computing system based on optical devices and computing functions, which significantly differs from the traditional electronic computing technology. On the other hand, optical computing technology offers the advantages such as fast speed, low energy consumption, and high parallelism. Yet there are still challenges such as device integration and portability. In the burgeoning development of micro–nano optics technology, especially the deeply ingrained concept of metasurface technique, it provides an advanced platform for optical computing applications, including edge detection, image or motion recognition, logic computation, and on-chip optical computing. With the aim of providing a comprehensive introduction and perspective for optical computing metasurface applications, we review the recent research advances of optical computing, from nanostructure and computing methods to practical applications. In this work, we review the challenges and analysis of optical computing metasurfaces in engineering field and look forward to the future development trends of optical computing.
Continuous-time quantum walks for MAX-CUT are hot

By exploiting the link between time-independent Hamiltonians and thermalisation, heuristic predictions on the performance of continuous-time quantum walks for MAX-CUT are made. The resulting predictions depend on the number of triangles in the underlying MAX-CUT graph. We extend these results to the time-dependent setting with multi-stage quantum walks and Floquet systems. The approach followed here provides a novel way of understanding the role of unitary dynamics in tackling combinatorial optimisation problems with continuous-time quantum algorithms.
Assessment framework for deepfake detection in real-world situations

Abstract Detecting digital face manipulation in images and video has attracted extensive attention due to the potential risk to public trust. To counteract the malicious usage of such techniques, deep learning-based deepfake detection methods have been employed and have exhibited remarkable performance. However, the performance of such detectors is often assessed on related benchmarks that hardly reflect real-world situations. For example, the impact of various image and video processing operations and typical workflow distortions on detection accuracy has not been systematically measured. In this paper, a more reliable assessment framework is proposed to evaluate the performance of learning-based deepfake detectors in more realistic settings. To the best of our acknowledgment, it is the first systematic assessment approach for deepfake detectors that not only reports the general performance under real-world conditions but also quantitatively measures their robustness toward different processing operations. To demonstrate the effectiveness and usage of the framework, extensive experiments and detailed analysis of four popular deepfake detection methods are further presented in this paper. In addition, a stochastic degradation-based data augmentation method driven by realistic processing operations is designed, which significantly improves the robustness of deepfake detectors.
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics

.We consider the problem of finding nearly optimal solutions of optimization problems with random objective functions. Such problems arise widely in the theory of random graphs, theoretical computer science, and statistical physics. Two concrete problems we consider are (a) optimizing the Hamiltonian of a spherical or Ising \(p\)-spin glass model and (b) finding a large independent set in a sparse Erdős–Rényi graph. The following families of algorithms are considered: (a) low-degree polynomials of the input—a general framework that captures many prior algorithms; (b) low-depth Boolean circuits; (c) the Langevin dynamics algorithm, a canonical Monte Carlo analogue of the gradient descent algorithm. We show that these families of algorithms cannot have high success probability. For the case of Boolean circuits, our results improve the state-of-the-art bounds known in circuit complexity theory (although we consider the search problem as opposed to the decision problem). Our proof uses the fact that these models are known to exhibit a variant of the overlap gap property (OGP) of near-optimal solutions. Specifically, for both models, every two solutions whose objectives are above a certain threshold are either close to or far from each other. The crux of our proof is that the classes of algorithms we consider exhibit a form of stability (noise-insensitivity): a small perturbation of the input induces a small perturbation of the output. We show by an interpolation argument that stable algorithms cannot overcome the OGP barrier. The stability of Langevin dynamics is an immediate consequence of the well-posedness of stochastic differential equations. The stability of low-degree polynomials and Boolean circuits is established using tools from Gaussian and Boolean analysis—namely hypercontractivity and total influence, as well as a novel lower bound for random walks avoiding certain subsets, which we expect to be of independent interest. In the case of Boolean circuits, the result also makes use of Linial–Mansour–Nisan's classical theorem. Our techniques apply more broadly to low influence functions, and we expect that they may apply more generally.Keywordsspin glassesmaximum independent setrandom graphsrandom optimization problemsaverage-case hardnessBoolean circuitslow-degree methodsLangevin dynamicsoverlap gap propertyMSC codes68Q0668Q1768Q2568Q8782D3058J6590C27
Context Transformer and Adaptive Method with Visual Transformer for Robust Facial Expression Recognition

In real-world scenarios, the facial expression recognition task faces several challenges, including lighting variations, image noise, face occlusion, and other factors, which limit the performance of existing models in dealing with complex situations. To cope with these problems, we introduce the CoT module between the CNN and ViT frameworks, which improves the ability to perceive subtle differences by learning the correlations between local area features at a fine-grained level, helping to maintain the consistency between the local area features and the global expression, and making the model more adaptable to complex lighting conditions. Meanwhile, we adopt an adaptive learning method to effectively eliminate the interference of noise and occlusion by dynamically adjusting the parameters of the Transformer Encoder’s self-attention weight matrix. Experiments demonstrate the accuracy of our CoT_AdaViT model in the Oulu-CASIA dataset as (NIR: 87.94%, VL: strong: 89.47%, weak: 84.76%, dark: 82.28%). As well as, CK+, RAF-DB, and FERPlus datasets achieved 99.20%, 91.07%, and 90.57% recognition results, which achieved excellent performance and verified that the model has strong recognition accuracy and robustness in complex scenes.
Sequential quantum simulation of spin chains with a single circuit QED device

Quantum simulations of many-body systems in materials science and chemistry are promising application areas for quantum computers. However, the limited scale and coherence of near-term quantum processors pose a significant obstacle to realizing this potential. Here, we theoretically outline how a single-mode circuit quantum electrodynamics device, consisting of a transmon qubit coupled to a long-lived cavity mode, can be used to simulate the ground state of a highly entangled quantum many-body spin chain. We exploit recently developed methods for implementing quantum operations to sequentially build up a matrix product state (MPS) representation of a many-body state. This approach reuses the transmon qubit to read out the state of each spin in the chain and exploits the large state space of the cavity as a quantum memory encoding intersite correlations and entanglement. We show, through simulation, that analog (pulse-level) control schemes can accurately prepare a known MPS representation of a quantum critical spin chain in significantly less time than digital (gate-based) methods, thereby reducing the exposure to decoherence. We then explore this analog-control approach for the variational preparation of an unknown ground state. We demonstrate that the large state space of the cavity can be used to replace multiple qubits in a qubit-only architecture, and could therefore simplify the design of quantum processors for materials simulation. We explore the practical limitations of realistic noise and decoherence and discuss avenues for scaling this approach to more complex problems that challenge classical computational methods.
Multi-strategy-based adaptive sine cosine algorithm for engineering optimization problems

Sine Cosine Algorithm(SCA) is a population-based optimization algorithm, to find the optimal solution. However, SCA has problems such as premature convergence, insufficient solution precision for high-dimensional functions, and slow convergence speed. To solve the problems above, this paper proposes a multi-strategy-based Adaptive Sine Cosine Algorithm (ASCA). Firstly, a more uniform initial population is generated by the Halton sequence so that the initial population covers the entire search space to maintain the diversity of the initial population. Secondly, the adaptive grading strategy is adopted to sort according to the fitness value, and the population dynamics are divided into 4 grades: excellent, good, medium and poor. For the purpose of improving the convergence accuracy of the algorithm and enhancing the ability to jump out of the local optimum, hybrid mutation and elite guidance methods are applied to different levels of populations for perturbing mutations. Finally, in order to improve the convergence speed of the algorithm, a dynamic opposition-based learning global search strategy is proposed. The ASCA is tested on a set of 20 functions in low- dimensional and high-dimensional, and the improved algorithm is compared with Particle Swarm Optimization (PSO), Backtracking Search Algorithm(BSA), Genetic Algorithm(GA)and other improved Sine Cosine Algorithms. The results show the improved convergence accuracy and speed of the ASCA. Moreover, the ASCA proposed in this paper is applied to engineering optimization design. The solution results show that the ASCA is better than other algorithms in superiority-seeking ability, and can effectively solve the optimization problems in engineering.
Connecting through chatbots: residents’ insights on digital storytelling, place attachment, and value co-creation

Despite the widespread adoption of chatbots in tourism, there is limited research on their role in digital storytelling from residents' perspectives. Drawing on Social Presence Theory, the primary objective of this study was to examine the impact of a chatbot's anthropomorphic conversation style (emotional vs. neutral) on perceived digital storytelling components in destination marketing. Additionally, the research explored how digital storytelling through chatbots influenced residents' place attachment and, consequently, their engagement in value co-creation. To address these research objectives, the study adopted a quantitative perspective and employed an experimental design. Data were collected from 176 residents of Side, Turkey, using convenience sampling, and all hypotheses were confirmed. The perceptions of digital storytelling expressed as emotional (experimental group) were found to be more positive than the neutral (control group). In addition, digital storytelling significantly influenced place attachment, which was a significant predictor of value co-creation. Finally, place attachment partially mediated the relationship between digital storytelling and residents' value co-creation. The findings provided valuable insights for tourism stakeholders such as businesses, policymakers, and researchers, guiding the effective implementation of chatbots in destination marketing, investigating residents' perspectives regarding emotional digital storytelling by chatbots, and enhancing residents' engagement in value co-creation.
A Patch Distribution-based Active Learning Method for Multiple Instance Alzheimer's Disease Diagnosis

Medical data, particularly the complex brain imaging structures, acquisition presents significant difficulties and high diagnostic expenses, resulting in a scarcity of the trainable samples in the real-world scenarios. To overcome this limitation, we present an active learning-based sampling strategy that selects the most informative samples from the unlabeled candidate sample pool for expert annotation, leading to high classification performance with a reduced number of training samples. This study adopts a patch-level perspective and introduces a multi-instance learning framework for Alzheimer's Disease diagnosis. Initially, a patch pre-selection module is designed to identify pathology-prone regions while excluding background areas and irrelevant information. Subsequently, an inner-patch local attention mechanism block and an outer-patch global attention mechanism block are developed to enhance the extraction of discriminative local and global information by the network model. Finally, an active learning sampling strategy is devised to minimize the costs associated with data acquisition and expert annotation in medical domain. The effectiveness of the proposed network framework and active learning strategy was validated through four sets of control experiments on the ADNI dataset.
Enhancing User Experience With a Generative AI Chatbot

With the rapid evolution of artificial intelligence (AI), this study aims to examine the interplay among the perceived usability, perceived enjoyment, perceived responsiveness, and intention to continue using ChatGPT. Structural equation modeling (SEM) was used to investigate our proposed model. We recruited 446 ChatGPT users through an online survey conducted on the Connect platform, powered by CloudResearch. Perceived usability (β = 0.254) and enjoyment (β = 0.438) significantly influence satisfaction with ChatGPT. However, perceived responsiveness is not significantly related to perceived attachment or satisfaction. Furthermore, we established that perceived attachment (β = 0.405) and satisfaction (β = 0.447) are pivotal in shaping users' intentions to continue using ChatGPT, providing insights into human–AI interactions. The practical implications of our findings suggest that generative AI chatbots should be crafted with a focus on enjoyable, user-centered interfaces that foster long-term user satisfaction and engagement. AI developers should design AI conversation flows and chatbot personas to optimize the user experience.
FFT-Based Simultaneous Calculations of Very Long Signal Multi-Resolution Spectra for Ultra-Wideband Digital Radio Frequency Receiver and Other Digital Sensor Applications

The discrete Fourier transform (DFT) is the most commonly used signal processing method in modern digital sensor design for signal study and analysis. It is often implemented in hardware, such as a field programmable gate array (FPGA), using the fast Fourier transform (FFT) algorithm. The frequency resolution (i.e., frequency bin size) is determined by the number of time samples used in the DFT, when the digital sensor's bandwidth is fixed. One can vary the sensitivity of a radio frequency receiver by changing the number of time samples used in the DFT. As the number of samples increases, the frequency bin width decreases, and the digital receiver sensitivity increases. In some applications, it is useful to compute an ensemble of FFT lengths; e.g., 2P-j for j=0, 1, 2, …, J, where j is defined as the spectrum level with frequency resolution 2j·Δf. Here Δf is the frequency resolution at j=0. However, calculating all of these spectra one by one using the conventional FFT method would be prohibitively time-consuming, even on a modern FPGA. This is especially true for large values of P; e.g., P≥20. The goal of this communication is to introduce a new method that can produce multi-resolution spectrum lines corresponding to sample lengths 2P-j for all J+1 levels, concurrently, while one long 2P-length FFT is being calculated. That is, the lower resolution spectra are generated naturally as by-products during the computation of the 2P-length FFT, so there is no need to perform additional calculations in order to obtain them.
Precise path planning and trajectory tracking based on improved A-star algorithm

Path planning and trajectory tracking are very meaningful for the field of autonomous driving, but currently path planning still has problems such as non-optimal paths and insufficiently accurate paths. This paper addresses the issue of path planning by proposing a improved A-star algorithm and locally zooming on the map technique to achieve precise path planning. Compared with the conventional method, this method reduces the time by 23% and the path length by 21% in the scenarios shown in the paper, respectively, and provides a reference for related research. Moreover, trajectory tracking was achieved using the improved LQR control. Compared with the conventional method, the improved LQR control algorithm reduces the average error by 80% in the scenario shown in the paper. Firstly, the A-star algorithm is enhanced by incorporating an unknown path cost estimation function, thereby improving the effect of its path planning in complex environments. Additionally, the method of locally zooming on the map is incorporated, effectively enhancing the accuracy and safety of path planning. Building upon the path planning, further improvements are made to the LQR control algorithm, enabling autonomous deceleration in complex sections, which facilitates better trajectory tracking and enhances the motion control performance of the robot during practical operations.
Analog spatiotemporal feature extraction for cognitive radio-frequency sensing with integrated photonics

Analog feature extraction (AFE) is an appealing strategy for low-latency and efficient cognitive sensing systems since key features are much sparser than the Nyquist-sampled data. However, applying AFE to broadband radio-frequency (RF) scenarios is challenging due to the bandwidth and programmability bottlenecks of analog electronic circuitry. Here, we introduce a photonics-based scheme that extracts spatiotemporal features from broadband RF signals in the analog domain. The feature extractor structure inspired by convolutional neural networks is implemented on integrated photonic circuits to process RF signals from multiple antennas, extracting valid features from both temporal and spatial dimensions. Because of the tunability of the photonic devices, the photonic spatiotemporal feature extractor is trainable, which enhances the validity of the extracted features. Moreover, a digital-analog-hybrid transfer learning method is proposed for the effective and low-cost training of the photonic feature extractor. To validate our scheme, we demonstrate a radar target recognition task with a 4-GHz instantaneous bandwidth. Experimental results indicate that the photonic analog feature extractor tackles broadband RF signals and reduces the sampling rate of analog-to-digital converters to 1/4 of the Nyquist sampling while maintaining a high target recognition accuracy of 97.5%. Our scheme offers a promising path for exploiting the AFE strategy in the realm of cognitive RF sensing, with the potential to contribute to the efficient signal processing involved in applications such as autonomous driving, robotics, and smart factories.
Physics-Constrained Hardware-Efficient Ansatz on Quantum Computers That Is Universal, Systematically Improvable, and Size-Consistent

Variational wave function ansätze are at the heart of solving quantum many-body problems in physics and chemistry. Previous designs of hardware-efficient ansatz (HEA) on quantum computers are largely based on heuristics and lack rigorous theoretical foundations. In this work, we introduce a physics-constrained approach for designing HEA with rigorous theoretical guarantees by imposing a few fundamental constraints. Specifically, we require that the target HEA to be universal, systematically improvable, and size-consistent, which is an important concept in quantum many-body theories for scalability but has been overlooked in previous designs of HEA. We extend the notion of size-consistency to HEA and present a concrete realization of HEA that satisfies all these fundamental constraints while only requiring linear qubit connectivity. The developed physics-constrained HEA is superior to other heuristically designed HEA in terms of both accuracy and scalability, as demonstrated numerically for the Heisenberg model and some typical molecules. In particular, we find that restoring size-consistency can significantly reduce the number of layers needed to reach a certain accuracy. In contrast, the failure of other HEA to satisfy these constraints severely limits their scalability to larger systems with more than 10 qubits. Our work highlights the importance of incorporating physical constraints into the design of HEA for efficiently solving many-body problems on quantum computers.