Search

This paper considers the offline assignment of fixed priorities in partitioned preemptive real-time systems where tasks have precedence constraints. This problem is crucial in this type of systems, as having a good fixed priority assignment allows for an efficient use of the processing resources while meeting all the deadlines. In the literature, we can find several proposals to solve this problem, which offer varying trade-offs between the quality of their results and their computational complexities. In this paper , we propose a new approach, leveraging existing algorithms that are widely exploited in the field of Machine Learning: Gradient Descent, the Adam Optimizer, and Gradient Noise. We show how to adapt these algorithms to the problem of fixed priority assignment in conjunction with existing worst-case response time analyses. We demonstrate the performance of our proposal on synthetic task-sets with different sizes. This evaluation shows that our proposal is able to find more schedulable solutions than previous heuristics, approximating optimal but intractable algorithms such as MILP or brute-force, while requiring reasonable execution times. [ABSTRACT FROM AUTHOR]

The paper presents an approach to machine learning involving the use of a hybrid method in Neural ODE. The authors consider a way of the Neural ODE application with an embedded hybrid method for intelligent manipulator control in a non-deterministic environment. To reduce computational resources, the number of layers of the neural network using ODE is reduced, the solution of which is carried out by a hybrid transformation method. The hybrid method includes normalizing the system, linear transformation, and polynomial transformation. Using the hybrid method in Neural ODE can increase the learning and computation speed. The transformation method has high accuracy with low computational complexity of the algorithm. As a result of applying the hybrid method, the original nonlinear system is transformed to a simpler form. To solve the simplified transformed system, the scheme of the numerical Runge-Kutta method of the third order with an adaptive step is used. The results of the computational experiment show an increase in the speed and accuracy of the calculation. The presented approach to implementing the hybrid method in Neural ODE allows faster training of the neural network of the world model on limited data obtained from the real environment. After training on the data generated by the model of the world, a robotic arm always successfully reaches the object during subsequent interaction with the real environment. This solves the problem of the limited ability of the agent to interact when learning with the real environment in robotic systems. [ABSTRACT FROM AUTHOR]

Multi-agent reinforcement learning (MARL) has been successfully applied in many fields. In MARL, the policy evaluation problem is one of crucial problems. In order to solve this problem, distributed Temporal-Difference (TD) learning algorithm is one of the most popular methods in a cooperative manner. Despite its empirical success, however, the theory of the adaptive variant of distributed TD learning still remain limited. To fill this gap, we propose an adaptive distributed temporal-difference algorithm (referred to as MS - ADTD) under Markovian sampling over time-varying networks. Furthermore, we rigorously analyze the convergence of MS - ADTD , the theoretical results show that the local estimation can converge linearly to the optimal neighborhood. Meanwhile, the theoretical results are verified by simulation experiments. • This paper proposes a distributed adaptive TD learning algorithm under Markovian sampling. • It theoretically analyzes the non-asymptotic convergence performance of the proposed algorithm. • It verifies the performance of the proposed algorithm by experiments. [ABSTRACT FROM AUTHOR]

• This paper proposes an unsupervised deep learning model. • This paper proposes an optimized sparse representation method. • This paper proposes a new image fusion algorithm based on unsupervised deep learning-optimized sparse representation. The image fusion method based on deep learning has problems such as the supervised learning of the model, the edge and noise of the fused image, and the setting of the image fusion weight map. To solve these problems, this paper proposes an end-to-end unsupervised deep learning model that performs one-to-many focus image fusion. It solves the training problem encountered by supervised deep learning models while avoiding the unreasonable image fusion weight maps. In addition, this paper proposes an optimized sparse representation method that divides an image into a target area and a background area. Then, it uses super complete dictionary learning to obtain a sparse representation of the image background area. This approach makes the proposed unsupervised deep learning image fusion method robust to noise. Finally, using this method to carry out image fusion experiments, the results show that the quality evaluation indicators of the fused image obtained by this method substantially outperform those of both mainstream machine learning and deep learning image fusion methods. [ABSTRACT FROM AUTHOR]

Imbalanced learning is important and challenging since the problem of the classification of imbalanced datasets is prevalent in machine learning and data mining fields. Sampling approaches are proposed to address this issue, and cluster-based oversampling methods have shown great potential as they aim to simultaneously tackle between-class and within-class imbalance issues. However, all existing clustering methods are based on a one-time approach. Due to the lack of a priori knowledge, improper setting of the number of clusters often exists, which leads to poor clustering performance. Besides, the existing methods are likely to generate noisy instances. To solve these problems, this paper proposes a deep instance envelope network-based imbalanced learning algorithm with the multilayer fuzzy c-means (MlFCM) and a minimum interlayer discrepancy mechanism based on the maximum mean discrepancy (MIDMD). This algorithm can guarantee high quality balanced instances using a deep instance envelope network in the absence of prior knowledge. First, the MlFCM is designed for the original minority class instances to obtain deep instances and increase the diversity of instances. Then, the MIDMD is proposed to avoid the generation of noisy instances and maintain the consistency of the interlayers of instances. Next, the multilayer FCM and minimum interlayer discrepancy mechanism are combined to construct a deep instance envelope network – the MlFC&IDMD. Finally, an imbalance learning algorithm is proposed based on the MlFC&IDMD. In the experimental section, thirty-three popular public datasets are used for verification, and over ten representative algorithms are used for comparison. The experimental results show that the proposed approach significantly outperforms other popular methods. • For the first time, a multilayer FCM (MlFCM) algorithm for classification is proposed to mine the instances for more information. • A minimum interlayer discrepancy mechanism (MIDMD) is proposed to make the distribution of instances before and after clustering consistent. • A deep instance envelope network (MlFC&IDMD) is constructed by combining the MlFCM and MIDMD. • An efficient strategy is proposed to determine the number of layers L of the deep instance envelope network. • A new imbalance learning algorithm is proposed based on the MlFC&IDMD. [ABSTRACT FROM AUTHOR]

Feature selection (FS) is recognized as one of the majority public and challenging problems in the Machine Learning domain. FS can be examined as an optimization problem that needs an effective optimizer to determine its optimal subset of more informative features. This paper proposes a wrapper FS method that combines chaotic maps (CMs) and binary Group Search Optimizer (GSO) called CGSO, which is used to solve the FS problem. In this method, five chaotic maps are incorporated with the GSO algorithm's main procedures, namely, Logistic, Piecewise, Singer, Sinusoidal, and Tent. The GSO algorithm is used as a search strategy, while k-NN is employed as an induction algorithm. The objective function is to integrate three main objectives: maximizing the classification accuracy value, minimizing the number of selected features, and minimizing the complexity of generated k-NN models. To evaluate the proposed methods' performance, twenty well-known UCI datasets are used and compared with other well-known published methods in the literature. The obtained results reveal the superiority of the proposed methods in outperforming other well-known methods, especially when using binary GSO with Tent CM. Finally, it is a beneficial method to be utilized in systems that require FS pre-processing. • A novel feature selection method is proposed for classification task. • Five Chaotic Group Search Optimizers are investigated. • Twenty UCI datasets were used in the experiments. • Our methods got a higher accuracy results using a fewer number of features. [ABSTRACT FROM AUTHOR]

• In order to solve the problem of unbalanced sample, a new Tradaboost algorithm is designed. • An industrial control anomaly detection system based on transfer learning is constructed. • The identification performance of both source and target domains is improved. • The experimental results show that the improved algorithm has higher performance. In industrial control systems, industrial infrastructure is often attacked by hackers. Due to the serious sample imbalance in industrial control data, the traditional machine learning method has poor performance in anomaly detection. In this paper, TrAdaboost algorithm is applied to industrial control anomaly detection. The samples that are easy to classify are taken as the source domain data, and the samples with poor classification effect are taken as the target domain. The source domain data is used to guide the target domain data training. Then, we improve the traditional TrAdaboost algorithm from two aspects of initial weight and final classifier, and apply it to industrial control anomaly detection. Finally, the performance of the algorithm on two different industrial control data sets is verified. And the improved algorithm is compared with other traditional algorithms. The experimental results show that the improved TrAdaboost algorithm has a significant advantage in predicting categories with a small sample size. This algorithm can accurately identify a few abnormal samples. Moreover, the F1 value, recall and precision value of the improved TrAdaboost algorithm on the two data sets have been significantly improved. This indicates that the improved TrAdaboost algorithm greatly improves the overall prediction accuracy of the model. [ABSTRACT FROM AUTHOR]

• A cross-layer parallel attention network is proposed to further refine the semantic information of the high-level fusion features and the fine-grained information of the low-level fusion features. • A multiscale perception module is proposed to improve the robustness of the network to object scale change. • An effective anchor box allocation strategy is proposed to detect small objects at the low-level feature maps. • Our model can achieve mAP of 88.1% on the GDUT-HWD dataset and mAP of 80.5% on the PASCAL VOC 2007 dataset respectively. To solve the problem of low accuracy in existing safety helmet detection methods, a novel object detection algorithm based on Single Shot Multibox Detector (SSD) is proposed in this paper. The algorithm uses the spatial attention mechanism for low-level features and the channel attention mechanism for high-level features, this cross-layer attention mechanism can further refine the feature information of the object region. The proposed detection algorithm introduces a feature pyramid and multiscale perception module to improve its robustness to object scale change. In addition, an effective anchor box adaptive adjustment method is designed to adaptively adjust the scale distribution of each layer of the anchor boxes based on the feature map size. Experiment results demonstrate that our detection model has mean Average Precision (mAP) of 88.1% and 80.5% on helmet dataset and VOC 2007 dataset respectively, which is better than baseline by 15.65% and 3.4%. The network framework of CASP detection algorithm for safety helmet-wearing detection. [Display omitted] [ABSTRACT FROM AUTHOR]