Reviewerly/exHarmony huggingface dataset:
Recommendation Method of Power Knowledge Retrieval Based on Graph Neural Network

With the development of the digital and intelligent transformation of the power grid, the structure and operation and maintenance technology of the power grid are constantly updated, which leads to problems such as difficulties in information acquisition and screening. Therefore, we propose a recommendation method for power knowledge retrieval based on a graph neural network (RPKR-GNN). The method first uses a graph neural network to learn the network structure information of the power fault knowledge graph and realize the deep semantic embedding of power entities and relations. After this, it fuses the power knowledge graph paths to mine the potential power entity relationships and completes the power fault knowledge graph through knowledge inference. At the same time, we combine the user retrieval behavior features for knowledge aggregation to form a personal subgraph, and we analyze the user retrieval subgraph by matching the similarity of retrieval keyword features. Finally, we form a fusion subgraph based on the subgraph topology and reorder the entities of the subgraph to generate a recommendation list for the target users for the prediction of user retrieval intention. Through experimental comparison with various classical models, the results show that the models have a certain generalization ability in knowledge inference. The method performs well in terms of the MR and Hit@10 indexes on each dataset, and the F1 value can reach 87.3 in the retrieval recommendation effect, which effectively enhances the automated operation and maintenance capability of the power system.
Exploring the Physical-World Adversarial Robustness of Vehicle Detection

Adversarial attacks can compromise the robustness of real-world detection models. However, evaluating these models under real-world conditions poses challenges due to resource-intensive experiments. Virtual simulations offer an alternative, but the absence of standardized benchmarks hampers progress. Addressing this, we propose an innovative instant-level data generation pipeline using the CARLA simulator. Through this pipeline, we establish the Discrete and Continuous Instant-level (DCI) dataset, enabling comprehensive experiments involving three detection models and three physical adversarial attacks. Our findings highlight diverse model performances under adversarial conditions. YOLO v6 demonstrates remarkable resilience, exhibiting just a marginal 6.59% average drop in average precision (AP). In contrast, the ASA attack yields a substantial 14.51% average AP reduction, twice the effect of other algorithms. We also note that static scenes yield higher recognition AP values, and outcomes remain relatively consistent across varying weather conditions. Intriguingly, our study suggests that advancements in adversarial attack algorithms may be approaching its “limitation”. In summary, our work underscores the significance of adversarial attacks in real-world contexts and introduces the DCI dataset as a versatile benchmark. Our findings provide valuable insights for enhancing the robustness of detection models and offer guidance for future research endeavors in the realm of adversarial attacks.
Video Tutorials in Teacher Education: Benefits, Difficulties, and Key Knowledge and Skills

Shaping the competences of future teachers in a way that is appropriate to the current stage of development of the information society is, in the post-COVID era, a topical and important subject. The accumulation of experience in recent years with the use of digital edtech has forced the search for optimal solutions to support the learning and teaching process. Among such (still undervalued) solutions are video tutorials. This article answers the three research questions: (1) What are the benefits of using video tutorials in education? (2) What difficulties do future teachers face when creating educational tutorials? (3) What key knowledge and skills are required of teachers who wish to create video tutorials? The study (qualitative, based on structured interviews) involved 16 pre-service teachers (Poland) who attended a course on the introduction to the use of information technology in 2022/2023 at one of the leading academic universities in Poland. The collected data, showing the complexity of the use of this type of edtech, provide not only a simple diagnosis regarding the processes of creating and using video tutorials by future generations of teachers, but also allow for the modernisation of academic programmes that prepare pedagogical graduates to work in an increasingly digitalised world of education.
Research on Teaching Floriculture Using WeChat

This paper discusses the implementation of a teaching strategy based on WeChat, using the course of Floriculture as an example. The integration of WeChat into course instruction proves to be highly beneficial for students’ learning experience. It not only enhances students’ interest in learning, but also promotes active participation in the classroom, fosters autonomous learning abilities, and encourages engagement in teaching and learning. The utilization of WeChat in teaching demonstrates great significance in reforming the traditional methods of floriculture classroom instruction.
Fractal Quasi-Coulomb Crystals in Ion Trap with Cantor Dust Electrode Configuration

We propose a new concept of fractal quasi-Coulomb crystals. We have shown that self-similar quasi-Coulomb crystals can be formed in surface electrodynamic traps with the Cantor Dust electrode configuration. Quasi-Coulomb crystal fractal dimension appears to depend on the electrode parameters. We have identified the conditions for transforming trivial quasi-Coulomb crystals into self-similar crystals and described the features of forming 25 Ca+ self-similar quasi-Coulomb crystals. The local potential well depth and width have been shown to take a discrete value dependent on the distance from the electrode surface. Ions inside the crystals studied possess varied translational secular frequencies. We believe that the extraordinary properties of self-similar quasi-Coulomb crystals may contribute to the new prospects within levitated optomechanics, quantum computing and simulation.
Distributed economic forecasting system and its application in rural revitalization

Abstract Compared with the city, the rural area is large and the associated population disperses. Therefore, it needs to design a distributed scheme to collect and analysis the economic data. The federated learning can handle the economic data from different rural areas to protect primal economic data. This paper utilizes federated learning for economic forecasting which plays a very important role in rural revitalization. The proposed economic forecasting system consists of two parts: end nodes and cloud center. An end node is deployed in a village. The economic data of village is encrypted and villages only can communicate with other using encrypted data to avoid the leakage of primal data. The cloud center utilizes federated learning to jointly optimize the models in end nodes. During the processing of optimization, the transition between cloud center and end nodes is encrypted as well. The distributed economic forecasting system is evaluated on real data and achieves the expected results.
A Simple Denoising Algorithm for Real-World Noisy Camera Images

The noise statistics of real-world camera images are challenging for any denoising algorithm. Here, I describe a modified version of a bionic algorithm that improves the quality of real-word noisy camera images from a publicly available image dataset. In the first step, an adaptive local averaging filter was executed for each pixel to remove moderate sensor noise while preserving fine image details and object contours. In the second step, image sharpness was enhanced by means of an unsharp mask filter to generate output images that are close to ground-truth images (multiple averages of static camera images). The performance of this denoising algorithm was compared with five popular denoising methods: bm3d, wavelet, non-local means (NL-means), total variation (TV) denoising and bilateral filter. Results show that the two-step filter had a performance that was similar to NL-means and TV filtering. Bm3d had the best denoising performance but sometimes led to blurry images. This novel two-step filter only depends on a single parameter that can be obtained from global image statistics. To reduce computation time, denoising was restricted to the Y channel of YUV-transformed images and four image segments were simultaneously processed in parallel on a multi-core processor.
Dual selective knowledge transfer for few-shot classification

Abstract Few-shot learning aims at recognizing novel visual categories from very few labelled examples. Different from the existing few-shot classification methods that are mainly based on metric learning or meta-learning, in this work we focus on improving the representation capacity of feature extractors. For this purpose, we propose a new two-stage dual selective knowledge transfer (DSKT) framework, to guide models towards better optimization. Specifically, we first exploit an improved multi-task learning approach to train a feature extractor with robust representation capability as a teacher model. Then, we design an effective dual selective knowledge distillation method, which enables the student model to selectively learn knowledge from the teacher model and current samples, thereby improving the student model’s ability to generalize on unseen classes. Extensive experimental results show that our DSKT achieves competitive performances on four well-known few-shot classification benchmarks.
One-Step Clustering with Adaptively Local Kernels and a Neighborhood Kernel

Among the methods of multiple kernel clustering (MKC), some adopt a neighborhood kernel as the optimal kernel, and some use local base kernels to generate an optimal kernel. However, these two methods are not synthetically combined together to leverage their advantages, which affects the quality of the optimal kernel. Furthermore, most existing MKC methods require a two-step strategy to cluster, i.e., first learn an indicator matrix, then executive clustering. This does not guarantee the optimality of the final results. To overcome the above drawbacks, a one-step clustering with adaptively local kernels and a neighborhood kernel (OSC-ALK-ONK) is proposed in this paper, where the two methods are combined together to produce an optimal kernel. In particular, the neighborhood kernel improves the expression capability of the optimal kernel and enlarges its search range, and local base kernels avoid the redundancy of base kernels and promote their variety. Accordingly, the quality of the optimal kernel is enhanced. Further, a soft block diagonal (BD) regularizer is utilized to encourage the indicator matrix to be BD. It is helpful to obtain explicit clustering results directly and achieve one-step clustering, then overcome the disadvantage of the two-step strategy. In addition, extensive experiments on eight data sets and comparisons with six clustering methods show that OSC-ALK-ONK is effective.
Malicious Traffic Classification via Edge Intelligence in IIoT

The proliferation of smart devices in the 5G era of industrial IoT (IIoT) produces significant traffic data, some of which is encrypted malicious traffic, creating a significant problem for malicious traffic detection. Malicious traffic classification is one of the most efficient techniques for detecting malicious traffic. Although it is a labor-intensive and time-consuming process to gather large labeled datasets, the majority of prior studies on the classification of malicious traffic use supervised learning approaches and provide decent classification results when a substantial quantity of labeled data is available. This paper proposes a semi-supervised learning approach for classifying malicious IIoT traffic. The approach utilizes the encoder–decoder model framework to classify the traffic, even with a limited amount of labeled data available. We sample and normalize the data during the data-processing stage. In the semi-supervised model-building stage, we first pre-train a model on a large unlabeled dataset. Subsequently, we transfer the learned weights to a new model, which is then retrained using a small labeled dataset. We also offer an edge intelligence model that considers aspects such as computation latency, transmission latency, and privacy protection to improve the model’s performance. To achieve the lowest total latency and to reduce the risk of privacy leakage, we first create latency and privacy-protection models for each local, edge, and cloud. Then, we optimize the total latency and overall privacy level. In the study of IIoT malicious traffic classification, experimental results demonstrate that our method reduces the model training and classification time with 97.55% accuracy; moreover, our approach boosts the privacy-protection factor.
Bayesian Estimation of Variance-Based Information Measures and Their Application to Testing Uniformity

Entropy and extropy are emerging concepts in machine learning and computer science. Within the past decade, statisticians have created estimators for these measures. However, associated variability metrics, specifically varentropy and varextropy, have received comparably less attention. This paper presents a novel methodology for computing varentropy and varextropy, drawing inspiration from Bayesian nonparametric methods. We implement this approach using a computational algorithm in R and demonstrate its effectiveness across various examples. Furthermore, these new estimators are applied to test uniformity in data.
Variational Bayesian Inference for Quantile Regression Models with Nonignorable Missing Data

Quantile regression models are remarkable structures for conducting regression analyses when the data are subject to missingness. Missing values occur because of various factors like missing completely at random, missing at random, or missing not at random. All these may result from system malfunction during data collection or human error during data preprocessing. Nevertheless, it is important to deal with missing values before analyzing data since ignoring or omitting missing values may result in biased or misinformed analysis. This paper studies quantile regressions from a Bayesian perspective. By proposing a hierarchical model framework, we develop an alternative approach based on deterministic variational Bayes approximations. Logistic and probit models are adopted to specify propensity scores for missing manifests and covariates, respectively. Bayesian variable selection method is proposed to recognize significant covariates. Several simulation studies and real examples illustrate the advantages of the proposed methodology and offer some possible future research directions.
Graph Sampling-Based Multi-Stream Enhancement Network for Visible-Infrared Person Re-Identification

With the increasing demand for person re-identification (Re-ID) tasks, the need for all-day retrieval has become an inevitable trend. Nevertheless, single-modal Re-ID is no longer sufficient to meet this requirement, making Multi-Modal Data crucial in Re-ID. Consequently, a Visible-Infrared Person Re-Identification (VI Re-ID) task is proposed, which aims to match pairs of person images from the visible and infrared modalities. The significant modality discrepancy between the modalities poses a major challenge. Existing VI Re-ID methods focus on cross-modal feature learning and modal transformation to alleviate the discrepancy but overlook the impact of person contour information. Contours exhibit modality invariance, which is vital for learning effective identity representations and cross-modal matching. In addition, due to the low intra-modal diversity in the visible modality, it is difficult to distinguish the boundaries between some hard samples. To address these issues, we propose the Graph Sampling-based Multi-stream Enhancement Network (GSMEN). Firstly, the Contour Expansion Module (CEM) incorporates the contour information of a person into the original samples, further reducing the modality discrepancy and leading to improved matching stability between image pairs of different modalities. Additionally, to better distinguish cross-modal hard sample pairs during the training process, an innovative Cross-modality Graph Sampler (CGS) is designed for sample selection before training. The CGS calculates the feature distance between samples from different modalities and groups similar samples into the same batch during the training process, effectively exploring the boundary relationships between hard classes in the cross-modal setting. Some experiments conducted on the SYSU-MM01 and RegDB datasets demonstrate the superiority of our proposed method. Specifically, in the VIS→IR task, the experimental results on the RegDB dataset achieve 93.69% for Rank-1 and 92.56% for mAP.
An H-GrabCut Image Segmentation Algorithm for Indoor Pedestrian Background Removal

In the context of predicting pedestrian trajectories for indoor mobile robots, it is crucial to accurately measure the distance between indoor pedestrians and robots. This study aims to address this requirement by extracting pedestrians as regions of interest and mitigating issues related to inaccurate depth camera distance measurements and illumination conditions. To tackle these challenges, we focus on an improved version of the H-GrabCut image segmentation algorithm, which involves four steps for segmenting indoor pedestrians. Firstly, we leverage the YOLO-V5 object recognition algorithm to construct detection nodes. Next, we propose an enhanced BIL-MSRCR algorithm to enhance the edge details of pedestrians. Finally, we optimize the clustering features of the GrabCut algorithm by incorporating two-dimensional entropy, UV component distance, and LBP texture feature values. The experimental results demonstrate that our algorithm achieves a segmentation accuracy of 97.13% in both the INRIA dataset and real-world tests, outperforming alternative methods in terms of sensitivity, missegmentation rate, and intersection-over-union metrics. These experiments confirm the feasibility and practicality of our approach. The aforementioned findings will be utilized in the preliminary processing of indoor mobile robot pedestrian trajectory prediction and enable path planning based on the predicted results.
Individual Locating of Soccer Players from a Single Moving View

Positional data in team sports is key in evaluating the players' individual and collective performances. When the sole source of data is a broadcast-like video of the game, an efficient video tracking method is required to generate this data. This article describes a framework that extracts individual soccer player positions on the field. It is based on two main components. As in broadcast-like videos of team sport games, the camera view moves to follow the action and a sport field registration method estimates the homography between the pitch and the frame space. Our method estimates the positions of key points sampled on the pitch thanks to an encoder-decoder architecture. The attention mechanisms of the encoder, based on a vision transformer, captures characteristic pitch features globally in the frames. A multiple person tracker generates tracklets in the frame space by associating, with bipartite matching, the player detections between the current and the previous frames thanks to Intersection-Over-Union and distance criteria. Tracklets are then iteratively merged with appearance criteria thanks to a re-identification model. This model is fine-tuned in a self-supervised way on the player thumbnails of the video sample to specifically recognize the fine identification details of each player. The player positions in the frames projected by the homographies allow the obtaining of the real position of the players on the pitch at every moment of the video. We experimentally evaluate our sport field registration method and our 2D player tracker on public datasets. We demonstrate that they both outperform previous works for most metrics. Our 2D player tracker was also awarded first place at the SoccerNet tracking challenge in 2022 and 2023.
A Wandering Detection Method Based on Processing GPS Trajectories Using the Wavelet Packet Decomposition Transform for People with Cognitive Impairment

The increasing prevalence of cognitive disorders among the elderly is a significant consequence of the global aging phenomenon. Wandering stands out as the most prominent and challenging symptom in these patients, with potential irreversible consequences such as loss or even death. Thus, harnessing technological advancements to mitigate caregiving burdens and disease-related repercussions becomes paramount. Numerous studies have developed algorithms and smart healthcare and telemedicine systems for wandering detection. Broadly, these algorithms fall into two categories: those estimating path complexity and those relying on historical trajectory data. However, motion signal processing methods are rarely employed in this context. This paper proposes a motion-signal-processing-based algorithm utilizing the wavelet packet transform (WPT) with a fourth-order Coiflet mother wavelet. The algorithm identifies wandering patterns solely based on patients’ positional data on the current traversed path and variations in wavelet coefficients within the frequency–time spectrum of motion signals. The model’s independence from prior motion behavior data enhances its compatibility with the pronounced instability often seen in these patients. A performance assessment of the proposed algorithm using the Geolife open-source dataset achieved accuracy, precision, specificity, recall, and F-score metrics of 83.06%, 92.62%, 83.06%, 83.06%, and 87.58%, respectively. Timely wandering detection not only prevents irreversible consequences but also serves as a potential indicator of progression to severe Alzheimer’s in patients with mild cognitive impairment, enabling timely interventions for preventing disease progression. This underscores the importance of advancing wandering detection algorithms.
A Novel FDLSR-Based Technique for View-Independent Vehicle Make and Model Recognition

Vehicle make and model recognition (VMMR) is an important aspect of intelligent transportation systems (ITS). In VMMR systems, surveillance cameras capture vehicle images for real-time vehicle detection and recognition. These captured images pose challenges, including shadows, reflections, changes in weather and illumination, occlusions, and perspective distortion. Another significant challenge in VMMR is the multiclass classification. This scenario has two main categories: (a) multiplicity and (b) ambiguity. Multiplicity concerns the issue of different forms among car models manufactured by the same company, while the ambiguity problem arises when multiple models from the same manufacturer have visually similar appearances or when vehicle models of different makes have visually comparable rear/front views. This paper introduces a novel and robust VMMR model that can address the above-mentioned issues with accuracy comparable to state-of-the-art methods. Our proposed hybrid CNN model selects the best descriptive fine-grained features with the help of Fisher Discriminative Least Squares Regression (FDLSR). These features are extracted from a deep CNN model fine-tuned on the fine-grained vehicle datasets Stanford-196 and BoxCars21k. Using ResNet-152 features, our proposed model outperformed the SVM and FC layers in accuracy by 0.5% and 4% on Stanford-196 and 0.4 and 1% on BoxCars21k, respectively. Moreover, this model is well-suited for small-scale fine-grained vehicle datasets.