Search

Wind power has become an indispensable part of renewable energy development in various countries. Due to the high cost and complex structure of wind turbines, it is important to design a method that can quickly and effectively determine the structural health of the generator set. This research proposes a method that could determine structural damage or weaknesses in the blades at an early stage via a model to monitor the sound of the wind turbine blades, so as to reduce the quantity of labor required and frequency of regular maintenance, and to repair the damage rapidly in the future. This study used the operating sounds of normal and abnormal blades as a dataset. The model used discrete wavelet transform (DWT) to decompose the sound into different frequency components, performed feature extraction in a statistical measure, and combined with outlier exposure technique to train a deep neural network model that could capture abnormal values deviating from the normal samples. In addition, this paper observed that the performance of the monitoring model on the MIMII dataset was also better than the anomaly detection models proposed by other papers. [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]

In order to solve the problems of traditional mental stress detection in college students that are time-consuming, random, and subjective, this paper proposes an intelligent perception-driven mental stress assessment method for college students. First, we analyze the factors in SRQ and SCL-90, which can be measured by intelligent sensing methods, including sleep, exercise, social interaction, and environment, and then perform feature extraction. Secondly, we use machine learning methods to build a mental stress assessment model. The Shapley additive explanations (SHAP) model is used to explain the training results. Experimental results show that the model proposed in this article can effectively assess the mental stress state of college students. This means that the collection of intelligent perception data based on the mental stress scale can effectively evaluate the mental stress state of college students and provide a new research idea for further developing a non-intrusive and real-time mental stress assessment for college students. [ABSTRACT FROM AUTHOR]

Positive and unlabeled learning (PU learning) is a significant binary classification task in machine learning; it focuses on training accurate classifiers using positive data and unlabeled data. Most of the works in this area are based on a two-step strategy: the first step is to identify reliable negative examples from unlabeled examples, and the second step is to construct the classifiers based on the positive examples and the identified reliable negative examples using supervised learning methods. However, these methods always underutilize the remaining unlabeled data, which limits the performance of PU learning. Furthermore, many methods require the iterative solution of the formulated quadratic programming problems to obtain the final classifier, resulting in a large computational cost. In this paper, we propose a new method called the absolute value inequality support vector machine, which applies the concept of eccentricity to select reliable negative examples from unlabeled data and then constructs a classifier based on the positive examples, the selected negative examples, and the remaining unlabeled data. In addition, we apply a hyperparameter optimization technique to automatically search and select the optimal parameter values in the proposed algorithm. Numerical experimental results on ten real-world datasets demonstrate that our method is better than the other three benchmark algorithms. [ABSTRACT FROM AUTHOR]

The proliferation of Internet of Things (IoT) devices and their integration into critical infrastructure and business operations has rendered them susceptible to malware and cyber-attacks. Such malware presents a threat to the availability and reliability of IoT devices, and a failure to address it can have far-reaching impacts. Due to the limited resources of IoT devices, traditional rule-based detection systems are often ineffective against sophisticated attackers. This paper addressed these issues by designing a new framework that uses a machine learning (ML) algorithm for the detection of malware. Additionally, it also employed sequential detection architecture and evaluated eight malware datasets. The design framework is lightweight and effective in data processing and feature selection algorithms. Moreover, this work proposed a classification model that utilizes one support vector machine (SVM) algorithm and is individually tuned with three different optimization algorithms. The employed optimization algorithms are Nuclear Reactor Optimization (NRO), Artificial Rabbits Optimization (ARO), and Particle Swarm Optimization (PSO). These algorithms are used to explore a diverse search space and ensure robustness in optimizing the SVM for malware detection. After extensive simulations, our proposed framework achieved the desired accuracy among eleven existing ML algorithms and three proposed ensemblers (i.e., NRO_SVM, ARO_SVM, and PSO_SVM). Among all algorithms, NRO_SVM outperforms the others with an accuracy rate of 97.8%, an F1 score of 97%, and a recall of 99%, and has fewer false positives and false negatives. In addition, our model successfully identified and prevented malware-induced attacks with a high probability of recognizing new evolving threats. [ABSTRACT FROM AUTHOR]

This paper examines the distribution of eigenvalues for a 2 × 2 random confusion matrix used in machine learning evaluation. We also analyze the distributions of the matrix's trace and the difference between the traces of random confusion matrices. Furthermore, we demonstrate how these distributions can be applied to calculate the superiority probability of machine learning models. By way of example, we use the superiority probability to compare the accuracy of four disease outcomes machine learning prediction tasks. [ABSTRACT FROM AUTHOR]

Trajectory planning plays a crucial role in achieving unmanned excavator operations. The quality of trajectory planning results heavily relies on the level of rules extracted from objects such as scenes and optimization objectives, using traditional theoretical methods. To address this issue, this study focuses on professional operators and employs machine learning methods for job trajectory planning, thereby obtaining planned trajectories which exhibit excellent characteristics similar to those of professional operators. Under typical working conditions, data collection and analysis are conducted on the job trajectories of professional operators, with key points being extracted. Machine learning is then utilized to train models under different parameters in order to obtain the optimal model. To ensure sufficient samples for machine learning training, the bootstrap method is employed to adequately expand the sample size. Compared with the traditional spline curve method, the trajectories generated by machine learning models reduce the maximum speeds of excavator boom arm, dipper stick, bucket, and swing joint by 8.64 deg/s, 10.24 deg/s, 18.33 deg/s, and 1.6 deg/s, respectively; moreover, the error does not exceed 2.99 deg when compared with curves drawn by professional operators; and, finally, the trajectories generated by this model are continuously differentiable without position or velocity discontinuities, and their overall performance surpasses that of those generated by the traditional spline curve method. This paper proposes a trajectory generation method that combines excellent operators with machine learning and establishes a machine learning-based trajectory-planning model that eliminates the need for manually establishing complex rules. It is applicable to motion path planning in various working conditions of unmanned excavators. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive study on fall recognition and forecasting for reconfigurable stair-accessing robots by leveraging deep learning techniques. The proposed framework integrates machine learning algorithms and recurrent neural networks (RNNs), specifically Long Short-Term Memory (LSTM) and Bidirectional LSTM (BiLSTM), for fall detection of service robots on staircases. The reconfigurable stair-accessing robot sTetro serves as the platform, and the fall data required for training models are generated in a simulation environment. The two machine learning algorithms are compared and their effectiveness on the fall recognition task is reported. The results indicate that the BiLSTM model effectively classifies falls with a median categorical accuracy of 94.10% in simulation and 90.02% with limited experiments. Additionally, the BiLSTM model can be used for forecasting, which is practically valuable for making decisions well before the onset of a free fall. This study contributes insights into the design and implementation of fall detection systems for service robots used to navigate staircases through deep learning approaches. Our experimental and simulation data, along with the simulation steps, are available for reference and analysis via the shared link. [ABSTRACT FROM AUTHOR]

To make wind power more competitive, it is necessary to reduce turbine downtime and reduce costs associated with wind turbine operation and maintenance (O&M). Incorporating machine learning in the development of condition-based predictive maintenance methodologies for wind turbines can enhance their efficiency and reliability. This paper presents a monitoring method that utilizes Density Based Support Vector Machines (DBSVM) and the evolutionary Fourier spectra of vibrations. This method allows for the smart monitoring of the function evolution of the turbine. A complex optimal function (FO) for 5-degree order has been developed that will be the boundary function of the DBSVM to be timely determined from the Fourier spectrum through the magnitude–frequency and place of the failure occurring in the wind turbine drivetrains. The trend of the failure was constructed with the maximal values of the optimal frequency function for both yesthe cases of the upwind and downwind parts of the gearbox. [ABSTRACT FROM AUTHOR]

The economic operation of hydropower stations has the potential to increase water use efficiency. However, there are some challenges, such as the fixed and unchangeable flow characteristic curve of the hydraulic turbines, and the large number of variables in optimal load distribution, which limit the progress of research. In this paper, we propose a new optimal method of the economic operation of hydropower stations based on improved Long Short-Term Memory neural network (I-LSTM) and Random Forest (RF) algorithm. Firstly, in order to accurately estimate the water consumption, the LSTM model's hyperparameters are optimized using improved particle swarm optimization, and the I-LSTM method is proposed to fit the flow characteristic curve of the hydraulic turbines. Secondly, the Random Forest machine learning algorithm is introduced to establish a load-distribution model with its powerful feature extraction and learning ability. To improve the accuracy of the load-distribution model, we use the K-means algorithm to cluster the historical data and optimize the parameters of the Random Forest model. A Hydropower Station in China is selected for a case study. It is shown that (1) the I-LSTM method fits the operating characteristics under various working conditions and actual operating characteristics of hydraulic turbines, ensuring that they are closest to the actual operating state; (2) the I-LSTM method is compared with Support Vector Machine (SVM), Extreme Learning Machine (ELM) and Long Short-Term Memory neural network (LSTM). The prediction results of SVM have a large error, but compared with ELM and LSTM, MSE is reduced by about 46% and 38% respectively. MAE is reduced by about 25% and 21%, respectively. RMSE is reduced by about 27% and 24%, respectively; (3) the RF algorithm performs better than the traditional dynamic programming algorithm in load distribution. With the passage of time and the increase in training samples, the prediction accuracy of the Random Forest model has steadily improved, which helps to achieve optimal operation of the units, reducing their average total water consumption by 1.24%. This study provides strong support for the application of intelligent low-consumption optimization strategies in hydropower fields, which can bring higher economic benefits and resource savings to renewable energy production. [ABSTRACT FROM AUTHOR]

The opportunity for large amounts of open-for-public and available data is one of the main drivers of the development of an information society at the beginning of the 21st century. In this sense, acquiring knowledge from these data using different methods of machine learning is a prerequisite for solving complex problems in many spheres of human activity, starting from medicine to education and the economy, including traffic as today's important economic branch. Having this in mind, this paper deals with the prediction of the risk of traffic incidents using both historical and real-time data for different atmospheric factors. The main goal is to construct an ensemble model based on the use of several machine learning algorithms which has better characteristics of prediction than any of those installed when individually applied. In global, a case-proposed model could be a multi-agent system, but in a considered case study, a two-agent system is used so that one agent solves the prediction task by learning from the historical data, and the other agent uses the real time data. The authors evaluated the obtained model based on a case study and data for the city of Niš from the Republic of Serbia and also described its implementation as a practical web citizen application. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a key enabler technology that recently received significant attention from the scientific community across the globe. It helps transform everyone's life by connecting physical and virtual devices with each other to offer staggering benefits, such as automation and control, higher productivity, real-time information access, and improved efficiency. However, IoT devices and their accumulated data are susceptible to various security threats and vulnerabilities, such as data integrity, denial-of-service, interception, and information disclosure attacks. In recent years, the IoT with blockchain technology has seen rapid growth, where smart contracts play an essential role in validating IoT data. However, these smart contracts can be vulnerable and degrade the performance of IoT applications. Hence, besides offering indispensable features to ease human lives, there is also a need to confront IoT environment security attacks, especially data integrity attacks. Toward this aim, this paper proposed an artificial intelligence-based system model with a dual objective. It first detects the malicious user trying to compromise the IoT environment using a binary classification problem. Further, blockchain technology is utilized to offer tamper-proof storage to store non-malicious IoT data. However, a malicious user can exploit the blockchain-based smart contract to deteriorate the performance IoT environment. For that, this paper utilizes deep learning algorithms to classify malicious and non-malicious smart contracts. The proposed system model offers an end-to-end security pipeline through which the IoT data are disseminated to the recipient. Lastly, the proposed system model is evaluated by considering different assessment measures that comprise the training accuracy, training loss, classification measures (precision, recall, and F1 score), and receiver operating characteristic (ROC) curve. [ABSTRACT FROM AUTHOR]

MRI scanning has shown significant growth in the detection of brain tumors in the recent decade among various methods such as MRA, X-ray, CT, PET, SPECT, etc. Brain tumor identification requires high exactness because a minor error can be life-threatening. Brain tumor disclosure remains a challenging job in medical image processing. This paper targets to explicate a method that is more precise and accurate in brain tumor detection and focuses on tumors in neonatal brains. The infant brain varies from the adult brain in some aspects, and proper preprocessing technique proves to be fruitful to avoid miscues in results. This paper is divided into two parts: In the first half, preprocessing was accomplished using HE, CLAHE, and BPDFHE enhancement techniques. An analysis is the sequel to the above methods to check for the best method based on performance metrics, i.e., MSE, PSNR, RMSE, and AMBE. The second half deals with the segmentation process. We propose a novel ARKFCM to use for segmentation. Finally, the trends in the performance metrics (dice similarity and Jaccard similarity) as well as the segmentation results are discussed in comparison with the conventional FCM method. [ABSTRACT FROM AUTHOR]

At present, deep learning has achieved excellent achievements in image processing and computer vision and is widely used in the field of watermarking. Attention mechanism, as the research hot spot of deep learning, has not yet been applied in the field of watermarking. In this paper, we propose a deep learning and attention network for robust image watermarking (DARI-Mark). The framework includes four parts: an attention network, a watermark embedding network, a watermark extraction network, and an attack layer. The attention network used in this paper is the channel and spatial attention network, which calculates attention weights along two dimensions, channel and spatial, respectively, assigns different weights to pixels in different channels at different positions and is applied in the watermark embedding and watermark extraction stages. Through end-to-end training, the attention network can locate nonsignificant areas that are insensitive to the human eye and assign greater weights during watermark embedding, and the watermark embedding network selects this region to embed the watermark and improve the imperceptibility. In watermark extraction, by setting the loss function, larger weights can be assigned to watermark-containing features and small weights to noisy signals, so that the watermark extraction network focuses on features about the watermark and suppresses noisy signals in the attacked image to improve robustness. To avoid the phenomenon of gradient disappearance or explosion when the network is deep, both the embedding network and the extraction network have added residual modules. Experiments show that DARI-Mark can embed the watermark without affecting human subjective perception and that it has good robustness. Compared with other state-of-the-art watermarking methods, the proposed framework is more robust to JPEG compression, sharpening, cropping, and noise attacks. [ABSTRACT FROM AUTHOR]

This document is a preface to a special issue on "Advances in Machine Learning, Optimization, and Control Applications." It highlights the connection between machine learning and control theory as a popular research topic that can improve control systems. The special issue includes eight research articles and three reviews that cover various topics such as action recognition, person re-identification, petroleum product identification, vessel prediction, fractured elbow classification, task scheduling in cloud computing, metaheuristic algorithms, and machine learning methods. The authors express their gratitude to the contributors and hope that the research papers will inspire further exploration in these areas. [Extracted from the article]

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]

A launch vehicle needs to adapt to a complex flight environment during flight, and traditional guidance and control algorithms can hardly deal with multi-factor uncertainties due to the high dependency on control models. To solve this problem, this paper designs a new intelligent flight control method for a rocket based on the deep reinforcement learning algorithm driven by knowledge and data. In this process, the Markov decision process of the rocket landing section is established by designing a reinforcement function with consideration of the combination effect on the return of the terminal constraint of the launch vehicle and the cumulative return of the flight process of the rocket. Meanwhile, to improve the training speed of the landing process of the launch vehicle and to enhance the generalization ability of the model, the strategic neural network model is obtained and trained via the form of a long short-term memory (LSTM) network combined with a full connection layer as a landing guidance strategy network. The proximal policy optimization (PPO) is the training algorithm of reinforcement learning network parameters combined with behavioral cloning (BC) as the reinforcement learning pre-training imitation learning algorithm. Notably, the rocket-borne environment is transplanted to the Nvidia Jetson TX2 embedded platform for the comparative testing and verification of this intelligent model, which is then used to generate real-time control commands for guiding the actual flying and landing process of the rocket. Further, comparisons of the results obtained from convex landing optimization and the proposed method in this work are performed to prove the effectiveness of this proposed method. The simulation results show that the intelligent control method in this work can meet the landing accuracy requirements of the launch vehicle with a fast convergence speed of 84 steps, and the decision time is only 2.5 ms. Additionally, it has the ability of online autonomous decision making as deployed on the embedded platform. [ABSTRACT FROM AUTHOR]

With technological transformations such as big data, blockchain, artificial intelligence, and cloud computing, digital techniques are infiltrating the field of finance. Digital finance (DF) is a resource-saving and environmentally friendly innovative financial service. It shows great green attributes and can drive the flow of financial resources towards environmentally-friendly enterprises, thereby promoting green low-carbon circular development (GLCD). However, few studies have explored the coupling mechanism between DF and GLCD. To fill this gap, this paper explores the effect of DF on GLCD, and established a mediating effect model to investigate the mechanism of DF in promoting GLCD. Additionally, this paper established a random forest model and a CatBoost model based on machine learning to examine the relative importance of DF and the factors affecting GLCD. The results show that DF has significant positive effects on GLCD, and technological innovation plays a key role in the effect of DF on GLCD; meanwhile, the effect of DF on GLCD shows nonlinear features with an increasing "marginal effect"; moreover, both DF and conventional factors have significant impacts on GLCD. Our study highlights the effect of DF on GLCD and underscores the importance of developing policies for DF and GLCD. This study provides an empirical basis and path reference for DF to achieve "carbon peak, carbon neutralization" in China. [ABSTRACT FROM AUTHOR]

This review paper addresses the critical need for structural prognostics and health management (SPHM) in aircraft maintenance, highlighting its role in identifying potential structural issues and proactively managing aircraft health. With a comprehensive assessment of various SPHM techniques, the paper contributes by comparing traditional and modern approaches, evaluating their limitations, and showcasing advancements in data-driven and model-based methodologies. It explores the implementation of machine learning and deep learning algorithms, emphasizing their effectiveness in improving prognostic capabilities. Furthermore, it explores model-based approaches, including finite element analysis and damage mechanics, illuminating their potential in the diagnosis and prediction of structural health issues. The impact of digital twin technology in SPHM is also examined, presenting real-life case studies that demonstrate its practical implications and benefits. Overall, this review paper will inform and guide researchers, engineers, and maintenance professionals in developing effective strategies to ensure aircraft safety and structural integrity. [ABSTRACT FROM AUTHOR]

This paper concerns the development of a machine learning tool to detect anomalies in the molecular structure of Gallium Arsenide. We employ a combination of a CNN and a PCA reconstruction to create the model, using real images taken with an electron microscope in training and testing. The methodology developed allows for the creation of a defect detection model, without any labeled images of defects being required for training. The model performed well on all tests under the established assumptions, allowing for reliable anomaly detection. To the best of our knowledge, such methods are not currently available in the open literature; thus, this work fills a gap in current capabilities. [ABSTRACT FROM AUTHOR]

Quantum computing, an emerging paradigm based on the principles of quantum mechanics, has the potential to revolutionise various industries, including Telecommunications. This paper explores the transformative impact of quantum computing on the telecommunication market, focusing on its applications in solving computationally intensive problems. By leveraging the inherent properties of quantum systems, such as superposition and entanglement, quantum computers offer the promise of exponential computational speedup and enhanced problem-solving capabilities. This paper provides an in-depth analysis of the current state of quantum computing in telecommunication, examining key algorithms and approaches, discussing potential use cases, and highlighting the challenges and future prospects of this disruptive technology. [ABSTRACT FROM AUTHOR]

The complexity of the data type and distribution leads to the increase in uncertainty in the relationship between samples, which brings challenges to effectively mining the potential cluster structure of data. Ensemble clustering aims to obtain a unified cluster division by fusing multiple different base clustering results. This paper proposes a three-way ensemble clustering algorithm based on sample's perturbation theory to solve the problem of inaccurate decision making caused by inaccurate information or insufficient data. The algorithm first combines the natural nearest neighbor algorithm to generate two sets of perturbed data sets, randomly extracts the feature subsets of the samples, and uses the traditional clustering algorithm to obtain different base clusters. The sample's stability is obtained by using the co-association matrix and determinacy function, and then the samples can be divided into a stable region and unstable region according to a threshold for the sample's stability. The stable region consists of high-stability samples and is divided into the core region of each cluster using the K-means algorithm. The unstable region consists of low-stability samples and is assigned to the fringe regions of each cluster. Therefore, a three-way clustering result is formed. The experimental results show that the proposed algorithm in this paper can obtain better clustering results compared with other clustering ensemble algorithms on the UCI Machine Learning Repository data set, and can effectively reveal the clustering structure. [ABSTRACT FROM AUTHOR]

Stagnation at local optima represents a significant challenge in bio-inspired optimization algorithms, often leading to suboptimal solutions. This paper addresses this issue by proposing a hybrid model that combines the Orca predator algorithm with deep Q-learning. The Orca predator algorithm is an optimization technique that mimics the hunting behavior of orcas. It solves complex optimization problems by exploring and exploiting search spaces efficiently. Deep Q-learning is a reinforcement learning technique that combines Q-learning with deep neural networks. This integration aims to turn the stagnation problem into an opportunity for more focused and effective exploitation, enhancing the optimization technique's performance and accuracy. The proposed hybrid model leverages the biomimetic strengths of the Orca predator algorithm to identify promising regions nearby in the search space, complemented by the fine-tuning capabilities of deep Q-learning to navigate these areas precisely. The practical application of this approach is evaluated using the high-dimensional Heartbeat Categorization Dataset, focusing on the feature selection problem. This dataset, comprising complex electrocardiogram signals, provided a robust platform for testing the feature selection capabilities of our hybrid model. Our experimental results are encouraging, showcasing the hybrid strategy's capability to identify relevant features without significantly compromising the performance metrics of machine learning models. This analysis was performed by comparing the improved method of the Orca predator algorithm against its native version and a set of state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Improving the estimation of origin–destination (O-D) travel times poses a formidable challenge due to the intricate nature of transportation dynamics. Current deep learning models often require an overwhelming amount of data, both in terms of data points and variables, thereby limiting their applicability. Furthermore, there is a scarcity of models capable of predicting travel times with basic trip information such as origin, destination, and starting time. This paper introduces novel models rooted in the k-nearest neighbor (KNN) algorithm to tackle O-D travel time estimation with limited data. These models represent innovative adaptations of weighted KNN techniques, integrating the haversine distance of neighboring trips and incorporating correction factors to mitigate prediction biases, thereby enhancing the accuracy of travel time estimations for a given trip. Moreover, our models incorporate an adaptive heuristic to partition the time of day, identifying time blocks characterized by similar travel-time observations. These time blocks facilitate a more nuanced understanding of traffic patterns, enabling more precise predictions. To validate the effectiveness of our proposed models, extensive testing was conducted utilizing a comprehensive taxi trip dataset sourced from Santiago, Chile. The results demonstrate substantial improvements over existing state-of-the-art models (e.g., MAPE between 35 to 37% compared to 49 to 60% in other methods), underscoring the efficacy of our approach. Additionally, our models unveil previously unrecognized patterns in city traffic across various time blocks, shedding light on the underlying dynamics of urban mobility. [ABSTRACT FROM AUTHOR]

Accurate estimation of software effort and time in the software development process is a key activity to achieve the necessary product quality. However, underestimation or overestimation of effort has become a key challenge for software development. One of the main problems is the estimation with metrics from late stages, because the product must already be finished to make estimates. In this paper, the use of statistical models and machine learning approaches for software estimation are used in early stages such as software design, and a data set is presented with metric values of design artifacts with 37 software projects. As results, models for the estimation of development time and effort are proposed and validated through leave-one-out cross-validation. Further, machine learning techniques were employed in order to compare software projects estimations. Through the statistical tests, it was proven that the errors were not statistically different with the regression models for effort estimation. However, with Random Forest the best statistical results were obtained for estimating development time. [ABSTRACT FROM AUTHOR]

Many methods exist for solving the problem of evaluating efficiency in different processes. They are divided into two basic groups, parametric and non-parametric methods, which can have significant differences in the results. In this study, the authors consider the process of assessing the business climate depending on realized foreign investments. Due to the expected difference in efficiency assessment using different approaches, the goal of this paper is to create an optimization model of an ensemble for efficiency assessment that uses both types of methods with the aim of creating a symmetrical approach that achieves better results than each type of method individually. The proposed solution simultaneously analyzes the impact of different factors on foreign investments in order to determine the most important factors and thus enable each local government to ensure the best possible efficiency in this process. The innovative idea of this study is in the inclusion of classification and feature selection methods of machine learning to fulfill the set goal. Our research, focused on a specific case study in various cities across the Republic of Serbia, evaluated the effectiveness of that process. This study extends previous research and confirms the published results, highlighting the advantages of the newly proposed model. [ABSTRACT FROM AUTHOR]

The interpretability and explainability of machine learning (ML) approaches play a key role in the trustworthiness of ML models in various applications. The objective of this paper is to incorporate a logic-based reasoning in the ML model that is not only accurate but also interpretable and easily applied. More precisely, we propose a hybrid IBA-VNS approach based on interpolative Boolean algebra (IBA) and variable neighborhood search (VNS). IBA is chosen over traditional multi-valued and/or fuzzy logic techniques due to its consistency in preserving all Boolean axioms. The VNS heuristic is used for model training, i.e., determining the optimal logical aggregation function within the IBA framework for solving observed prediction problems. Obtained logic aggregation functions are easy to understand and may provide additional insight to the decision-maker. The proposed approach does not require any domain knowledge and is applicable in various domains. IBA-VNS is evaluated on several standard datasets. Further, IBA-VNS is applied to the real-world problem of predicting hospital length of stay (LOS), showing exceptional results in terms of interpretability and accuracy. In fact, the dataset is collected from the LabSerb program regarding colorectal surgeries in the period 2015–2023. The proposed approach extracted knowledge regarding the problem, i.e., the causal relations between the patient's health condition and LOS, along with achieving an MAE of 1.144 days. [ABSTRACT FROM AUTHOR]

In order to cope with ever-evolving and increasing cyber threats, intrusion detection systems have become a crucial component of cyber security. Compared with signature-based intrusion detection methods, anomaly-based methods typically employ machine learning techniques to train detection models and possess the capability to discover unknown attacks. However, intrusion detection methods face the challenge of low detection rates for minority class attacks due to imbalanced data distributions. Traditional intrusion detection algorithms address this issue by resampling or generating synthetic data. Additionally, reinforcement learning, as a machine learning method that interacts with the environment to obtain feedback and improve performance, is gradually being considered for application in the field of intrusion detection. This paper proposes a reinforcement-learning-based intrusion detection method that innovatively uses adaptive sample distribution dual-experience replay to enhance a reinforcement learning algorithm, aiming to effectively address the issue of imbalanced sample distribution. We have also developed a reinforcement learning environment specifically designed for intrusion detection tasks. Experimental results demonstrate that the proposed model achieves favorable performance on the NSL-KDD, AWID, and CICIoT2023 datasets, effectively dealing with imbalanced data and showing better classification performance in detecting minority attacks. [ABSTRACT FROM AUTHOR]

Credit risk scorecard models are utilized by lending institutions to optimize decisions on credit approvals. In recent years, ensemble learning has often been deployed to reduce misclassification costs in credit risk scorecards. In this paper, we compared the risk estimation of 26 widely used machine learning algorithms based on commonly used statistical metrics. The best-performing algorithms were then used for model selection in ensemble learning. For the first time, we proposed financial criteria that assess the impact of losses associated with both false positive and false negative predictions to identify optimal ensemble learning. The German Credit Dataset (GCD) is augmented with simulated financial information according to a hypothetical mortgage portfolio observed in UK, European and Australian banks to enable the assessment of losses arising from misclassification costs. The experimental results using the simulated GCD show that the best predictive individual algorithm with the accuracy of 0.87, Gini of 0.88 and Area Under the Receiver Operating Curve of 0.94 was the Generalized Additive Model (GAM). The ensemble learning method with the lowest misclassification cost was the combination of Random Forest (RF) and K-Nearest Neighbors (KNN), totaling USD 417 million in costs (USD 230 for default costs and USD 187 for opportunity costs) compared to the costs of the GAM (USD 487, USD 287 and USD 200). Implementing the proposed financial criteria has led to a significant USD 70 million reduction in misclassification costs derived from a small sample. Thus, the lending institutions' profit would considerably rise as the number of submitted credit applications for approval increases. [ABSTRACT FROM AUTHOR]

The power supply is crucial in the present day due to the negative impacts of poor power quality on the electric grid. In this research, we employed deep learning methods to investigate the power factor, which is a significant indicator of power quality. A multi-step forecast was developed for the power factor in the power supply installation of a hot rolling mill, extending beyond the horizontal line. This was conducted using data obtained from the respective electrical supply system. The forecast was developed via hybrid RNN (recurrent neural networks) incorporating LSTM (long short-term memory) and GRU (gated recurrent unit) layers. This research utilized hybrid recurrent neural network designs with deep learning methods to build several power factor models. These layers have advantages for time series forecasting. After conducting time series forecasting, qualitative indicators of the prediction were identified, including the sMAPE (Symmetric Mean Absolute Percentage Error) and regression coefficient. In this paper, the authors examined the quality of applied models and forecasts utilizing these indicators, both in the short term and long term. [ABSTRACT FROM AUTHOR]

Learning-based classifiers are found to be vulnerable to attacks by adversarial samples. Some works suggested that ensemble classifiers tend to be more robust than single classifiers against evasion attacks. However, recent studies have shown that this is not necessarily the case under more realistic settings of black-box attacks. In this paper, we propose a novel ensemble approach to improve the robustness of classifiers against evasion attacks by using diversified feature selection and a stochastic aggregation strategy. Our proposed scheme includes three stages. Firstly, the adversarial feature selection algorithm is used to select a feature each time that can trade-offbetween classification accuracy and robustness, and add it to the feature vector bank. Secondly, each feature vector in the bank is used to train a base classifier and is added to the base classifier bank. Finally, m classifiers from the classifier bank are randomly selected for decision-making. In this way, it can cause each classifier in the base classifier bank to have good performance in terms of classification accuracy and robustness, and it also makes it difficult to estimate the gradients of the ensemble accurately. Thus, the robustness of classifiers can be improved without reducing the classification accuracy. Experiments performed using both Linear and Kernel SVMs on genuine datasets for spam filtering, malware detection, and handwritten digit recognition demonstrate that our proposed approach significantly improves the classifiers' robustness against evasion attacks. [ABSTRACT FROM AUTHOR]

This paper proposes a scalable learning framework to solve a system of coupled forward–backward partial differential equations (PDEs) arising from mean field games (MFGs). The MFG system incorporates a forward PDE to model the propagation of population dynamics and a backward PDE for a representative agent's optimal control. Existing work mainly focus on solving the mean field game equilibrium (MFE) of the MFG system when given fixed boundary conditions, including the initial population state and terminal cost. To obtain MFE efficiently, particularly when the initial population density and terminal cost vary, we utilize a physics-informed neural operator (PINO) to tackle the forward–backward PDEs. A learning algorithm is devised and its performance is evaluated on one application domain, which is the autonomous driving velocity control. Numerical experiments show that our method can obtain the MFE accurately when given different initial distributions of vehicles. The PINO exhibits both memory efficiency and generalization capabilities compared to physics-informed neural networks (PINNs). [ABSTRACT FROM AUTHOR]

Modern massive data with enormous sample size and tremendous dimensionality are usually impossible to process with a single machine. They are typically stored and processed in a distributed manner. In this paper, we propose a distributed bootstrap simultaneous inference for a high-dimensional quantile regression model using massive data. Meanwhile, a communication-efficient (CE) distributed learning algorithm is developed via the CE surrogate likelihood framework and ADMM procedure, which can handle the non-smoothness of the quantile regression loss and the Lasso penalty. We theoretically prove the convergence of the algorithm and establish a lower bound on the number of communication rounds ι min that warrant statistical accuracy and efficiency. The distributed bootstrap validity and efficiency are corroborated by an extensive simulation study. [ABSTRACT FROM AUTHOR]

Graph embedding plays an important role in the analysis and study of typical non-Euclidean data, such as graphs. Graph embedding aims to transform complex graph structures into vector representations for further machine learning or data mining tasks. It helps capture relationships and similarities between nodes, providing better representations for various tasks on graphs. Different orders of neighbors have different impacts on the generation of node embedding vectors. Therefore, this paper proposes a multi-order adjacency view encoder to fuse the feature information of neighbors at different orders. We generate different node views for different orders of neighbor information, consider different orders of neighbor information through different views, and then use attention mechanisms to integrate node embeddings from different views. Finally, we evaluate the effectiveness of our model through downstream tasks on the graph. Experimental results demonstrate that our model achieves improvements in attributed graph clustering and link prediction tasks compared to existing methods, indicating that the generated embedding representations have higher expressiveness. [ABSTRACT FROM AUTHOR]

This study introduces a framework that integrates business analytics into educational decision-making to improve learner engagement and performance in Massive Open Online Courses (MOOCs), focusing on learning environments in English as a Foreign Language (EFL). By examining three specific research questions, this paper delineates patterns in learner engagement, evaluates factors that affect these patterns, and examines the relationship between these factors and educational outcomes. The study provides an empirical analysis that elucidates the connection between learner behaviors and learning outcomes by employing machine learning, process mining, and statistical methods such as hierarchical clustering, process discovery, and the Mann–Kendall test. The analysis determines that learning patterns, characterized as single-phase or multi-phase, repetitive or non-repetitive, and sequential or self-regulated, are more closely associated with the nature of the educational content—such as books, series, or reading levels—than learner characteristics. Furthermore, it has been observed that learners exhibiting self-regulated learning patterns tend to achieve superior academic outcomes. The findings advocate for integrating analytics in educational practices, offer strategic insights for educational enhancements, and propose a new perspective on the connection between learner behavior and educational success. [ABSTRACT FROM AUTHOR]

Imbalanced class data are commonly observed in pattern analysis, machine learning, and various real-world applications. Conventional approaches often resort to resampling techniques in order to address the imbalance, which inevitably alter the original data distribution. This paper proposes a novel classification method that leverages optimal transport for handling imbalanced data. Specifically, we establish a transport plan between training and testing data without modifying the original data distribution, drawing upon the principles of optimal transport theory. Additionally, we introduce a non-convex interclass regularization term to establish connections between testing samples and training samples with the same class labels. This regularization term forms the basis of a regularized discrete optimal transport model, which is employed to address imbalanced classification scenarios. Subsequently, in line with the concept of maximum minimization, a maximum minimization algorithm is introduced for regularized discrete optimal transport. Subsequent experiments on 17 Keel datasets with varying levels of imbalance demonstrate the superior performance of the proposed approach compared to 11 other widely used techniques for class-imbalanced classification. Additionally, the application of the proposed approach to water quality evaluation confirms its effectiveness. [ABSTRACT FROM AUTHOR]

Language barriers and the communication difficulties of individuals with developmental disabilities are two major causes of communication problems that societies worldwide encounter. A particularly challenging group is hearing-impaired people who have difficulties with communication, reading, writing, learning, and social interactions, which have a substantial impact on their quality of life. This article focuses on detailing a Serbian Sign Language alphabet database and the method for creating it in order to provide a foundation for answering the various societal challenges of persons who use the Serbian language. In front of a computer camera, 41 people performed Serbian Sign Language sign movements that replicated the Serbian alphabet for this study's aims. Hand and body key points were identified using the recorded video clips, and the numerical values of the identified key points were then stored in a database for further processing. In total, 8.346 video clips of people making recognized hand gestures were gathered, processed, classed, and archived. This paper provides a thorough technique that may be applied to comparable tasks and details the process of constructing a dataset based on Serbian Sign Language alphabet signs. This dataset was created using custom-made Python 3.11 software. Data regarding dynamic video clips that capture entire subject movement were incorporated into this dataset to fill in the gaps in other similar efforts based on static photographs. Thus, the purpose of this investigation is to employ innovative technology to support the community of hearing-impaired people in areas such as general inclusion, education, communication, and empowerment. [ABSTRACT FROM AUTHOR]

This paper investigates the output feedback (OPFB) tracking control problem for discrete-time linear (DTL) systems with unknown dynamics. To solve this problem, we use an augmented system approach, which first transforms the tracking control problem into a regulation problem with a discounted performance function. The solution to this problem is derived using a Bellman equation, based on the Q-function. In order to overcome the challenges of unmeasurable system state variables, we employ a multistep Q-learning algorithm that surpasses the advantages of the policy iteration (PI) and value iteration (VI) techniques and state reconstruction methods for output feedback control. As such, the requirement for an initial stabilizing control policy for the PI method is removed and the convergence speed of the learning algorithm is improved. Finally, we demonstrate the effectiveness of the proposed scheme using a simulation example. [ABSTRACT FROM AUTHOR]

Sentiment analysis has increasingly gained significance in commercial settings, driven by the rising impact of reviews on purchase decision-making in recent years. This research conducts a thorough examination of the suitability of machine learning and deep learning approaches for sentiment analysis, using Romanian reviews as a case study, with the aim of gaining insights into their practical utility. A comprehensive, multi-level analysis is performed, covering the document, sentence, and aspect levels. The main contributions of the paper refer to the in-depth exploration of multiple sentiment analysis models at three different textual levels and the subsequent improvements brought with respect to these standard models. Additionally, a balanced dataset of Romanian reviews from twelve product categories is introduced. The results indicate that, at the document level, supervised deep learning techniques yield the best outcomes (specifically, a convolutional neural network model that obtains an AUC value of 0.93 for binary classification and a weighted average F1-score of 0.77 in a multi-class setting with 5 target classes), albeit with increased resource consumption. Favorable results are achieved at the sentence level, as well, despite the heightened complexity of sentiment identification. In this case, the best-performing model is logistic regression, for which a weighted average F1-score of 0.77 is obtained in a multi-class polarity classification task with three classes. Finally, at the aspect level, promising outcomes are observed in both aspect term extraction and aspect category detection tasks, in the form of coherent and easily interpretable word clusters, encouraging further exploration in the context of aspect-based sentiment analysis for the Romanian language. [ABSTRACT FROM AUTHOR]

Many families of binary nonlinear codes (e.g., Kerdock, Goethals, Delsarte–Goethals, Preparata) can be very simply constructed from linear codes over the Z 4 ring (ring of integers modulo 4), by applying the Gray map to the quaternary symbols. Generalized Kerdock codes represent an extension of classical Kerdock codes to the Z 2 S ring. In this paper, we develop two novel soft-input decoders, designed to exploit the unique structure of these codes. We introduce a novel soft-input ML decoding algorithm and a soft-input soft-output MAP decoding algorithm of generalized Kerdock codes, with a complexity of O (N S log 2 N) , where N is the length of the Z 2 S code, that is, the number of Z 2 S symbols in a codeword. Simulations show that our novel decoders outperform the classical lifting decoder in terms of error rate by some 5 dB. [ABSTRACT FROM AUTHOR]