Search

Self-regulated learning is an essential skill that can help students plan, monitor, and reflect on their learning in order to achieve their learning goals. However, in situations where there is a lack of effective feedback and recommendations, it becomes challenging for students to self-regulate their learning. In this paper, we propose an explainable AI-based approach to provide automatic and intelligent feedback and recommendations that can support the self-regulation of students' learning in a data-driven manner, with the aim of improving their performance on their courses. Prior studies have predicted students' performance and have used these predicted outcomes as feedback, without explaining the reasons behind the predictions. Our proposed approach is based on an algorithm that explains the root causes behind a decline in student performance, and generates data-driven recommendations for taking appropriate actions. The proposed approach was implemented in the form of a dashboard to support self-regulation by students on a university course, and was evaluated to determine its effects on the students' academic performance. The results revealed that the dashboard significantly enhanced students' learning achievements and improved their self-regulated learning skills. Furthermore, it was found that the recommendations generated by the proposed approach positively affected students' performance and assisted them in self-regulation

Purpose: Course evaluations are formative and are used to evaluate learnings of the students for a course. Anomalies in the evaluation process can lead to a faulty educational outcome. Learning analytics and educational data mining provide a set of techniques that can be conveniently applied to extensive data collected as part of the evaluation process to ensure remedial actions. This study aims to conduct an experimental research to detect anomalies in the evaluation methods. Design/methodology/approach: Experimental research is conducted with scientific approach and design. The researchers categorized anomaly into three categories, namely, an anomaly in criteria assessment, subject anomaly and anomaly in subject marks allocation. The different anomaly detection algorithms are used to educate data through the software R, and the results are summarized in the tables. Findings: The data points occurring in all algorithms are finally detected as an anomaly. The anomaly identifies the data points that deviate from the data set's normal behavior. The subject which is consistently identified as anomalous by the different techniques is marked as an anomaly in evaluation. After identification, one can drill down to more details into the title of anomalies in the evaluation criteria. Originality/value: This paper proposes an analytical model for the course evaluation process and demonstrates the use of actionable analytics to detect anomalies in the evaluation process.

This paper describes Alkaline, a size-reduced version of Kyber, which has recently been announced as a prototype NIST standard for post-quantum public-key cryptography. While not as simple as RSA, I believe that Alkaline can be used in an undergraduate classroom to effectively teach the techniques and principles behind Kyber and post-quantum cryptography in general. Classroom experiences with individual concepts used in Alkaline support this belief. In addition to cryptography, linear algebra and abstract algebra classes would be good candidates for the use of Alkaline. A few exercises suitable for use in these classes are included.

In this paper, several research topics are presented that provide productive avenues of exploration for students in an undergraduate cryptography course. The topics are intended for a variety of skill levels and interests. In some cases, a student might be inspired to try to solve the proposed problem or write computer code. Other topics might motivate them to learn new mathematics or algorithms, or research a historical event or person. In all cases, a short description of the topic is given along with several references that can be used as a starting point for student research. The author also describes some challenges and recommendations when teaching a course where a project is a main component.

The Miller-Rabin test is a useful probabilistic method for finding large primes. In this paper, we explain the method in detail and give three variations on this test. These variations were originally developed as student projects to supplement a course in error correcting codes and cryptography.

The last decade has seen a rise in big data approaches, including in the humanities, whereby large quantities of data are collected and analysed. In this paper, we discuss long-form audio recordings that result from individuals wearing a recording device for many hours. Linguists, psychologists and anthropologists can use them, for example, to study infants' or adults' linguistic behaviour. In the past, recorded individuals and communities have resided in high-income countries (HICs) almost exclusively. Recognising the need for better representation of all cultures and linguistic experiences, researchers have more recently started to collect long-form audio recordings in low- and middle-income countries (LMICs). We aim to help researchers to collect, analyse and use these recordings ethically. To do so, we identify four main ethical challenges linked to research that relies on long-form recordings in LMICs. We provide recommendations to overcome these challenges. These considerations should be useful to researchers employing other big data techniques collected via wearables.

Various studies have been conducted on applying intelligent recognition technology, especially speech recognition technology to improve English learning ability, mostly listening and speaking. However, few studies have touched on how image-to-text recognition technology can be used for writing. The present research was conducted to fill this gap by exploring the optimization of a deep-learning-based image captioning algorithm to facilitate English writing, so as to enable learners to break the time and space limitations and learn English writing (including sentence patterns, spelling, vocabulary, and grammar) anytime and anywhere by taking pictures. Therefore, this paper focused on image captioning based on CNN(Convolutional Neural Networks) and LSTM (Long Short-Term Memory), using DenseNet201 or Vision Transformer trained on the ImageNet-1K image classification dataset as the image encoder and LSTM as the decoder. First, pre-training was performed on the Flickr8k dataset. After selecting the best-trained model as the pre-trained weight model for the COCO dataset, fine-tuning optimization was performed on the COCO dataset, and the attention mechanism was used to design the ablation experiment. The BLEU-4, CIDEr, METEOR, and ROUGE evaluation indexes of the optimized model on the test set were 0.3437,1.121,0.2750, and 0.5117, respectively. The study results showed that the convergence of the model was accelerated and had better performance. The model was used to automatically caption 12 images that had never been used during the training process. The descriptions generated by the optimized image captioning algorithm have lexical and syntactic accuracy, and matched what the images expressed, showing that this improved algorithm could be used as a learning tool to help English learners improve lexical and syntactic acquisition to promote writing through the generated descriptions of the pictures taken anytime and anywhere in real-life situations.

With the advent of technological advancement in learning, such as context-awareness, ubiquity and personalisation, various innovations in teaching and learning have led to improved learning. This research paper aims to develop a system that supports personalised learning through adaptive content, adaptive learning path and context awareness to meet individual learner's requirements and promote the effectiveness and performance of the learning process. Furthermore, the study used an experimental control group to ascertain the significance of learners' learning styles and preferences in improving learning performance. The model considers different modules such as personalisation, location support, learning plan and context awareness while relying on the proper classification of learners' learning styles. The system was experimented using 127 learners of a Computer Science Course. The result obtained using 10-fold cross-validation on various algorithms shows better performance in ROC, Kappa and Accuracy, which were all used to evaluate the quality of classification outcome and compared with learners' performances in assessments. During classification, Naïve Bayes Model has the highest average ROC value of 0.979, TP Rate of 0.951 and FP Rate of 0.045. The results obtained show an improvement in learning.

In this paper, to handle the problem of the quick evolution of cyber-security attacks, we developed the iMonsters board game and proposed the attack and defense knowledge self-evolving algorithm. Three versions of the iMonsters were launched in 2013, 2017, and 2019, respectively. Accordingly, the cyber-security ontology can be refined by the ontology fusion-or-splitting procedure for the newly collected cyber-security incidents, as well as the roles and rules of the iMonsters can be refined by the gaming portfolio mining procedure for the collected portfolio. Furthermore, we conducted game-based learning (GBL), a quasi-experiment of pre/post-testing, and concept map testing using the iMonsters board game in a children's summer camp. The experimental results indicate that the students can acquire up-to-date cyber-security knowledge with the iMonsters better than students who learn in a traditional classroom setting, and the students' satisfaction with acquiring cyber-security knowledge with the instructional design of the iMonsters is better compared with learning in a traditional classroom setting. Satisfaction with the new version has continuously increased. Besides, the results of the in-depth interviews show that the new version was easier to learn. Thus, we may conclude that using the self-evolving iMonsters can improve learning effectiveness and participation in GBL.

The purpose of this article is to investigate how 5G and wireless communication technologies (5G+WCT) might be applied to English language classroom programs in higher education. The paper describes the complimentary roles of 5G and wireless communication technologies in English language teaching, includes student data collecting and standardization as part of the pre-processing, and optimizes the teaching system using an enhanced ant colony algorithm (BACO). Furthermore, the thesis delineates diverse approaches to verify and assess the program's efficacy. Through the creation of cutting-edge instructional strategies and data collection techniques, this study fosters innovation in English language instruction in higher education. The study offers promise for real-world application and is significant for raising student success, instructional quality, and educational efficacy. However, since 5G technology is still developing, the results of this study could not be applicable in the future or would need to be updated.

High-precision measurement of temperature value distributions in production scenarios is of great significance for industrial production, but traditional temperature field reconstruction algorithms rely on the design of manual feature extraction methods with high computational complexity and poor generalization ability. In this paper, we propose a high-precision temperature field reconstruction algorithm based on deep learning, using an efficient adaptive feature extraction method for temperature field reconstruction. We design an improved temperature field reconstruction algorithm based on the ResNet18 neural network; introduce the CBAM attention mechanism in the model; and design a feature pyramid, using M-FPN, a multi-scale feature aggregation network fusing PAN and FPN, to make the extracted feature information propagate multi-dimensionally among different layers to improve the feature characterization ability. Finally, the mean square error is used to guide the model to optimize the training so that the model pays more attention to the data and reduces the large error to ensure that the gap between the predicted value and the real value is small. The experimental results show that the reconstruction accuracy of the improved algorithm presented in this paper is significantly better than that of the original algorithm in the case of typical peaked temperature field distributions. [ABSTRACT FROM AUTHOR]

India has produced several drafts of data policies. In this work, they are referred to [1] JBNSCR 2018, [2] DPDPR 2018, [3] NSAI 2018, [4] RAITF 2018, [5] PDPB 2019, [6] PRAI 2021, [7] JPCR 2021, [8] IDAUP 2022, [9] IDABNUP 2022. All of them consider Artificial Intelligence (AI) a social problem solver at the societal level, let alone an incentive for economic growth. However, these policy drafts warn of the social disruptions caused by algorithms and encourage the careful use of computational technologies in various social contexts. Hence, the emerging data society and its implications in India's social contexts demand immense social science attention, which needs to be improved in the policy drafts, primarily because they are creations of industry stakeholders, technocrats, bureaucrats, and experts from tech schools. In the larger social milieu of digital infrastructure emerging, the fundamental question is whether India's national philosophy envisioned in the Indian constitution is reflected in the policy papers. The paper enquires whether the national data policy upholds the core values dispersed through the philosophy of the Indian constitution, which, among other things, is not confined only to inclusion, diversity, rights, liberty, justice and equality. By focusing on constitutional values, the paper seeks to offer a broader and more critical understanding of India's approach to AI policy by bringing together analyses of a wide array of policy documents available in the public realm. [ABSTRACT FROM AUTHOR]

Nowadays, the application of artificial intelligence (AI) algorithms and techniques is ubiquitous and transversal. Fields that take advantage of AI advances include sound and music processing. The advances in interdisciplinary research potentially yield new insights that may further advance the AI methods in this field. This special issue aims to report recent progress and spur new research lines in AI-driven sound and music processing, especially within interdisciplinary research scenarios. [ABSTRACT FROM AUTHOR]

This document is an editorial for a special issue of the journal AIMS Mathematics on the topic of discrete optimization. The issue includes 21 papers covering a range of subjects, including molecular trees, network systems, variational inequality problems, scheduling, image restoration, spectral clustering, integral equations, convex functions, graph products, optimization algorithms, air quality prediction, humanitarian planning, inertial methods, neural networks, transportation problems, emotion identification, fixed-point problems, structural engineering design, single machine scheduling, and ensemble learning. The papers present new theoretical results, algorithms, and applications in these areas. The guest editor expresses gratitude to the journal staff and reviewers and hopes that readers will find inspiration for their own research. [Extracted from the article]

More accurate inversion of source fault geometry and slip parameters under the constraint of the Bayesian algorithm has become a research hotspot in the field of geodetic inversion in recent years. In nonlinear inversion, the determination of the weight ratio of the joint inversion of multisource data is more complicated. In this context, this paper proposes a simple and easily generalized weighting method for inversion of source fault parameters by joint geodetic multisource data under the Bayesian framework. This method determines the relative weight ratio of multisource data by root mean square error (RMSE) value and can be extended to other nonlinear search algorithms. To verify the validity of the method in this paper, this paper first sets up four sets of simulated seismic experiment schemes. The inversion results show that the joint inversion weighting method proposed in this paper has a significant decrease in the large residual value compared with the equal weight joint inversion and the single data source joint inversion method. The east–west deformation RMSE is 0.1458 mm, the north–south deformation RMSE is 0.2119 mm and the vertical deformation RMSE is 0.2756 mm. The RMSEs of the three directions are lower than those of other schemes, indicating that the proposed method is suitable for the joint inversion of source parameters under Bayesian algorithm. To further verify the applicability of the proposed method in complex earthquakes, the source parameters of the Maduo earthquake were inverted using the method of this paper. The focal depth of the inversion results in this paper is closer to the focal depth released by the GCMT agency. In terms of strike angle and dip angle, the joint inversion in this paper is also more inclined to the GCMT results. The joint inversion results generally conform to the characteristics of left-lateral strike-slip, which shows the adaptability of this method in complex earthquakes. [ABSTRACT FROM AUTHOR]

How to improve the high resolution and remove the noise of composite infrared thermal wave detection image have become important research topics in machine vision. Therefore, this paper proposes a composite image enhancement algorithm based on edge adaptive total variation of direction. Using the improved adaptive directional total variation model to construct the guidance image of the guidance filter can provide better structural information for the guidance filter and conduct the guidance filter. This process is iterated to eliminate noise and ladder effect. Experimental results show that this algorithm is superior to other advanced methods in objective evaluation index and subjective vision. The algorithm proposed in this paper can not only effectively eliminate noise and ladder effect, but also highlight image details and structure information, which proves the effectiveness of this algorithm. Discover the cutting-edge algorithm for high-resolution improvement and noise elimination in infrared thermal wave detection images. Our innovative composite image enhancement technique, based on edge adaptive total variation, outperforms traditional methods. The improved directional model provides better structural information, optimizing the guidance filter process. Experimental results reveal its superiority in objective evaluation and subjective vision. This algorithm effectively eliminates noise and ladder effect while highlighting image details, validating its remarkable effectiveness. [ABSTRACT FROM AUTHOR]

Millimeter-wave radar-based identification technology has a wide range of applications in persistent identity verification, covering areas such as security production, healthcare, and personalized smart consumption systems. It has received extensive attention from the academic community due to its advantages of being non-invasive, environmentally insensitive and privacy-preserving. Existing identification algorithms mainly rely on a single signal, such as breathing or heartbeat. The reliability and accuracy of these algorithms are limited due to the high similarity of breathing patterns and the low signal-to-noise ratio of heartbeat signals. To address the above issues, this paper proposes an algorithm for multimodal fusion for identity recognition. This algorithm extracts and fuses features derived from phase signals, respiratory signals, and heartbeat signals for identity recognition purposes. The spatial features of signals with different modes are first extracted by the residual network (ResNet), after which these features are fused with a spatial-channel attention fusion module. On this basis, the temporal features are further extracted with a time series-based self-attention mechanism. Finally, the feature vectors of the user's vital sign modality are obtained to perform identity recognition. This method makes full use of the correlation and complementarity between different modal signals to improve the accuracy and reliability of identification. Simulation experiments show that the algorithm identity recognition proposed in this paper achieves an accuracy of 94.26% on a 20-subject self-test dataset, which is much higher than that of the traditional algorithm, which is about 85%. [ABSTRACT FROM AUTHOR]

This paper proposes an innovative image encryption algorithm that leverages partial face recognition and DNA diffusion, building upon advancements in chaotic image encryption and face recognition technologies. The key is generated using the secure SHA-512 algorithm, while the chaotic sequence for the encryption algorithm is derived from the Chen system. This paper begins by employing facial recognition technology to identify and focus on specific facial regions within an image. Subsequently, DNA diffusion is applied to encrypt the recognized face segment via a diffusion-scrambling encryption process. Following this, the entire image undergoes diffusion utilizing the devised diffusion rules. Finally, a uniform scrambling operation based on Fisher-Yeats is performed on the entire image. The experimental results and safety analysis show that the information entropy can exceed 7.9973, the average correlation can be less than 0.0023, the pixel number change rate can reach 99.6052%, and the unified average change intensity can reach 33.4644%, all of which are very close to the ideal values. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative method to improve loop closure detection within the domain of Simultaneous Localization And Mapping (SLAM) by integrating a Multi-Scale Attention and Semantic Guidance (MSA-SG) framework. In SLAM systems, accurate loop closure detection is essential for minimizing localization errors over time and ensuring the reliability of the constructed maps in robotics navigation through uncharted environments. Our proposed method utilizes EfficientNet-EA for robust feature extraction and introduces MSA-SG, a novel mechanism that synergizes multiscale attention with semantic guidance to focus on critical semantic features essential for loop closure detection. This approach ensures the prioritization of static environmental landmarks over transient and irrelevant objects, significantly enhancing the accuracy and efficiency of loop closure detection in complex and dynamic settings. Experimental validations on recognized datasets underscore the superiority of our approach, demonstrating marked improvements in precision, recall, and overall SLAM performance. This research highlights the significant benefits of leveraging semantic insights and attentional focus in advancing the capabilities of loop closure detection for SLAM applications. [ABSTRACT FROM AUTHOR]

Copyright of Automobile Technology is the property of Automobile Technology Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks (MANETs) from dynamic topologies that pose great challenges because of the mobility of nodes. The main objective was to delve into and refine the application of the Dijkstra's algorithm in this context, a method conventionally esteemed for its efficiency in static networks. Thus, this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm, considering adaptation to the dynamic network conditions that are typical for MANETs. This paper has shown through detailed algorithmic analysis that Dijkstra's algorithm, when adapted for dynamic updates, yields a very workable solution to the problem of real-time routing in MANETs. The results indicate that with these changes, Dijkstra's algorithm performs much better computationally and 30% better in routing optimization than Bellman-Ford when working with configurations of sparse networks. The theoretical framework adapted, with the adaptation of the Dijkstra's algorithm for dynamically changing network topologies, is novel in this work and quite different from any traditional application. The adaptation should offer more efficient routing and less computational overhead, most apt in the limited resource environment of MANETs. Thus, from these findings, one may derive a conclusion that the proposed version of Dijkstra's algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods. This paper, therefore, operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness. [ABSTRACT FROM AUTHOR]

Traffic signs detection is an important and challenging task in intelligent driving perception system. This paper proposes an improved lightweight traffic signs detection framework based on YOLOv5. Firstly, the YOLOv5's backbone is replaced with ShuffleNet v2, which simplifies the calculation complexity and reduces the parameters of backbone network. Secondly, aiming at the problem of inconspicuous traffic sign characteristics in complex road environment, we use the CA attention mechanism in this paper to improve the saliency of the object. Finally, aiming at the large-scale difference between the traffic signs and the high proportion of small objects, we design the BCS-FPN to fuse multi-scale features and improve the representation ability of the small-scale objects. The TT-100K dataset is also analyzed and the dataset is collated. We test on the collated TT-100K dataset for the improved YOLOv5 in this paper. And the results show that compared with YOLOv5s, the mAP of our algorithm is equivalent to that of YOLOv5s, and the speed is improved by 20.8%. This paper also has carried on the experiment on embedded devices, experimental results show that our framework in computing power less embedded devices has a better effect. [ABSTRACT FROM AUTHOR]

Recent advances in path-planning algorithms have transformed robotics. The Rapidly exploring Random Tree (RRT) algorithm underpins autonomous robot navigation. This paper systematically examines the uses and development of RRT algorithms in single and multiple robots to demonstrate their importance in modern robotics studies. To do this, we have reviewed 70 works on RRT algorithms in single and multiple robot path planning from 2015 to 2023. RRT algorithm evolution, including crucial turning points and innovative techniques, have been examined. A detailed comparison of the RRT Algorithm versions reveals their merits, limitations, and development potential. The review's identification of developing regions and future research initiatives will enable roboticists to use RRT algorithms. This thorough review is essential to the robotics community, inspiring new ideas, helping problem-solving, and expediting single- and multi-robot system development. This highlights the necessity of RRT algorithms for autonomous and collaborative robotics advancement. [ABSTRACT FROM AUTHOR]

This paper primarily investigates enhanced object detection techniques for indoor service mobile robots. Robot operating systems (ROS) supply rich sensor data, which boost the models' ability to generalize. However, the model's performance might be hindered by constraints in the processing power, memory capacity, and communication capabilities of robotic devices. To address these issues, this paper proposes an improved you only look once version 5 (YOLOv5)-Lite object detection algorithm based on efficient multi-scale attention and bounding box regression combined with ROS. The algorithm incorporates efficient multi-scale attention (EMA) into the traditional YOLOv5-Lite model and replaces the C3 module with a lightweight C3Ghost module to reduce computation and model size during the convolution process. To enhance bounding box localization accuracy, modified precision-defined intersection over union (MPDIoU) is employed to optimize the model, resulting in the ROS–YOLOv5–FleetEMA model. The results indicated that relative to the conventional YOLOv5-Lite model, the ROS–YOLOv5–FleetEMA model enhanced the mean average precision (mAP) by 2.7% post-training, reduced giga floating-point operations per second (GFLOPS) by 13.2%, and decreased the params by 15.1%. In light of these experimental findings, the model was incorporated into ROS, leading to the development of a ROS-based object detection platform that offers rapid and precise object detection capabilities. [ABSTRACT FROM AUTHOR]

The performance of the existing student classroom behavior detection model is affected by various aspects such as dataset, algorithm and height as well as the differences between different classrooms, and there are problems such as a single dataset, low accuracy and low efficiency. In order to improve the accuracy of student classroom behavior detection algorithm, this paper proposes a student classroom behavior detection method based on improved convolutional neural network algorithm. Firstly, the student behavior detection dataset is constructed, and the student classroom behavior detection technology scheme is designed; secondly, in order to improve the detection accuracy, the features are extracted by using the new jumping bi-directional paths, and the attention mechanism module is added at different positions to improve the path aggregation network; weekly, the embedding positions of the attention mechanism strategy are determined by analyzing multiple sets of experiments, and the proposed student classroom behavior detection algorithm's effectiveness and superiority. [ABSTRACT FROM AUTHOR]

This article presents a systematic review of research on predicting human behavior through unstructured textual data, employing a comprehensive selection process illustrated in a flow diagram. The review categorizes 82 selected papers into three primary behavioral domains: emotional, social, and cognitive. Each paper undergoes meticulous examination, identifying objectives, algorithms, computational models, and applications. Natural language processing (NLP) emerges as a dominant text mining approach, utilized in over half of the literature, followed by data extraction, report arrangement, and clusterization. The study further employs VOSviewer to visualize the co-occurrence of the term "text mining," revealing prevalent associations and emphasizing the challenges in analyzing unstructured data efficiently. The article contributes to understanding the evolving landscape of behavior analysis through text mining, addressing the need for automated methods in evaluating individuals' attitudes, emotions, or performance. [ABSTRACT FROM AUTHOR]

Traditional news topic classification methods suffer from inaccurate text semantics, sparse text features, and low classification accuracy. Based on this, this paper proposes a news topic classification method based on Enhanced Language Representation with Informative Entities (ERNIE) and multi-feature fusion. A semantically more accurate representation of text embedding is obtained by ERNIE. In addition, this paper extracts word, context, and key sentence based on the news text. The key sentences of the news are obtained through the TextRank algorithm, which enables the model to focus on the content points of the news. Finally, this paper uses the attention mechanism to realize the fusion of multiple features. The proposed method is experimented on BBC News. The experimental results show that we achieve classification accuracies superior to those of the compared methods, while validating the structural validity of the proposed method. The method in this paper has a positive effect on promoting the research of news topic classification. [ABSTRACT FROM AUTHOR]

The Parker-Oldenburg method, as a classical frequency-domain algorithm, has been widely used in Moho topographic inversion. The method has two indispensable hyperparameters, which are the Moho density contrast and the average Moho depth. Accurate hyperparameters are important prerequisites for inversion of fine Moho topography. However, limited by the nonlinear terms, the hyperparameters estimated by previous methods have obvious deviations. For this reason, this paper proposes a new method to improve the existing ParkerOldenburg method by taking advantage of the invasive weed optimization algorithm in estimating hyperparameters. The synthetic test results of the new method show that, compared with the trial and error method and the linear regression method, the new method estimates the hyperparameters more accurately, and the computational efficiency performs excellently, which lays the foundation for the inversion of more accurate Moho topography. In practice, the method is applied to the Moho topographic inversion in the South China Sea. With the constraints of available seismic data, the crust-mantle density contrast and the average Moho depth in the South China Sea are determined to be 0.535 g/cm3 and 21.63 km, respectively, and the Moho topography of the South China Sea is inverted based on this. The results of the Moho topography show that the Moho depth in the study area ranges from 5.7 km to 32.3 km, with more obvious undulations. Among them, the shallowest part of the Moho topography is mainly located in the southern part of the Southwestern sub-basin and the southern part of the Manila Trench, with a depth of about 6 km. Compared with the CRUST 1.0 model and the model calculated by the improved Bott's method, the RMS between the Moho model and the seismic point difference in this paper is smaller, which proves that the method in this paper has some advantages in Moho topographic inversion. [ABSTRACT FROM AUTHOR]

Data anomaly detection in small hydropower stations is an important research area because it positively affects the reliability of optimal scheduling and subsequent analytical studies of small hydropower station clusters. Although many anomaly detection algorithms have been introduced in the data preprocessing stage in various research areas, there is still little research on effective and highly reliable anomaly detection systems for practical applications in small hydropower stations. Therefore, this paper proposes a real‐time data anomaly detection system for small hydropower clusters (RDADS‐SHC) considering multiple time series. It addresses the difficulties of timely detection, alerting, and management of real‐time data anomalies (errors, omissions, and so on) in existing small hydropower stations. It proposes a real‐time data anomaly detection algorithm for small hydropower stations integrated with the Z‐score and dynamic time warping, which can detect and process abnormal information more accurately and efficiently, thereby improving the stability and reliability of data sampling. The paper proposes a Keepalived‐based hot‐standby RDADS‐SHC deployment model with m (m ≥ 2) units. It can automatically remove and restart faulty services and switch to their standbys, which significantly improve the reliability of the proposed system, ensuring the safe and stable operation of related functional services. This paper can detect anomalous data more accurately, and the system is more stable and reliable in a cluster detection environment. The actual operation has shown that compared with existing anomaly detection systems, the architecture and algorithms proposed in this paper can detect anomalous data more accurately, and the system is more stable and reliable in the small hydropower cluster detection environment. It solves abnormal data management in small hydropower stations and provides reliable support for subsequent analysis and decision‐making. [ABSTRACT FROM AUTHOR]

There has been growing attention to multi-class classification problems, particularly those challenges of imbalanced class distributions. To address these challenges, various strategies, including data-level re-sampling treatment and ensemble methods, have been introduced to bolster the performance of predictive models and Artificial Intelligence (AI) algorithms in scenarios where excessive level of imbalance is present. While most research and algorithm development have been focused on binary classification problems, in health informatics there is an increased interest in the field to address the problem of multi-class classification in imbalanced datasets. Multi-class imbalance problems bring forth more complex challenges, as a delicate approach is required to generate synthetic data and simultaneously maintain the relationship between the multiple classes. The aim of this review paper is to examine over-sampling methods tailored for medical and other datasets with multi-class imbalance. Out of 2,076 peer-reviewed papers identified through searches, 197 eligible papers were chosen and thoroughly reviewed for inclusion, narrowing to 37 studies being selected for in-depth analysis. These studies are categorised into four categories: metric, adaptive, structure-based, and hybrid approaches. The most significant finding is the emerging trend toward hybrid resampling methods that combine the strengths of various techniques to effectively address the problem of imbalanced data. This paper provides an extensive analysis of each selected study, discusses their findings, and outlines directions for future research. [ABSTRACT FROM AUTHOR]

As an indispensable part of the vehicle environment perception task, road traffic marking detection plays a vital role in correctly understanding the current traffic situation. However, the existing traffic marking detection algorithms still have some limitations. Taking lane detection as an example, the current detection methods mainly focus on the location information detection of lane lines, and they only judge the overall attribute of each detected lane line instance, thus lacking more fine-grained dynamic detection of lane line attributes. In order to meet the needs of intelligent vehicles for the dynamic attribute detection of lane lines and more perfect road environment information in urban road environment, this paper constructs a fine-grained attribute detection method for lane lines, which uses pixel-level attribute sequence points to describe the complete attribute distribution of lane lines and then matches the detection results of the lane lines. Realizing the attribute judgment of different segment positions of lane instances is called the fine-grained attribute detection of lane lines (Lane-FGA). In addition, in view of the lack of annotation information in the current open-source lane data set, this paper constructs a lane data set with both lane instance information and fine-grained attribute information by combining manual annotation and intelligent annotation. At the same time, a cyclic iterative attribute inference algorithm is designed to solve the difficult problem of lane attribute labeling in areas without visual cues such as occlusion and damage. In the end, the average accuracy of the proposed algorithm reaches 97% on various types of lane attribute detection. [ABSTRACT FROM AUTHOR]

To enhance the diversity and distribution uniformity of initial population, as well as to avoid local extrema in the Chimp Optimization Algorithm (CHOA), this paper improves the CHOA based on chaos initialization and Cauchy mutation. First, Sin chaos is introduced to improve the random population initialization scheme of the CHOA, which not only guarantees the diversity of the population, but also enhances the distribution uniformity of the initial population. Next, Cauchy mutation is added to optimize the global search ability of the CHOA in the process of position (threshold) updating to avoid the CHOA falling into local optima. Finally, an improved CHOA was formed through the combination of chaos initialization and Cauchy mutation (CICMCHOA), then taking fuzzy Kapur as the objective function, this paper applied CICMCHOA to natural and medical image segmentation, and compared it with four algorithms, including the improved Satin Bowerbird optimizer (ISBO), Cuckoo Search (ICS), etc. The experimental results deriving from visual and specific indicators demonstrate that CICMCHOA delivers superior segmentation effects in image segmentation. [ABSTRACT FROM AUTHOR]

The efficient and accurate identification of traffic signs is crucial to the safety and reliability of active driving assistance and driverless vehicles. However, the accurate detection of traffic signs under extreme cases remains challenging. Aiming at the problems of missing detection and false detection in traffic sign recognition in fog traffic scenes, this paper proposes a recognition algorithm for traffic signs based on pix2pixHD+YOLOv5-T. Firstly, the defogging model is generated by training the pix2pixHD network to meet the advanced visual task. Secondly, in order to better match the defogging algorithm with the target detection algorithm, the algorithm YOLOv5-Transformer is proposed by introducing a transformer module into the backbone of YOLOv5. Finally, the defogging algorithm pix2pixHD is combined with the improved YOLOv5 detection algorithm to complete the recognition of traffic signs in foggy environments. Comparative experiments proved that the traffic sign recognition algorithm proposed in this paper can effectively reduce the impact of a foggy environment on traffic sign recognition. Compared with the YOLOv5-T and YOLOv5 algorithms in moderate fog environments, the overall improvement of this algorithm is achieved. The precision of traffic sign recognition of the algorithm in the fog traffic scene reached 78.5%, the recall rate was 72.2%, and mAP@0.5 was 82.8%. [ABSTRACT FROM AUTHOR]

To enhance the performance of microwave power transmission (MPT) systems' transmitting arrays, it is essential to comprehensively consider key factors such as beam collection efficiency (BCE), the level of sidelobes outside the reception area (CSL), and expense. Current transmitting array models commonly suffer from issues like low BCE, a large number of array elements, and complex feeding systems. Addressing these issues, this paper proposes a novel transmitting array design referred to as Large Spacing Nonuniform-Excitation Sparse Planar Array (LSNSPA) and introduces a new subarray partitioning algorithm named Multi-Parameter Dynamic Weight Particle Swarm Optimization for Rectangular Subarrays (MP-DWPSO-RS). The algorithm is capable of optimizing the subarray structure, as well as the element positions and excitations, during each iteration. This paper achieves a relatively higher BCE metric than other arrays by utilizing only a small number of subarrays, through the combination of a large-spacing distribution strategy and a subarray partitioning strategy. Simulations have verified that the proposed MP-DWPSO-RS algorithm can achieve a BCE of nearly 94% when optimizing the LSNSPA with an aperture of 4.5λ x 4.5λ consisting of 8 x 8 elements. [ABSTRACT FROM AUTHOR]

Efficient maritime search and rescue (SAR) is crucial for responding to maritime emergencies. In traditional SAR, fixed search path planning is inefficient and cannot prioritize high-probability regions, which has significant limitations. To solve the above problems, this paper proposes unmanned surface vehicles (USVs) path planning for maritime SAR based on POS-DQN so that USVs can perform SAR tasks reasonably and efficiently. Firstly, the search region is allocated as a whole using an improved task allocation algorithm so that the task region of each USV has priority and no duplication. Secondly, this paper considers the probability of success (POS) of the search environment and proposes a POS-DQN algorithm based on deep reinforcement learning. This algorithm can adapt to the complex and changing environment of SAR. It designs a probability weight reward function and trains USV agents to obtain the optimal search path. Finally, based on the simulation results, by considering the complete coverage of obstacle avoidance and collision avoidance, the search path using this algorithm can prioritize high-probability regions and improve the efficiency of SAR. [ABSTRACT FROM AUTHOR]

To address the challenges of missed detections in water surface target detection using solely visual algorithms in unmanned surface vehicle (USV) perception, this paper proposes a method based on the fusion of visual and LiDAR point-cloud projection for water surface target detection. Firstly, the visual recognition component employs an improved YOLOv7 algorithm based on a self-built dataset for the detection of water surface targets. This algorithm modifies the original YOLOv7 architecture to a Slim-Neck structure, addressing the problem of excessive redundant information during feature extraction in the original YOLOv7 network model. Simultaneously, this modification simplifies the computational burden of the detector, reduces inference time, and maintains accuracy. Secondly, to tackle the issue of sample imbalance in the self-built dataset, slide loss function is introduced. Finally, this paper replaces the original Complete Intersection over Union (CIoU) loss function with the Minimum Point Distance Intersection over Union (MPDIoU) loss function in the YOLOv7 algorithm, which accelerates model learning and enhances robustness. To mitigate the problem of missed recognitions caused by complex water surface conditions in purely visual algorithms, this paper further adopts the fusion of LiDAR and camera data, projecting the three-dimensional point-cloud data from LiDAR onto a two-dimensional pixel plane. This significantly reduces the rate of missed detections for water surface targets. [ABSTRACT FROM AUTHOR]

This paper focuses on the problem of information source identification in online social networks (OSNs). By analyzing the research situation of source identification problems and challenges (such as the randomness of the information dissemination process and complexity of the underlying network topology), this paper studies the problem of multiple source diffusion and proposes a source identification algorithm based on multi-attribute topological clustering (MaTC). The basic idea of the algorithm is to decompose the multi-source problems into a series of single-source problems by using clustering partitioning to improve accuracy and efficiency. Firstly, it estimates the number of source nodes, which is also the number of network partitions, then characterizes the combination of multiple attribute structures as an attribute index of topological clustering, performs an analysis of the distribution of real source nodes in each partition to evaluate the accuracy of the clustering partition, and finally uses Jordan centrality within each partition for single-source identification. Through comparative experiments, it is verified that the proposed MaTC algorithm is superior to the comparison algorithms in evaluating indicators. [ABSTRACT FROM AUTHOR]

Diagnosing multi-stage diseases typically requires doctors to consider multiple data sources, including clinical symptoms, physical signs, biochemical test results, imaging findings, pathological examination data, and even genetic data. When applying machine learning modeling to predict and diagnose multi-stage diseases, several challenges need to be addressed. Firstly, the model needs to handle multimodal data, as the data used by doctors for diagnosis includes image data, natural language data, and structured data. Secondly, privacy of patients' data needs to be protected, as these data contain the most sensitive and private information. Lastly, considering the practicality of the model, the computational requirements should not be too high. To address these challenges, this paper proposes a privacy-preserving federated deep learning diagnostic method for multi-stage diseases. This method improves the forward and backward propagation processes of deep neural network modeling algorithms and introduces a homomorphic encryption step to design a federated modeling algorithm without the need for an arbiter. It also utilizes dedicated integrated circuits to implement the hardware Paillier algorithm, providing accelerated support for homomorphic encryption in modeling. Finally, this paper designs and conducts experiments to evaluate the proposed solution. The experimental results show that in privacy-preserving federated deep learning diagnostic modeling, the method in this paper achieves the same modeling performance as ordinary modeling without privacy protection, and has higher modeling speed compared to similar algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of distributed generation (DG) within the framework of modern power systems, accurately assessing the maximum DG hosting capacity in distribution networks is crucial for ensuring the safe and stable operation of the power grid. This paper first introduces an assessment model of maximum DG hosting capacity in distribution network based on optimal power flow (OPF). Then, a two-step method that combines the linearization method and the recursive method is proposed, which consists of two parts: firstly, using linearization method to quickly calculate the preliminary assessment value of maximum DG hosting capacity, and then using a recursive method to accurately correct the preliminary assessment value. Additionally, the proposed improved comprehensive sensitivity index and safety constraint verification method can enhance the computational efficiency and accuracy of the recursive algorithm. Finally, the proposed methods were simulated and validated on the IEEE 33-bus system. [ABSTRACT FROM AUTHOR]

With the rapid development of the economy and society, the demand for power quality is constantly increasing. As a crucial part of grid situational awareness, distribution network state estimation plays a vital role in providing critical data support for other advanced applications, which is significant for ensuring the safe and reliable operation of the distribution network. Therefore, this paper proposes a dynamic state awareness method for distribution networks based on the robust adaptive cubature Kalman filter (RACKF). The proposed solution, grounded on the core computational concept of the cubature Kalman filter (CKF), constructs a robust noise statistical estimator (NSE) composed of a biased NSE and an unbiased NSE to adapt to the unknown and time-varying process noise parameters in the dynamic state estimation process. The proposed solution can ensure that the calculated process noise parameters always meet the constraints and guarantee the robustness of the algorithm. In addition, an estimation strategy for the fusion of multi-time scale measurement data is developed according to the RACKF-based dynamic state estimation features in order to realize system state corrections and updates. The results of simulation experiments and comparisons with traditional CKF methods demonstrate the accuracy and superiority of the proposed solution. [ABSTRACT FROM AUTHOR]

In the field of automatic bulk material loading, accurate detection of the profile of the material pile in the compartment can control its height and distribution, thus improving the loading efficiency and stability, therefore, this paper proposes a new method for pile detection based on cross-source point cloud registration. First, 3D point cloud data are simultaneously collected using lidar and binocular camera. Second, feature points are extracted and described based on 3D scale-invariant features and 3D shape contexts algorithms, and then feature points are used in progressive sample consensus algorithm to complete coarse matching. Then, bi-directional KD-tree accelerated iterative closest point is established to complete the fine registration. Ultimately, the detection of the pile contour is realized by extracting the point cloud boundary after the registration. The experimental results show that the registration errors of this method are reduced by 54.2%, 52.4%, and 14.9% compared with the other three algorithms, and the relative error of the pile contour detection is less than 0.2%. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the AAPF* algorithm, an innovative approach that synergistically integrates the A-star search algorithm (A*) with the artificial potential field (APF) method. This algorithm is designed to enhance safety and ensure smoother global path planning for autonomous vehicles, particularly addressing vehicle cornering constraints. Initially, for augmenting the safety of autonomous vehicle, we implement an obstacle expansion strategy with a factor of 2 units, enhancing environmental adaptability. The study then delves into the classical A* algorithm, examining its core principles and characteristics, leading to the development of novel heuristic functions and search strategies that address the limitations inherent in the classic A* algorithm. Subsequently, we explore the APF algorithm, recognized for its excellence in obstacle avoidance in path planning. The paper culminates in the amalgamation of the APF's repulsive field concept with the improved A* algorithm, crafting a comprehensive global planning algorithm tailored for autonomous vehicle path planning schemes. Experiments conducted in a simulated environment model validate the AAPF* algorithm's efficacy in improving both the safety and smoothness, demonstrating its potential for real-world applications. [ABSTRACT FROM AUTHOR]

The widespread adoption of nonlinear power electronic devices in residential settings has significantly increased the stochasticity and uncertainty of power systems. The original load power data, characterized by numerous irregular, random, and probabilistic components, adversely impacts the predictive performance of deep learning techniques, particularly neural networks. To address this challenge, this paper proposes a time-series probabilistic load power prediction technique based on the mature neural network point prediction technique, i.e., decomposing the load power data into deterministic and stochastic components. The deterministic component is predicted using deep learning neural network technology, the stochastic component is fitted with Gaussian mixture distribution model and the parameters are fitted using great expectation algorithm, after which the stochastic component prediction data is obtained using the stochastic component generation method. Using a mature neural network point prediction technique, the study evaluates six different deep learning methods to forecast residential load power. By comparing the prediction errors of these methods, the optimal model is identified, leading to a substantial improvement in prediction accuracy. [ABSTRACT FROM AUTHOR]

In this paper, we proposed the distributed quantization and sparsity aware zero attracting least mean square (DQA‐ZA‐LMS) and its reweighted version (DQA‐RZA‐LMS) algorithms that can perform sparse spectrum sensing with the lowest power possible. The usage of the quantization aware diffusion adaptive networks has recently been proposed and they can be used in many possible mobile communicative applications. The sparsity aware feature of the proposed algorithm can help the network to track and estimate sparse random vectors that are shown to be the case with the spectrum of the new generation wireless communication systems such as 4G, 5G, 6G, and beyond. The spectrum sensing is considered in this paper to be performed by small cell eNode Bs (SC‐eNBs) for the 4th generation long term evolution (LTE) and the next generation eNB (ng‐eNB) networks for the 5th and 6th generation mobile communication systems that are scattered in an area collecting distributed quantized data from the environment and working collaboratively to estimate the sparse spectrum vectors. Our findings show that in comparison with the nonquantized version of the distributed ZA‐LMS (DZA‐LMS) and distributed regularized ZA‐LMS (DRZA‐LMS) algorithms, our proposed schemes perform considerably well using the quantized data and also reduce power consumption. [ABSTRACT FROM AUTHOR]

Archaeological illustration is a graphic recording technique that delineates the shape, structure, and ornamentation of cultural artifacts using lines, serving as vital material in archaeological work and scholarly research. Aiming at the problems of low line accuracy in the results of current mainstream image generation algorithms and interference caused by severe mural damage, this paper proposes a mural archaeological illustration generation algorithm based on multi-branch feature cross fusion (U2FGAN). The algorithm optimizes skip connections in U2Net through a channel attention mechanism, constructing a multi-branch generator consisting of a line extractor and an edge detector, which separately identify line features and edge information in artifact images before fusing them to generate accurate, high-resolution illustrations. Additionally, a multi-scale conditional discriminator is incorporated to guide the generator in outputting high-quality illustrations with clear details and intact structures. Experiments conducted on the Dunhuang mural illustration datasets demonstrate that compared to mainstream counterparts, U2FGAN reduced the Mean Absolute Error (MAE) by 10.8% to 26.2%, while also showing substantial improvements in Precision (by 9.8% to 32.3%), Fβ-Score (by 5.1% to 32%), and PSNR (by 0.4 to 2.2 dB). The experimental results show that the proposed method outperforms other mainstream algorithms in archaeological illustration generation. [ABSTRACT FROM AUTHOR]

At present, there is a growing emphasis on safeguarding image data, yet conventional encryption methods are full of numerous limitations. In order to tackle the limitations of conventional color image encryption methodologies, such as inefficiency and insufficient security, this paper designs an expedited encryption method for color images that uses DNA coding in conjunction with multiple chaotic systems. The encryption algorithm proposed in this paper is based on three-dimensional permutation, global scrambling, one-dimensional diffusion and DNA coding. First of all, the encryption algorithm uses three-dimensional permutation algorithms to scramble the image, which disrupts the high correlation among the image pixels. Second, the RSA algorithm and the SHA-256 hashing algorithm are utilized to derive the starting value necessary for the chaotic system to produce the key. Third, the image is encrypted by using global scrambling and one-dimensional diffusion. Finally, DNA coding rules are used to perform DNA computing. The experimental results indicate that the encryption scheme exhibits a relatively weak inter-pixel correlation, uniform histogram distribution, and an information entropy value approaching eight. This shows that the proposed algorithm is able to protect the image safely and efficiently. [ABSTRACT FROM AUTHOR]

When multi-dynamic target UAVs escape, the uncertainty of the formation method and the external environment causes difficulties in rounding them up, so suitable solutions are needed to improve the roundup success rate. However, traditional methods can generally only enable the encirclement of a single target, and when the target is scattered and escaping, this will lead to encirclement failure due to the inability to sufficiently allocate UAVs for encirclement. Therefore, in this paper, a real-time roundup and dynamic allocation algorithm for multiple dynamic targets is proposed. A real-time dynamic obstacle avoidance model is established for the roundup problem, drawing on the artificial potential field function. For the escape problem of the rounding process, an optimal rounding allocation strategy is established by drawing on the linear matching method. The algorithm in this paper simulates the UAV in different obstacle environments to round up dynamic targets with different escape methods. The results show that the algorithm is able to achieve the rounding up of multiple dynamic targets in a UAV and obstacle scenario with random initial positions, and the task UAV, which is able to avoid obstacles, can be used in other algorithms for real-time rounding up and dynamic allocation. The results show that the algorithm is able to achieve the rounding up of multi-dynamic targets in scenarios with a random number of UAVs and obstacles with random locations. It results in a 50% increase in the rounding efficiency and a 10-fold improvement in the formation success rate. And the mission UAV is able to avoid obstacles, which can be used in other algorithms for real-time roundup and dynamic allocation. [ABSTRACT FROM AUTHOR]

As unmanned vehicle technology advances rapidly, obstacle recognition and target detection are crucial links, which directly affect the driving safety and efficiency of unmanned vehicles. In response to the inaccurate localization of small targets such as pedestrians in current object detection tasks and the problem of losing local features in the PointPillars, this paper proposes a three-dimensional object detection method based on improved PointPillars. Firstly, addressing the issue of lost spatial and local information in the PointPillars, the feature encoding part of the PointPillars is improved, and a new pillar feature enhancement extraction module, CSM-Module, is proposed. Channel encoding and spatial encoding are introduced in the new pillar feature enhancement extraction module, fully considering the spatial information and local detailed geometric information of each pillar, thereby enhancing the feature representation capability of each pillar. Secondly, based on the fusion of CSPDarknet and SENet, a new backbone network CSE-Net is designed in this paper, enabling the extraction of rich contextual semantic information and multi-scale global features, thereby enhancing the feature extraction capability. Our method achieves higher detection accuracy when validated on the KITTI dataset. Compared to the original network, the improved algorithm's average detection accuracy is increased by 3.42%, it shows that the method is reasonable and valuable. [ABSTRACT FROM AUTHOR]