Search

Accurately predicting the trajectory of carbon emissions is vital for achieving a sustainable shift toward a green and low-carbon future. Hence, this paper created a novel model to examine the driver analysis and integrated prediction for Chinese carbon emission, a large carbon-emitting country. The logarithmic mean divisia index (LMDI) approach initially served to decompose the drivers of carbon emissions, analyzing the annual and staged contributions of these factors. Given the non-stationarity and non-linear characteristics in the data sequence of carbon emissions, a decomposition–integration prediction model was proposed. The model employed the empirical mode decomposition (EMD) model to decompose each set of data into a series of components. The various carbon emission components were anticipated using the long short-term memory (LSTM) model based on the deconstructed impacting factors. The aggregate of these predicted components constituted the overall forecast for carbon emissions. The result indicates that the EMD-LSTM model greatly decreased prediction errors over the other comparable models. This paper makes up for the gap in existing research by providing further analysis based on the LMDI method. Additionally, it innovatively incorporates the EMD method into the carbon emission study, and the proposed EMD-LSTM prediction model effectively addresses the volatility characteristics of carbon emissions and demonstrates excellent predictive performance in carbon emission prediction. [ABSTRACT FROM AUTHOR]

Self-supervised learning is a new machine learning method that does not rely on manually labeled data, and learns from rich unlabeled data itself by designing agent tasks using the input data as supervision to obtain a more generalized representation for application in downstream tasks. However, the current self-supervised learning suffers from the problem of relying on the selection and number of negative samples and the problem of sample bias phenomenon after graph data augmentation. In this paper, we investigate the above problems and propose a corresponding solution, proposing a graph contrastive learning algorithm without negative samples. The model uses matrix sketching in the implicit space for feature augmentation to reduce sample bias and iteratively trains the mutual correlation matrix of two viewpoints by drawing closer to the distance of the constant matrix as the objective function. This method does not require techniques such as negative samples, gradient stopping, and momentum updating to prevent self-supervised model collapse. This method is compared with 10 graph representation learning algorithms on four datasets for node classification tasks, and the experimental results show that the algorithm proposed in this paper achieves good results. [ABSTRACT FROM AUTHOR]

The level of difficulty of mathematical test items is a critical aspect for evaluating test quality and educational outcomes. Accurately predicting item difficulty during test creation is thus significantly important for producing effective test papers. This study used more than ten years of content and score data from China's Henan Provincial College Entrance Examination in Mathematics as an evaluation criterion for test difficulty, and all data were obtained from the Henan Provincial Department of Education. Based on the framework established by the National Center for Education Statistics (NCES) for test item assessment methodology, this paper proposes a new framework containing eight features considering the uniqueness of mathematics. Next, this paper proposes an XGBoost-based SHAP model for analyzing the difficulty of mathematics tests. By coupling the XGBoost method with the SHAP method, the model not only evaluates the difficulty of mathematics tests but also analyzes the contribution of specific features to item difficulty, thereby increasing transparency and mitigating the "black box" nature of machine learning models. The model has a high prediction accuracy of 0.99 for the training set and 0.806 for the test set. With the model, we found that parameter-level features and reasoning-level features are significant factors influencing the difficulty of subjective items in the exam. In addition, we divided senior secondary mathematics knowledge into nine units based on Chinese curriculum standards and found significant differences in the distribution of the eight features across these different knowledge units, which can help teachers place different emphasis on different units during the teaching process. In summary, our proposed approach significantly improves the accuracy of item difficulty prediction, which is crucial for intelligent educational applications such as knowledge tracking, automatic test item generation, and intelligent paper generation. These results provide tools that are better aligned with and responsive to students' learning needs, thus effectively informing educational practice. [ABSTRACT FROM AUTHOR]

In recent years, many mobile edge computing network solutions have enhanced data privacy and security and built a trusted network mechanism by introducing blockchain technology. However, this also complicates the task-offloading problem of blockchain-enabled mobile edge computing, and traditional evolutionary learning and single-agent reinforcement learning algorithms are difficult to solve effectively. In this paper, we propose a blockchain-enabled mobile edge computing task-offloading strategy based on multi-agent reinforcement learning. First, we innovatively propose a blockchain-enabled mobile edge computing task-offloading model by comprehensively considering optimization objectives such as task execution energy consumption, processing delay, user privacy metrics, and blockchain incentive rewards. Then, we propose a deep reinforcement learning algorithm based on multiple agents sharing a global memory pool using the actor–critic architecture, which enables each agent to acquire the experience of another agent during the training process to enhance the collaborative capability among agents and overall performance. In addition, we adopt attenuatable Gaussian noise into the action space selection process in the actor network to avoid falling into the local optimum. Finally, experiments show that this scheme's comprehensive cost calculation performance is enhanced by more than 10% compared with other multi-agent reinforcement learning algorithms. In addition, Gaussian random noise-based action space selection and a global memory pool improve the performance by 38.36% and 43.59%, respectively. [ABSTRACT FROM AUTHOR]

Learning linear and nonlinear dynamical systems from available data is a timely topic in scientific machine learning. Learning must be performed while enforcing the numerical stability of the learned model, the existing knowledge within an informed or augmented setting, or by taking into account the multiscale dynamics—for both linear and nonlinear dynamics. However, when the final objective of such a learned dynamical system is to be used for control purposes, learning transformed dynamics can be advantageous. Therefore, many alternatives exists, and the present paper focuses on two of them: the first based on the discovery and use of the so-called flat control and the second one based on the use of the Koopman theory. The main contributions when addressing the first is the discovery of the flat output transformation by using an original neural framework. Moreover, when using the Koopman theory, this paper proposes an original procedure for learning parametric dynamics in the latent space, which is of particular interest in control-based engineering applications. [ABSTRACT FROM AUTHOR]

Vehicle re-identification employs computer vision to determine the presence of specific vehicles in images or video sequences, often using vehicle appearance for identification due to the challenge of capturing complete license plate information. Addressing the performance issues caused by fog, such as image blur and loss of key positional information, this paper introduces a multi-task learning framework incorporating a multi-scale fusion defogging method (MsF). This method effectively mitigates image blur to produce clearer images, which are then processed by the re-identification branch. Additionally, a phase attention mechanism is introduced to adaptively preserve crucial details. Utilizing advanced artificial intelligence techniques and deep learning algorithms, the framework is evaluated on both synthetic and real datasets, showing significant improvements in mean average precision (mAP)—an increase of 2.5% to 87.8% on the synthetic dataset and 1.4% to 84.1% on the real dataset. These enhancements demonstrate the method's superior performance over the semi-supervised joint defogging learning (SJDL) model, particularly under challenging foggy conditions, thus enhancing vehicle re-identification accuracy and deepening the understanding of applying multi-task learning frameworks in adverse visual environments. [ABSTRACT FROM AUTHOR]

Nowadays, accurate and efficient short-term traffic flow forecasting plays a critical role in intelligent transportation systems (ITS). However, due to the fact that traffic flow is susceptible to factors such as weather and road conditions, traffic flow data tend to exhibit dynamic uncertainty and nonlinearity, making the construction of a robust and reliable forecasting model still a challenging task. Aiming at this nonlinear and complex traffic flow forecasting problem, this paper constructs a short-term traffic flow forecasting hybrid optimization model, SSA-ELM, based on extreme learning machine by embedding the sparrow search algorithm in order to solve the above problem. Extreme learning machine has been widely used in short-term traffic flow forecasting due to its characteristics such as low computational complexity and fast learning speed. By using the sparrow search algorithm to optimize the input weight values and hidden layer deviations in the extreme learning machine, the sparrow search algorithm is utilized to search for the global optimal solution while taking into account the original characteristics of the extreme learning machine, so that the model improves stability while increasing prediction accuracy. Experimental results on the Amsterdam A10 road traffic flow dataset show that the traffic flow forecasting model proposed in this paper has higher forecasting accuracy and stability, revealing the potential of hybrid optimization models in the field of short-term traffic flow forecasting. [ABSTRACT FROM AUTHOR]

Although numerous machine learning models have been developed for NLP applications, recently, deep learning approaches have achieved remarkable results across many NLP tasks. Natural language processing (NLP) is one of the most important technologies in use today, especially due to the large and growing amount of online text, which needs to be understood in order to fully ascertain its enormous value. Extensive experiments are conducted using the E-Khool dataset and the Coursera course dataset, with empirical results demonstrating that the proposed Taylor ChOA-based RMDL model significantly outperforms state-of-the-art methods for course recommendation tasks. Preface to the Special Issue "Natural Language Processing (NLP) and Machine Learning (ML) - Theory and Applications". [Extracted from the article]

Digital twin is the digital representation of an entity, and it drives Industry 4.0. This paper presents a bibliometric analysis of digital twin in the supply chain to help researchers, industry practitioners, and academics to understand the trend, development, and focus of the areas of digital twin in the supply chain. This paper found several key clusters of research, including the designing of a digital twin model, integration of a digital twin model, application of digital twin in quality control, and digital twin in digitalization. In the embryonic stage of research, digital twin was tested in the production line with limited optimization. In the development stage, the importance of digital twin in Industry 4.0 was observed, as big data, machine learning, Industrial Internet of Things, blockchain, edge computing, and cloud-based systems complemented digital twin models. Digital twin was applied to improve sustainability in manufacturing and production logistics. In the current prosperity stage with high annual publications, the recent trends of this topic focus on the integration of deep learning, data models, and artificial intelligence for digitalization. This bibliometric analysis also found that the COVID-19 pandemic drove the start of the prosperity stage of digital twin research in the supply chain. Researchers in this field are slowly moving towards applying digital twin for human-centric systems and mass personalization to prepare to transit to Industry 5.0. [ABSTRACT FROM AUTHOR]

This paper presents a literature review in which methodologies employed for the forecast of the price of stock companies and raw materials in the fields of electricity, oil, gas and energy are studied. This research also makes an analysis of which data variables are employed for training the forecasting models. Three scientific databases were consulted to perform the present research: The Directory of Open Access Journals, the Multidisciplinary Digital Publishing Institute and the Springer Link. After running the same query in the three databases and considering the period from January 2017 to December 2021, a total of 1683 articles were included in the analysis. Of these, only 13 were considered relevant for the topic under study. The results obtained showed that when compared with other areas, few papers focus on the forecasting of the prices of raw materials and stocks of companies in the field under study. Furthermore, most make use of either machine learning methodologies or time series analysis. Finally, it is also remarkable that some not only make use of existing algorithms but also develop and test new methodologies. [ABSTRACT FROM AUTHOR]

Pattern recognition systems always misclassify anomalies, which can be dangerous for uninformed users. Therefore, anomalies must be filtered out from each classification. The main challenge for the anomaly filter design is the huge number of possible anomaly samples compared with the number of samples in the training set. Tailoring the filter for the given classifier is just the first step in this reduction. Paper tests the hypothesis that the filter trained in avoiding "near" anomalies will also refuse the "far" anomalies, and the anomaly detector is then just a classifier distinguishing between "far real" and "near anomaly" samples. As a "far real" samples generator was used, a Generative Adversarial Network (GAN) fake generator that transforms normally distributed random seeds into fakes similar to the training samples. The paper proves the assumption that seeds unused in fake training will generate anomalies. These seeds are distinguished according to their Chebyshev norms. While the fakes have seeds within the hypersphere with a given radius, the near anomalies have seeds within the sphere near cover. Experiments with various anomaly test sets have shown that GAN-based anomaly detectors create a reliable anti-anomaly shield using the abovementioned assumptions. The proposed anomaly detector is tailored to the given classifier, but its limitation is due to the need for the availability of the database on which the classifier was trained. [ABSTRACT FROM AUTHOR]

Accurately predicting the price of carbon is an effective way of ensuring the stability of the carbon trading market and reducing carbon emissions. Aiming at the non-smooth and non-linear characteristics of carbon price, this paper proposes a novel hybrid prediction model based on improved feature extraction and non-linear integration, which is built on complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN), fuzzy entropy (FuzzyEn), improved random forest using particle swarm optimisation (PSORF), extreme learning machine (ELM), long short-term memory (LSTM), non-linear integration based on multiple linear regression (MLR) and random forest (MLRRF), and error correction with the autoregressive integrated moving average model (ARIMA), named CEEMDAN-FuzzyEn-PSORF-ELM-LSTM-MLRRF-ARIMA. Firstly, CEEMDAN is combined with FuzzyEn in the feature selection process to improve extraction efficiency and reliability. Secondly, at the critical prediction stage, PSORF, ELM, and LSTM are selected to predict high, medium, and low complexity sequences, respectively. Thirdly, the reconstructed sequences are assembled by applying MLRRF, which can effectively improve the prediction accuracy and generalisation ability. Finally, error correction is conducted using ARIMA to obtain the final forecasting results, and the Diebold–Mariano test (DM test) is introduced for a comprehensive evaluation of the models. With respect to carbon prices in the pilot regions of Shenzhen and Hubei, the results indicate that the proposed model has higher prediction accuracy and robustness. The main contributions of this paper are the improved feature extraction and the innovative combination of multiple linear regression and random forests into a non-linear integrated framework for carbon price forecasting. However, further optimisation is still a work in progress. [ABSTRACT FROM AUTHOR]

With the development of artificial intelligence (AI), deep learning is widely used in various industries. At CRYPTO 2019, researchers used deep learning to analyze the block cipher for the first time and constructed a differential neural network distinguisher to meet a certain accuracy. In this paper, a mixture differential neural network distinguisher using ResNet is proposed to further improve the accuracy by exploring the mixture differential properties. Experiments are conducted on SIMON32/64, and the accuracy of the 8-round mixture differential neural network distinguisher is improved from 74.7% to 92.3%, compared with that of the previous differential neural network distinguisher. The prediction accuracy of the differential neural network distinguisher is susceptible to the choice of the specified input differentials, whereas the mixture differential neural network distinguisher is less affected by the input difference and has greater robustness. Furthermore, by combining the probabilistic expansion of rounds and the neutral bit, the obtained mixture differential neural network distinguisher is extended to 11 rounds, which can realize the 12-round actual key recovery attack on SIMON32/64. With an appropriate increase in the time complexity and data complexity, the key recovery accuracy of the mixture differential neural network distinguisher can be improved to 55% as compared to 52% of the differential neural network distinguisher. The mixture differential neural network distinguisher proposed in this paper can also be applied to other lightweight block ciphers. [ABSTRACT FROM AUTHOR]

This study investigates the integration of quantum circuits with classical neural networks for enhancing credit scoring for small- and medium-sized enterprises (SMEs). We introduce a hybrid quantum–classical model, focusing on the synergy between quantum and classical rather than comparing the performance of separate quantum and classical models. Our model incorporates a quantum layer into a traditional neural network, achieving notable reductions in training time. We apply this innovative framework to a binary classification task with a proprietary real-world classical credit default dataset for SMEs in Singapore. The results indicate that our hybrid model achieves efficient training, requiring significantly fewer epochs (350) compared to its classical counterpart (3500) for a similar predictive accuracy. However, we observed a decrease in performance when expanding the model beyond 12 qubits or when adding additional quantum classifier blocks. This paper also considers practical challenges faced when deploying such models on quantum simulators and actual quantum computers. Overall, our quantum–classical hybrid model for credit scoring reveals its potential in industry, despite encountering certain scalability limitations and practical challenges. [ABSTRACT FROM AUTHOR]

To address the cost and efficiency issues of manually analysing requirement dependency in requirements engineering, a requirement dependency extraction method based on part-of-speech features and an improved stacking ensemble learning model (P-Stacking) is proposed. Firstly, to overcome the problem of singularity in the feature extraction process, this paper integrates part-of-speech features, TF-IDF features, and Word2Vec features during the feature selection stage. The particle swarm optimization algorithm is used to allocate weights to part-of-speech tags, which enhances the significance of crucial information in requirement texts. Secondly, to overcome the performance limitations of standalone machine learning models, an improved stacking model is proposed. The Low Correlation Algorithm and Grid Search Algorithms are utilized in P-stacking to automatically select the optimal combination of the base models, which reduces manual intervention and improves prediction performance. The experimental results show that compared with the method based on TF-IDF features, the highest F1 scores of a standalone machine learning model in the three datasets were improved by 3.89%, 10.68%, and 21.4%, respectively, after integrating part-of-speech features and Word2Vec features. Compared with the method based on a standalone machine learning model, the improved stacking ensemble machine learning model improved F1 scores by 2.29%, 5.18%, and 7.47% in the testing and evaluation of three datasets, respectively. [ABSTRACT FROM AUTHOR]

Recent research has revealed that subtle imperceptible perturbations can deceive well-trained neural network models, leading to inaccurate outcomes. These instances, known as adversarial examples, pose significant threats to the secure application of machine learning techniques in safety-critical systems. In this paper, we delve into the study of one-pixel attacks in deep neural networks, recently reported as a kind of adversarial examples. To identify such one-pixel attacks, most existing methodologies rely on the differential evolution method, which utilizes random selection from the current population to escape local optima. However, the differential evolution technique might waste search time and overlook good solutions if the number of iterations is insufficient. Hence, in this paper, we propose a gradient ascent with momentum approach to efficiently discover good solutions for the one-pixel attack problem. As our method takes a more direct route to the goal compared to existing methods relying on blind random walks, it can effectively identify one-pixel attacks. Our experiments conducted on popular CNNs demonstrate that, in comparison with existing methodologies, our technique can detect one-pixel attacks significantly faster. [ABSTRACT FROM AUTHOR]

This correction notice provides updates and corrections to a research paper on deep machine learning model-based cyber-attacks detection in smart power systems. The paper proposes a deep learning-based attack detection model that addresses system disturbances caused by natural events and cyber-attacks. It discusses the use of principal component analysis (PCA) for feature selection and the potential of deep learning-based and decision tree classifiers for detecting cyber-attacks in intelligent energy grids. The notice also includes updates to references, clarifications on the experimental data set, and feature selection based on PCA. The study evaluates the effectiveness of the proposed model using various assessment indexes and compares it to conventional methods, concluding that the proposed model is effective in detecting cyber-attacks and demonstrates good performance in detecting destructive attacks. [Extracted from the article]

The problem of a stabilisation system synthesis for the motion of a control object along a given spatial trajectory is considered. The complexity of the problem is that the preset trajectory is defined in the state subspace and not in time. This paper describes a stabilisation system synthesis for motion along a trajectory specified in time and along a trajectory specified in the form of a manifold in a state space. In order to construct a stabilisation system, it is necessary to determine a distance between an object and the given trajectory at each moment in time. For trajectories that are not given in time, the determination of this distance can be ambiguous. An object may be exactly on a trajectory but at a different time. This paper proposes some approaches to solve the problem. One of the approaches is to transform a given trajectory in a state subspace into a trajectory given in time. A description of a universal method to perform this transformation is presented. In order to solve the synthesis problem automatically, without having to analyse the mathematical model of the control object, it is suggested that machine learning control by symbolic regression is used. In computational experiments, examples of stabilisation system syntheses for quadcopter motion along a given spatial trajectory are presented. [ABSTRACT FROM AUTHOR]

This paper presents a study of fork–join systems. The fork–join system breaks down each customer into numerous tasks and processes them on separate servers. Once all tasks are finished, the customer is considered completed. This design enables the efficient handling of customers. The customers enter the system in a MAP flow. This helps create a more realistic and flexible representation of how customers arrive. It is important for modeling various real-life scenarios. Customers are divided into K ≥ 2 tasks and assigned to different subsystems. The number of tasks matches the number of subsystems. Each subsystem has a server that processes tasks, and a buffer that temporarily stores tasks waiting to be processed. The service time of a task by the k-th server follows a PH (phase-type) distribution with an irreducible representation ( β k , S k ), 1 ≤ k ≤ K . An analytical solution was derived for the case of K = 2 when the input MAP flow and service time follow a PH distribution. We have efficient algorithms to calculate the stationary distribution and performance characteristics of the fork–join system for this case. In general cases, this paper suggests using a combination of Monte Carlo and machine learning methods to study the performance of fork–join systems. In this paper, we present the results of our numerical experiments. [ABSTRACT FROM AUTHOR]

Respiratory viruses, such as COVID-19, are spread over time and space based on human-to-human interactions. Human mobility plays a key role in the propagation of the virus. Different types of sensors in smart cities are able to continuously monitor traffic-related human mobility, showing the impact of COVID-19 on traffic volumes and patterns. In a similar way, traffic volumes measured by smart traffic sensors provide a proxy variable to capture human mobility, which is expected to have an impact on new COVID-19 infections. Adding traffic data from smart city sensors to machine learning models designed to estimate upcoming COVID-19 incidence values should provide optimized results compared to models based on COVID-19 data alone. This paper proposes a novel model to extract spatio-temporal patterns in the spread of the COVID-19 virus for short-term predictions by organizing COVID-19 incidence and traffic data as interrelated temporal sequences of spatial images. The model is trained and validated with real data from the city of Madrid in Spain for 84 weeks, combining information from 4372 traffic measuring points and 143 COVID-19 PCR test centers. The results are compared with a baseline model designed for the extraction of spatio-temporal patterns from COVID-19-only sequences of images, showing that using traffic information enhances the results when forecasting a new wave of infections (MSE values are reduced by a 70% factor). The information that traffic data has on the spread of the COVID-19 virus is also analyzed, showing that traffic data alone is not sufficient for accurate COVID-19 forecasting. [ABSTRACT FROM AUTHOR]

This paper describes the results from a study designed to illustrate the use of machine learning analytical techniques from a household consumer perspective. The outcome of interest in this study is a household's degree of financial preparedness as indicated by the presence of an emergency fund. In this study, six machine learning algorithms were evaluated and then compared to predictions made using a conventional regression technique. The selected ML algorithms showed better prediction performance. Among the six ML algorithms, Gradient Boosting, kNN, and SVM were found to provide the most robust degree of prediction and classification. This paper contributes to the methodological literature in consumer studies as it relates to household financial behavior by showing that when prediction is the main purpose of a study, machine learning techniques provide detailed yet nuanced insights into behavior beyond traditional analytic methods. [ABSTRACT FROM AUTHOR]

Elevators have become an integral part of modern buildings, and technological advances have enabled the monitoring of their operational status through sensor technology. In response to the development of the elevator industry and the need for practical elevator operation risk evaluation, this paper proposes an elevator risk evaluation method based on fuzzy theory and machine learning methods. The method begins by establishing an elevator operation risk evaluation index system. The traditional fuzzy comprehensive evaluation method is then employed to evaluate the risk levels of the 50 elevators studied. The collected index data and labels (fuzzy comprehensive evaluation results) are used as inputs to train the support vector machine (SVM) model. To optimize the SVM model, the maximum information coefficient method, enhanced by the correlation-based feature selection (MIC-CFS) method, is employed to select features for the index input to the SVM model. The improved gray wolf algorithm (IGWO) method optimizes the SVM. Finally, the model's performance is verified using new index data. The experimental results demonstrate that introducing machine learning methods for elevator risk evaluation saves time and effort while providing good accuracy compared to the traditional expert evaluation method. The optimization of the SVM model by IGWO and feature selection by the MIC-CFS method results in a more concise SVM model that converges faster during training, exhibits better stability, and achieves higher accuracy. [ABSTRACT FROM AUTHOR]

Current network representation learning models mainly use matrix factorization-based and neural network-based approaches, and most models still focus only on local neighbor features of nodes. Knowledge representation learning aims to learn low-dimensional dense representations of entities and relations from structured knowledge graphs, and most models use the triplets to capture semantic, logical, and topological features between entities and relations. In order to extend the generalization capability of the network representation learning models, this paper proposes a network representation learning algorithm based on multiple remodeling of node attributes named MRNR. The model constructs the knowledge triplets through the textual association relationships between nodes. Meanwhile, a novel co-occurrence word training method has been proposed. Multiple remodeling of node attributes can significantly improve the effectiveness of network representation learning. At the same time, MRNR introduces the attention mechanism to achieve the weight information for key co-occurrence words and triplets, which further models the semantic and topological features between entities and relations, and it makes the network embedding more accurate and has better generalization ability. [ABSTRACT FROM AUTHOR]

Healthcare cost is an issue of concern right now. While many complex machine learning algorithms have been proposed to analyze healthcare cost and address the shortcomings of linear regression and reliance on expert analyses, these algorithms do not take into account whether each characteristic variable contained in the healthcare data has a positive effect on predicting healthcare cost. This paper uses hybrid machine learning algorithms to predict healthcare cost. First, network structure learning algorithms (a score-based algorithm, constraint-based algorithm, and hybrid algorithm) for a Conditional Gaussian Bayesian Network (CGBN) are used to learn the isolated characteristic variables in healthcare data without changing the data properties (i.e., discrete or continuous). Then, the isolated characteristic variables are removed from the original data and the remaining data used to train regression algorithms. Two public healthcare datasets are used to test the performance of the proposed hybrid machine learning algorithm model. Experiments show that when compared to popular single machine learning algorithms (Long Short Term Memory, Random Forest, etc.) the proposed scheme can obtain similar or higher prediction accuracy with a reduced amount of data. [ABSTRACT FROM AUTHOR]

Human behavior is stimulated by the outside world, and the emotional response caused by it is a subjective response expressed by the body. Humans generally behave in common ways, such as lying, sitting, standing, walking, and running. In real life of human beings, there are more and more dangerous behaviors in human beings due to negative emotions in family and work. With the transformation of the information age, human beings can use Industry 4.0 smart devices to realize intelligent behavior monitoring, remote operation, and other means to effectively understand and identify human behavior characteristics. According to the literature survey, researchers at this stage analyze the characteristics of human behavior and cannot achieve the classification learning algorithm of single characteristics and composite characteristics in the process of identifying and judging human behavior. For example, the characteristic analysis of changes in the sitting and sitting process cannot be for classification and identification, and the overall detection rate also needs to be improved. In order to solve this situation, this paper develops an improved machine learning method to identify single and compound features. In this paper, the HATP algorithm is first used for sample collection and learning, which is divided into 12 categories by single and composite features; secondly, the CNN convolutional neural network algorithm dimension, recurrent neural network RNN algorithm, long- and short-term extreme value network LSTM algorithm, and gate control is used. The ring unit GRU algorithm uses the existing algorithm to design the model graph and the existing algorithm for the whole process; thirdly, the machine learning algorithm and the main control algorithm using the proposed fusion feature are used for HATP and human beings under the action of wearable sensors. The output features of each stage of behavior are fused; finally, by using SPSS data analysis and re-optimization of the fusion feature algorithm, the detection mechanism achieves an overall target sample recognition rate of about 83.6%. Finally, the research on the algorithm mechanism of machine learning for human behavior feature classification under the new algorithm is realized. [ABSTRACT FROM AUTHOR]

The efficient solution (fast and accurate) of parametric partial differential equations (pPDE) is of major interest in many domains of science and engineering, enabling evaluations of the quantities of interest, optimization, control, and uncertainty propagation—all them under stringent real-time constraints. Different methodologies have been proposed in the past within the model order reduction (MOR) community, based on the use of reduced bases (RB) or the separated representation at the heart of the so-called proper generalized decompositions (PGD). In PGD, an alternate-direction strategy is employed to circumvent the integration issues of operating in multi-dimensional domains. Recently, physics informed neural networks (PINNs), a particular collocation schema where the unknown field is approximated by a neural network (NN), have emerged in the domain of scientific machine learning. PNNs combine the versatility of NN-based approximation with the ease of collocating pPDE. The present paper proposes a combination of both procedures to find an efficient solution for pPDE, that can either be viewed as an efficient collocation procedure for PINN, or as a monolithic PGD that bypasses the use of the fixed-point alternated directions. [ABSTRACT FROM AUTHOR]

Current multimodal neural machine translation (MNMT) approaches primarily focus on ensuring consistency between visual annotations and the source language, often overlooking the broader aspect of multimodal coherence, including target–visual and bilingual–visual alignment. In this paper, we propose a novel approach that effectively leverages target–visual consistency (TVC) and bilingual–visual consistency (BiVC) to improve MNMT performance. Our method leverages visual annotations depicting concepts across bilingual parallel sentences to enhance multimodal coherence in translation. We exploit target–visual harmony by extracting contextual cues from visual annotations during auto-regressive decoding, incorporating vital future context to improve target sentence representation. Additionally, we introduce a consistency loss promoting semantic congruence between bilingual sentence pairs and their visual annotations, fostering a tighter integration of textual and visual modalities. Extensive experiments on diverse multimodal translation datasets empirically demonstrate our approach's effectiveness. This visually aware, data-driven framework opens exciting opportunities for intelligent learning, adaptive control, and robust distributed optimization of multi-agent systems in uncertain, complex environments. By seamlessly fusing multimodal data and machine learning, our method paves the way for novel control paradigms capable of effectively handling the dynamics and constraints of real-world multi-agent applications. [ABSTRACT FROM AUTHOR]

The Averaged One-Dependence Estimators (AODE) is a popular and effective method of Bayesian classification. In AODE, selecting the optimal sub-model based on a cross-validated risk minimization strategy can further enhance classification performance. However, existing cross-validation risk minimization strategies do not consider the differences in attributes in classification decisions. Consequently, this paper introduces an algorithm for Model Selection-based Weighted AODE (SWAODE). To express the differences in attributes in classification decisions, the ODE corresponding to attributes are weighted, with mutual information commonly used in the field of machine learning adopted as weights. Then, these weighted sub-models are evaluated and selected using leave-one-out cross-validation (LOOCV) to determine the best model. The new method can improve the accuracy and robustness of the model and better adapt to different data features, thereby enhancing the performance of the classification algorithm. Experimental results indicate that the algorithm merges the benefits of weighting with model selection, markedly enhancing the classification efficiency of the AODE algorithm. [ABSTRACT FROM AUTHOR]

In Structural Health Monitoring (SHM) of bridges, accurately assessing damage is critical to maintaining the safety and integrity of a structure. One of the primary challenges in damage assessment is the precise localization and quantification of defects, which is essential for making timely maintenance decisions and reducing the risk of structural failures. This paper introduces a novel damage detection method for SHM of a truss bridge by coupling a Deep Neural Network (DNN) model with an evolved Artificial Rabbit Optimization (EVARO) algorithm. The integration of DNN with the stochastic search capability of the EVARO algorithm helps to avoid local minima, thereby ensuring more accurate and reliable results. Additionally, the optimization algorithm's effectiveness is further enhanced by incorporating evolving predator features and the Cauchy motion search mechanism. The proposed method is first validated using various data benchmark problems, demonstrating its effectiveness compared to other well-known algorithms. Secondly, a case study involving the Chuong Duong truss bridge under different simulated damage scenarios further confirms the superiority of the proposed method in both localizing and quantifying damages. [ABSTRACT FROM AUTHOR]

Autonomous driving involves collaborative data sensing and traffic sign recognition. Emerging artificial intelligence technology has brought tremendous advances to vehicular networks. However, it is challenging to guarantee privacy and security when using traditional centralized machine learning methods for traffic sign recognition. It is urgent to introduce a distributed machine learning approach to protect private data of connected vehicles. In this paper, we propose a local differential privacy-based binary encoding federated learning approach. The binary encoding techniques and random perturbation methods are used in distributed learning scenarios to enhance the efficiency and security of data transmission. For the vehicle layer in this approach, the model is trained locally, and the model parameters are uploaded to the central server through encoding and perturbing. The central server designs the corresponding decoding, correction scheme, and regression statistical method for the received binary string. Then, the model parameters are aggregated and updated in the server and transmitted to the vehicle until the learning model is trained. The performance of the proposed approach is verified using the German Traffic Sign Recognition Benchmark data set. The simulation results show that the convergence of the approach is better with the increase in the learning cycle. Compared with baseline methods, such as the convolutional neural network, random forest, and backpropagation, the proposed approach achieves higher accuracy in the process of traffic sign recognition, with an increase of 6%. [ABSTRACT FROM AUTHOR]

Assessment of the current state of the near-surface part of the geological environment and understanding of its layered structure play an important role in various scientific and applied fields. The presented work is devoted to the application of phasometric modifications of geoelectric control methods to solve the problem of the detailed complex study of the underground layers of the environment in the process of drilling operations with the use of special equipment. These studies are based on the analysis of variations in phase parameters and characteristics of an artificially excited multiphase electric field to assess poorly distinguishable details and changes in the layered structure of the medium. The proposed method has increased accuracy, sensitivity and noise proofness of measurements, which allows for extracting detailed information about the heterogeneity, composition and stratification of underground geological formations not only in the zone where the drill makes contact with the medium, but also in the entire control zone. This paper considers practical mathematical models of phase images for basic scenarios of drill penetration between the layers of the near-surface part of the geological medium with different characteristics, obtained by means of approximation apparatus based on continuous piecewise linear functions, and also suggests the use of modern machine learning methods for intelligent analysis of its structure. Studying the phase shifts in electrical signals during drilling highlights their value for understanding the dynamics of soil response to the process. The observed signal changes during the drilling cycle reveal in detail the heterogeneity in soil structure and its response to changes caused by drilling. The stability of phase shifts at the last stages of the process indicates a quasi-equilibrium state. The results make a significant contribution to geotechnical science by offering an improved approach to monitoring a layered structure without the need for deep drilling. [ABSTRACT FROM AUTHOR]

Microscale robotics has emerged as a transformative field, offering unparalleled opportunities for innovation and advancement in various fields. Owing to the distinctive benefits of wireless operation and a heightened level of safety, magnetic actuation has emerged as a widely adopted technique in the field of microrobotics. However, factors such as Brownian motion, fluid dynamic flows, and various nonlinear forces introduce uncertainties in the motion of micro/nanoscale robots, making it challenging to achieve precise navigational control in complex environments. This paper presents an extensive review encompassing the trajectory from theoretical foundations of the generation and modeling of magnetic fields as well as magnetic field-actuation modeling to motion control methods of magnetic microrobots. We introduce traditional control methods and the learning-based control approaches for robotic systems at the micro/nanoscale, and then these methods are compared. Unlike the conventional navigation methods based on precise mathematical models, the learning-based control and navigation approaches can directly learn control signals for the actuation systems from data and without relying on precise models. This endows the micro/nanorobots with high adaptability to dynamic and complex environments whose models are difficult/impossible to obtain. We hope that this review can provide insights and guidance for researchers interested in automated magnetic microrobot control. [ABSTRACT FROM AUTHOR]

The proliferation of data across multiple domains necessitates the adoption of machine learning models that respect user privacy and data security, particularly in sensitive scenarios like surveillance and medical imaging. Federated learning (FL) offers a promising solution by decentralizing the learning process, allowing multiple participants to collaboratively train a model without sharing their data. However, when applied to complex tasks such as object detection, standard FL frameworks can fall short in balancing the dual demands of high accuracy and stringent privacy. This paper introduces a sophisticated federated object detection framework that incorporates advanced differential privacy mechanisms to enhance privacy protection. Our framework is designed to work effectively across heterogeneous and potentially large-scale datasets, characteristic of real-world environments. It integrates a novel adaptive differential privacy model that strategically adjusts the noise scale during the training process based on the sensitivity of the features being learned and the progression of the model's accuracy. We present a detailed methodology that includes a privacy budget management system, which optimally allocates and tracks privacy expenditure throughout training cycles. Additionally, our approach employs a hybrid model aggregation technique that not only ensures robust privacy guarantees but also mitigates the degradation of object detection performance typically associated with DP. The effectiveness of our framework is demonstrated through extensive experiments on multiple benchmark datasets, including COCO and PASCAL VOC. Our results show that our framework not only adheres to strict DP standards but also achieves near-state-of-the-art object detection performance, underscoring its practical applicability. For example, in some settings, our method can lower the privacy success rate by 40% while maintaining high model accuracy. This study makes significant strides in advancing the field of privacy-preserving machine learning, especially in applications where user privacy cannot be compromised. The proposed framework sets a new benchmark for implementing federated learning in complex, privacy-sensitive tasks and opens avenues for future research in secure, decentralized machine learning technologies. [ABSTRACT FROM AUTHOR]

This paper considers a risk-averse Markov decision process (MDP) with non-risk constraints as a dynamic optimization framework to ensure robustness against unfavorable outcomes in high-stakes sequential decision-making situations such as disaster response. In this regard, strong duality is proved while making no assumptions on the problem's convexity. This is necessary for some real-world issues, e.g., in the case of deprivation costs in the context of disaster relief, where convexity cannot be ensured. Our theoretical results imply that the problem can be exactly solved in a dual domain where it becomes convex. Based on our duality results, an augmented Lagrangian-based constraint handling mechanism is also developed for risk-averse reinforcement learning algorithms. The mechanism is proved to be theoretically convergent. Finally, we have also empirically established the convergence of the mechanism using a multi-stage disaster response relief allocation problem while using a fixed negative reward scheme as a benchmark. [ABSTRACT FROM AUTHOR]

Three-way clustering uses core region and fringe region to describe a cluster, which divide the dataset into three parts. The division helps identify the central core and outer sparse regions of a cluster. One of the main challenges in three-way clustering is the meaningful construction of the two sets. Aimed at handling high-dimensional data and improving the stability of clustering, this paper proposes a novel three-way clustering method. The proposed method uses dimensionality reduction techniques to reduce data dimensions and eliminate noise. Based on the reduced dataset, random sampling and feature extraction are performed multiple times to introduce randomness and diversity, enhancing the algorithm's robustness. Ensemble strategies are applied on these subsets, and the k-means algorithm is utilized to obtain multiple clustering results. Based on these results, we obtain co-association frequency between different samples and fused clustering result using the single-linkage method of hierarchical clustering. In order to describe the core region and fringe region of each cluster, the similar class of each sample is defined by co-association frequency. The lower and upper approximations of each cluster are obtained based on similar class. The samples in the lower approximation of each cluster belong to the core region of the cluster. The differences between lower and upper approximations of each cluster are defined as fringe region. Therefore, a three-way explanation of each cluster is naturally formed. By employing various UC Irvine Machine Learning Repository (UCI) datasets and comparing different clustering metrics such as Normalized Mutual Information (NMI), Adjusted Rand Index (ARI), and Accuracy (ACC), the experimental results show that the proposed strategy is effective in improving the structure of clustering results. [ABSTRACT FROM AUTHOR]

Microseismic data are widely employed for assessing rockburst risks; however, significant disparities exist in the monitoring capabilities of seismic networks across different mines, and none can capture a complete dataset of microseismic events. Such differences introduce unfairness when applying the same methodologies to evaluate rockburst risks in various mines. This paper proposes a method for assessing the monitoring capability of seismic networks applicable to heterogeneous media in mines. It achieves this by integrating three gradient boosting algorithms: Extreme Gradient Boosting (XGBoost), Light Gradient Boosting Machine (LightGBM), and Categorical Boosting (CatBoost). Initially, the isolation forest algorithm is utilized for preliminary data cleansing, and feature engineering is constructed based on the relative locations of event occurrences to monitoring stations and the working face. Subsequently, the optimal hyperparameters for three models are searched for using 8508 microseismic events from the a Coal Mine in eastern China as samples, and 18 sub-models are trained. Model weights are then determined based on the performance metrics of different algorithms, and an ensemble model is created to predict the monitoring capability of the network. The model demonstrated excellent performance on the training and test sets, achieving log loss, accuracy, and recall scores of 7.13, 0.81, and 0.76 and 6.99, 0.80, and 0.77, respectively. Finally, the method proposed in this study was compared with traditional approaches. The results indicated that, under the same conditions, the proposed method calculated the monitoring capability of the key areas to be 11% lower than that of the traditional methods. The reasons for the differences between these methods were identified and partially explained. [ABSTRACT FROM AUTHOR]

Efficient navigation is crucial for intelligent mobile robots in complex environments. This paper introduces an innovative approach that seamlessly integrates advanced machine learning techniques to enhance mobile robot communication and path planning efficiency. Our method combines supervised and unsupervised learning, utilizing spline interpolation to generate smooth paths with minimal directional changes. Experimental validation with a differential drive mobile robot demonstrates exceptional trajectory control efficiency. We also explore Motion Planning Networks (MPNets), a neural planner that processes raw point-cloud data from depth sensors. Our tests demonstrate MPNet's ability to create optimal paths using the Probabilistic Roadmap (PRM) method. We highlight the importance of correctly setting parameters for reliable path planning with MPNet and evaluate the algorithm on various path types. Our experiments confirm that the trajectory control algorithm works effectively, consistently providing precise and efficient trajectory control for the robot. [ABSTRACT FROM AUTHOR]

Wireless communication technologies have profoundly impacted the interconnectivity of mobile users and terminals. Nevertheless, the exponential increase in the number of users poses significant challenges, particularly in interference management, which is a major concern in wireless communication. Machine learning (ML) approaches have emerged as powerful tools for solving various problems in this domain. However, existing studies have not fully addressed the problem of interference management for wireless communication using ML techniques. In this paper, we explore the application of recurrent neural network (RNN) approaches to address co-channel interference in wireless communication. Specifically, we investigate the effectiveness of long short-term memory (LSTM), bidirectional LSTM (Bi-LSTM), and gated recurrent unit (GRU) network architectures in two different network settings. The first network comprises 10 connected devices, while the second network involves 20 devices. Our experimental results demonstrate that Bi-LSTM outperforms LSTM and GRU in terms of mean squared error, normalized mean squared error, and sum rate. While LSTM and GRU produce similar results, LSTM exhibits a marginal advantage over GRU. In addition, a combined RNN approach is also studied, and it can provide better results in dense networks. [ABSTRACT FROM AUTHOR]

As a type of financial derivative, the price fluctuation of futures is influenced by a multitude of factors, including macroeconomic conditions, policy changes, and market sentiment. The interaction of these factors makes the future trend become complex and difficult to predict. However, for investors, the ability to accurately predict the future trend of stock index futures price is directly related to the correctness of investment decisions and investment returns. Therefore, predicting the stock index futures market remains a leading and critical issue in the field of finance. To improve the accuracy of predicting stock index futures price, this paper introduces an innovative forecasting method by combining the strengths of Long Short-Term Memory (LSTM) networks and various Generalized Autoregressive Conditional Heteroskedasticity (GARCH)-family models namely, MULTI-GARCH-LSTM. This integrated approach is specifically designed to tackle the challenges posed by the nonstationary and nonlinear characteristics of stock index futures price series. This synergy not only enhances the model's ability to capture a wide range of market behaviors but also significantly improves the precision of future price predictions, catering to the intricate nature of financial time series data. Initially, we extract insights into the volatility characteristics, such as the aggregation of volatility in futures closing prices, by formulating a model from the GARCH family. Subsequently, the LSTM model decodes the complex nonlinear relationships inherent in the futures price series and incorporates assimilated volatility characteristics to predict future prices. The efficacy of this model is validated by applying it to an authentic dataset of gold futures. The empirical findings demonstrate that the performance of our proposed MULTI-GARCH-LSTM hybrid model consistently surpasses that of the individual models, thereby confirming the model's effectiveness and superior predictive capability. [ABSTRACT FROM AUTHOR]

Quantum machine learning stands out as one of the most promising applications of quantum computing, widely believed to possess potential quantum advantages. In the era of noisy intermediate-scale quantum, the scale and quality of quantum computers are limited, and quantum algorithms based on fault-tolerant quantum computing paradigms cannot be experimentally verified in the short term. The variational quantum algorithm design paradigm can better adapt to the practical characteristics of noisy quantum hardware and is currently one of the most promising solutions. However, variational quantum algorithms, due to their highly entangled nature, encounter the phenomenon known as the "barren plateau" during the optimization and training processes, making effective optimization challenging. This paper addresses this challenging issue by researching a variational quantum neural network optimization method based on collective intelligence algorithms. The aim is to overcome optimization difficulties encountered by traditional methods such as gradient descent. We study two typical applications of using quantum neural networks: random 2D Hamiltonian ground state solving and quantum phase recognition. We find that the collective intelligence algorithm shows a better optimization compared to gradient descent. The solution accuracy of ground energy and phase classification is enhanced, and the optimization iterations are also reduced. We highlight that the collective intelligence algorithm has great potential in tackling the optimization of variational quantum algorithms. [ABSTRACT FROM AUTHOR]

Since the first fully homomorphic encryption scheme was published in 2009, many papers have been published on fully homomorphic encryption and its applications. Machine learning is one of the most interesting applications and has drawn a lot of attention from researchers. To better represent and understand the field of Homomorphic Encryption in Machine Learning (HEML), this paper utilizes automated citation and topic analysis to characterize the HEML research literature over the years and provide the bibliometrics assessments for this burgeoning field. This is conducted by using a bibliometric statistical analysis approach. We make use of web-based literature databases and automated tools to present the development of HEML. This allows us to target several popular topics for in-depth discussion. To achieve these goals, we have chosen the well-established Scopus literature database and analyzed them through keyword counts and Scopus relevance searches. The results show a relative increase in the number of papers published each year that involve both homomorphic cryptography and machine learning. Using text mining of articles titles, we have found that cloud computing is a popular topic in this field, which also includes neural networks, big data, and the Internet of Things. The analysis results show that China, the US, and India have generated almost half of all the research contributions in HEML. The citation statistics, keyword statistics, and topic analyses give us a quick overview of the development of the field, which can be of great help to new researchers. It is also possible to apply our methodology to other research areas, and we see great value in this approach. [ABSTRACT FROM AUTHOR]

Fire detection and monitoring systems based on machine vision have been gradually developed in recent years. Traditional centralized deep learning model training methods transfer large amounts of video image data to the cloud, making image data privacy and confidentiality difficult. In order to protect the data privacy in the fire detection system with heterogeneous data and to enhance its efficiency, this paper proposes an improved federated learning algorithm incorporating computer vision: FedVIS, which uses a federated dropout and gradient selection algorithm to reduce communication overhead, and uses a transformer to replace a traditional neural network to improve the robustness of federated learning in the context of heterogeneous data. FedVIS can reduce the communication overhead in addition to reducing the catastrophic forgetting of previous devices, improving convergence, and producing superior global models. In this paper's experimental results, FedVIS outperforms the common federated learning methods FedSGD, FedAVG, FedAWS, and CMFL, and improves the detection effect by reducing communication costs. As the amount of clients increases, the accuracy of other algorithmic models decreases by 2–5%, and the number of communication rounds required increases significantly; meanwhile, our method maintains a superior detection performance while requiring roughly the same number of communication rounds. [ABSTRACT FROM AUTHOR]

Long short-term memory neural networks have been proposed as a means of creating accurate models from large time series data originating from various fields. These models can further be utilized for prediction, control, or anomaly-detection algorithms. However, finding the optimal hyperparameters to maximize different performance criteria remains a challenge for both novice and experienced users. Hyperparameter optimization algorithms can often be a resource-intensive and time-consuming task, particularly when the impact of the hyperparameters on the performance of the neural network is not comprehended or known. Teacher forcing denotes a procedure that involves feeding the ground truth output from the previous time-step as input to the current time-step during training, while during testing feeding back the predicted values. This paper presents a comprehensive examination of the impact of hyperparameters on long short-term neural networks, with and without teacher forcing, on prediction performance. The study includes testing long short-term memory neural networks, with two variations of teacher forcing, in two prediction modes, using two configurations (i.e., multi-input single-output and multi-input multi-output) on a well-known chemical process simulation dataset. Furthermore, this paper demonstrates the applicability of a long short-term memory neural network with a modified teacher forcing approach in a process state monitoring system. Over 100,000 experiments were conducted with varying hyperparameters and in multiple neural network operation modes, revealing the direct impact of each tested hyperparameter on the training and testing procedures. [ABSTRACT FROM AUTHOR]

In the era of healthcare and its related research fields, the dimensionality problem of high-dimensional data is a massive challenge as it is crucial to identify significant genes while conducting research on diseases like cancer. As a result, studying new Machine Learning (ML) techniques for raw gene expression biomedical data is an important field of research. Disease detection, sample classification, and early disease prediction are all important analyses of high-dimensional biomedical data in the field of bioinformatics. Recently, machine-learning techniques have dramatically improved the analysis of high-dimension biomedical data sets. Nonetheless, researchers' studies on biomedical data faced the challenge of vast dimensions, i.e., the vast features (genes) with a very low sample space. In this paper, two-dimensionality reduction methods, feature selection, and feature extraction are introduced with a systematic comparison of several dimension reduction techniques for the analysis of high-dimensional gene expression biomedical data. We presented a systematic review of some of the most popular nature-inspired algorithms and analyzed them. The paper is mainly focused on the original principles behind each of the algorithms and their applications for cancer classification and prediction from gene expression data. Lastly, the advantages and disadvantages of nature-inspired algorithms for biomedical data are evaluated. This review paper may guide researchers to choose the most effective algorithm for cancer classification and prediction for the satisfactory analysis of high-dimensional biomedical data. [ABSTRACT FROM AUTHOR]

Employee attrition and high turnover have become critical challenges faced by various sectors in today's competitive job market. In response to these pressing issues, organizations are increasingly turning to artificial intelligence (AI) to predict employee attrition and implement effective retention strategies. This paper delves into the application of explainable AI (XAI) in identifying potential employee turnover and devising data-driven solutions to address this complex problem. The first part of the paper examines the escalating problem of employee attrition in specific industries, analyzing the detrimental impact on organizational productivity, morale, and financial stability. The second section focuses on the utilization of AI techniques to predict employee attrition. AI can analyze historical data, employee behavior, and various external factors to forecast the likelihood of an employee leaving an organization. By identifying early warning signs, businesses can intervene proactively and implement personalized retention efforts. The third part introduces explainable AI techniques which enhance the transparency and interpretability of AI models. By incorporating these methods into AI-based predictive systems, organizations gain deeper insights into the factors driving employee turnover. This interpretability enables human resources (HR) professionals and decision-makers to understand the model's predictions and facilitates the development of targeted retention and recruitment strategies that align with individual employee needs. [ABSTRACT FROM AUTHOR]

Cost prediction can provide a pharma supply chain industry with completing their projects on schedule and within budget. This paper provides a new multi-function Blockchain Technology-enabled Pharmaceutical Supply Chain (BT-enabled PSC) mathematical cost model, including PSC costs, BT costs, and uncertain demand. The purpose of this study is to find the most appropriate algorithm(s) with minimum prediction errors to predict the costs of the BT-enabled PSC model. This paper also aims to determine the importance and cost of each component of the multi-function model. To reach these goals, we combined four Supervised Learning algorithms (KNN, DT, SVM, and NB) with two Evolutionary Computation algorithms (HS and PSO) after data generation. Each component of the multi-function model has its importance, and we applied the Feature Weighting approach to analyze their importance. Next, four performance metrics evaluated the multi-function model, and the Total Ranking Score determined predictive algorithms with high reliability. The results indicate the HS-NB and PSO-NB algorithms perform better than the other six algorithms in predicting the costs of the multi-function model with small errors. The findings also show that the Raw Materials cost has a more substantial influence on the model than the other components. This study also introduces the components of the multi-function BT-enabled PSC model. [ABSTRACT FROM AUTHOR]

Parallel natural language processing systems were previously successfully tested on the tasks of part-of-speech tagging and authorship attribution through mini-language modeling, for which they achieved significantly better results than independent methods in the cases of seven European languages. The aim of this paper is to present the advantages of using composite language models in the processing and evaluation of texts written in arbitrary highly inflective and morphology-rich natural language, particularly Serbian. A perplexity-based dataset, the main asset for the methodology assessment, was created using a series of generative pre-trained transformers trained on different representations of the Serbian language corpus and a set of sentences classified into three groups (expert translations, corrupted translations, and machine translations). The paper describes a comparative analysis of calculated perplexities in order to measure the classification capability of different models on two binary classification tasks. In the course of the experiment, we tested three standalone language models (baseline) and two composite language models (which are based on perplexities outputted by all three standalone models). The presented results single out a complex stacked classifier using a multitude of features extracted from perplexity vectors as the optimal architecture of composite language models for both tasks. [ABSTRACT FROM AUTHOR]

When the call center queuing system becomes complex, it turns out that the static routing policy is not optimal. This paper considers the problem of the dynamic routing policy for call centers with multiple skill types and agent groups. A state-dependent routing policy based on the Deep Q Network (DQN) is proposed, and a reinforcement learning algorithm is applied to optimize the routing. A simulation algorithm is designed to help customers and agents interact with the external environment to learn the optimal strategy. The performance evaluation considered in this paper is the service level/abandon rate. Experiments show that the DQN-based dynamic routing policy performs better than the common static policy Global First Come First Serve (FCFS) and the dynamic policy Priorities with Idle Agent Thresholds and Weight-Based Routing in various examples. On the other hand, the training time of the routing policy model based on the DQN is much faster than routing optimization based on simulation and a genetic algorithm. [ABSTRACT FROM AUTHOR]

Resistance spot welding poses potential challenges for automotive manufacturing enterprises with regard to ensuring the real-time and accurate quality detection of each welding spot. Nowadays, many machine learning and deep learning methods have been proposed to utilize monitored sensor data to solve these challenges. However, poor detection results or process interpretations are still unaddressed key issues. To bridge the gap, this paper takes the automotive bodies as objects, and proposes a resistance spot welding quality online detection method with dynamic current and resistance data based on a combined convolutional neural network (CNN), long short-term memory network (LSTM), and an attention mechanism. First, an overall online detection framework using an edge–cloud collaboration was proposed. Second, an online quality detection model was established. In it, the combined CNN and LSTM network were used to extract local detail features and temporal correlation features of the data. The attention mechanism was introduced to improve the interpretability of the model. Moreover, the imbalanced data problem was also solved with a multiclass imbalance algorithm and weighted cross-entropy loss function. Finally, an experimental verification and analysis were conducted. The results show that the quality detection accuracy was 98.5%. The proposed method has good detection performance and real-time detection abilities for the in-site welding processes of automobile bodies. [ABSTRACT FROM AUTHOR]

Federated learning is a distributed learning framework designed to protect user privacy, widely applied across various domains. However, existing federated learning algorithms face challenges, including slow convergence, significant loss fluctuations during aggregation, and imbalanced client sampling. To address these issues, this paper introduces a high-performance federated learning aggregation algorithm. This algorithm combines a cyclic adaptive learning rate adjustment strategy with client-weighted random sampling, addressing the aforementioned problems. Weighted random sampling assigns client weights based on their sampling frequency, balancing client sampling rates and contributions to enhance model aggregation. Additionally, it adapts the learning rate based on client loss variations and communication rounds, accelerating model convergence and reducing communication costs. To evaluate this high-performance algorithm, experiments are conducted using well-known datasets MNIST and CIFAR-10. The results demonstrate significant improvements in convergence speed and loss stability. Compared to traditional federated learning algorithms, our approach achieves faster and more stable convergence while effectively reducing training costs. [ABSTRACT FROM AUTHOR]