Search

For future large-scale CubeSat applications in orbit, the deployer must accommodate a greater number of CubeSats and facilitate cluster releases. This paper introduces an improved A* algorithm tailored for CubeSat in-orbit transfer path planning. Unlike the traditional A* algorithm, this enhanced version incorporates a path coordination strategy to manage congestion caused by the simultaneous transfer of many CubeSats, ensuring they reach their designated release positions smoothly and thus significantly boosting the efficiency of CubeSat transfers. Additionally, the algorithm develops a cost model for attitude disturbances on the electromagnetic conveying platform and crafts an improved cost function. It strategically balances the reduction in attitude disturbances caused by CubeSat transfers with the efficiency of these transfers. The primary goal is to minimize platform disturbances while optimizing the number of steps CubeSats need to reach their intended positions. The effectiveness of this algorithm is demonstrated through detailed case studies, which confirm that during the CubeSat transfer process, the platform's attitude remains stable, and the transfer efficiency is well-managed, achieving efficient path planning for the in-orbit transfer of numerous CubeSats. [ABSTRACT FROM AUTHOR]

Lithium-ion batteries are widely used in power grids as a common form of energy storage in power stations. The state of charge (SOC) and state of health (SOH) reflect the capacity and lifetime variation in the Li-ion batteries, and they are important state parameters of Li-ion batteries. Therefore, the establishment of accurate SOC and SOH prediction models is an essential prerequisite for the correct assessment of the status of lithium batteries, the improvement of the operational accuracy of energy-storage stations, and the development of maintenance plans for energy-storage stations. This paper first analyzes the correlation between SOC and SOH, and then proposes a joint SOC and SOH prediction model using the particle swarm optimization (PSO) algorithm to optimize the extreme gradient boosting algorithm (XGBoost), which takes into account the dynamic correlation between SOC and SOH dynamics, thus enabling more accurate SOC and SOH prediction. Finally, the prediction model is validated using the Oxford battery aging dataset. The correlation between SOC and SOH is verified by comparing the joint prediction results with the SOC individual prediction results. Then, the prediction results of the PSO-XGBoost model, the traditional XGBoost model, and the long short-term memory neural network are compared to verify the effectiveness and accuracy of the PSO-XGBoost model. [ABSTRACT FROM AUTHOR]

Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation. [ABSTRACT FROM AUTHOR]

In recent years, the rapid increase in the number and type of Android malware has brought great challenges and pressure to malware detection systems. As a widely used method in android malware detection, static detecting has been a hot topic in academia and industry. However, in order to improve the accuracy of detection, the existing static detecting methods sacrifice the excessively high analysis complexity and time cost. Moreover, the correlation between static features leads to redundancy of a large amount of data. Therefore, this paper proposes a static detecting method of Android malware based on sensitive pattern. It uses an improved FP-growth algorithm to mine frequent combinations of sensitive permissions and API calls in malicious apps and benign apps, which avoids the generation of redundant information. In addition, this paper adopts multi-layered gradient boosting decision trees algorithm to train the detection model. And a dual similarity combination method is proposed to measure the similarity between different sensitive patterns. The experimental results show that our proposed detection method has high accuracy and great generalization ability. [ABSTRACT FROM AUTHOR]

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

Hierarchical temporal memory (HTM) is a promising unsupervised machine-learning algorithm that models key principles of neocortical computation. One of the main components of HTM is the spatial pooler (SP), which encodes binary input streams into sparse distributed representations (SDRs). In this paper, we propose an information-theoretic framework for the performance comparison of HTM-spatial pooler (SP) algorithms, specifically, for quantifying the similarities and differences between sparse distributed representations in SP algorithms. We evaluate SP's standalone performance, as well as HTM's overall performance. Our comparison of various SP algorithms using Renyi mutual information, Renyi divergence, and Henze–Penrose divergence measures reveals that the SP algorithm with learning and a logarithmic boosting function yields the most effective and useful data representation. Moreover, the most effective SP algorithm leads to superior HTM results. In addition, we utilize our proposed framework to compare HTM with other state-of-the-art sequential learning algorithms. We illustrate that HTM exhibits superior adaptability to pattern changes over time than long short term memory (LSTM), gated recurrent unit (GRU) and online sequential extreme learning machine (OS-ELM) algorithms. This superiority is evident from the lower Renyi divergence of HTM (0.23) compared to LSTM6000 (0.33), LSTM3000 (0.38), GRU (0.41), and OS-ELM (0.49). HTM also achieved the highest Renyi mutual information value of 0.79, outperforming LSTM6000 (0.73), LSTM3000 (0.71), GRU (0.68), and OS-ELM (0.62). These findings not only confirm the numerous advantages of HTM over other sequential learning algorithm, but also demonstrate the effectiveness of our proposed information-theoretic approach as a powerful framework for comparing and evaluating various learning algorithms. [ABSTRACT FROM AUTHOR]

In this study, the inductor optimization design is performed by applying the Pareto optimization technique. As environmental problems emerge, the electric vehicle market is expanding, and accordingly, volume reduction and high efficiency of the onboard charger (OBC) are required. An OBC consists of a PFC stage and a DC/DC stage. The inductor is a major component in a converter and affects the volume and efficiency of the entire converter system. However, reducing the volume of the inductor leads to an increase in loss due to an increase in the change in flux density. Therefore, it is important to derive a suitable design for the target between the two parameters in the trade-off of loss and volume. This paper introduces the optimal design algorithm for boosting inductors of PFC converters in terms of volume and loss. Volume and loss are difficult to compare with each other, making it difficult to set weights. Therefore, Pareto optimization was applied which can be selected according to the needs and purposes of the decision-maker, without weighting as an optimization method. Through a series of procedures of applying Pareto optimization to the inductor design, several optimal inductor designs can be derived. At this time, the optimal designs become a set of designs in which the loss does not decrease without an increase in volume, or the volume does not decrease without an increase in loss. A designer can select a design with an appropriate volume and loss that meets the purpose of the design or preference. Therefore, through the proposed method, the inductor can be flexibly designed according to the target of the application. The proposed algorithm is applied to the interleaved totem-pole bridgeless boost PFC converter, to review its effectiveness. As a result, several inductor designs are derived in the search space, and various optimal designs are visualized through the Pareto Frontier. This facilitates comparative analysis of various inductor designs and helps designers select reasonable inductors. The validity was verified by selecting one of the obtained optimal inductor designs and driving the experiment with the resulting inductor. [ABSTRACT FROM AUTHOR]

The development of the network economy has brought a great impact on the society. In the process of online transactions, if the transaction risks are not prevented and improved in time, it will directly affect the normal development of the social economy. Therefore, it is necessary to synchronize transaction subjects and objects, and at the same time control transaction risks, and promote the rapid development of e-commerce, which is an important problem to be solved urgently in current online transactions. This paper first summarizes the characteristics and risk performance of new transactions and identifies and controls them according to their characteristics and different risk characteristics. The cybercriminal industry uses illegal means to seek benefits in online transactions. The continuous improvement of big data technology and data mining technology makes it possible to identify transaction risks in the consumption process. In particular, the research and identification of black industries can not only ensure the normal operation of merchants and reduce the loss of economic interests of merchants but also make the transaction experience of natural users smoother. Based on the existing consumption data, this paper adopts the Boosting-SVM model to identify natural users and black-produced users in the transaction process. The results show that the model achieves good recognition results. The overall prediction accuracy of the model is over 95%, the identification accuracy rate of high-risk transactions is over 98%, and other indicators are also over 96%. Compared with other risk identification, the overall accuracy of the algorithm is increased by 1%, and the risk identification accuracy is increased by more than 8%. Generally speaking, the method in this paper provides technical support to related industries to a certain extent. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of instrument current transformers technical state assessment based on machine learning methods. The introductory parts of the paper provide a detailed analysis of modern methods and approaches for technical state assessment of high-voltage power equipment of power plants and substations as well as a review of modern software tools and the latest trends in the given field of study. Justification of the relevance of the presented research aimed at instrument current transformers technical state assessment is provided along with the motivation for machine learning methods application for improvement of the accuracy and quality of high-voltage equipment state classification. Within the framework of the study, a comparative analysis of gradient boosting on decision trees and random forest algorithms was carried out for a given mathematical problem formulation. The main stages of processing the initial dataset are proposed as a step-by-step procedure, including feature extraction, feature transformation, feature interactions, etc. The outperforming efficiency of gradient boosting on decision trees algorithm was validated for real power equipment fleet. The resulting classification quality metrics of current transformers technical state assessment, Precision and Recall, are estimated to be 87.1% and 83.7%, correspondingly. [ABSTRACT FROM AUTHOR]

Answer selection (AS) is a critical subtask of the open-domain question answering (QA) problem. The present paper proposes a method called RLAS-BIABC for AS, which is established on attention mechanism-based long short-term memory (LSTM) and the bidirectional encoder representations from transformers (BERT) word embedding, enriched by an improved artificial bee colony (ABC) algorithm for pretraining and a reinforcement learning-based algorithm for training backpropagation (BP) algorithm. BERT can be comprised in downstream work and fine-tuned as a united task-specific architecture, and the pretrained BERT model can grab different linguistic effects. Existing algorithms typically train the AS model with positive-negative pairs for a two-class classifier. A positive pair contains a question and a genuine answer, while a negative one includes a question and a fake answer. The output should be one for positive and zero for negative pairs. Typically, negative pairs are more than positive, leading to an imbalanced classification that drastically reduces system performance. To deal with it, we define classification as a sequential decision-making process in which the agent takes a sample at each step and classifies it. For each classification operation, the agent receives a reward, in which the prize of the majority class is less than the reward of the minority class. Ultimately, the agent finds the optimal value for the policy weights. We initialize the policy weights with the improved ABC algorithm. The initial value technique can prevent problems such as getting stuck in the local optimum. Although ABC serves well in most tasks, there is still a weakness in the ABC algorithm that disregards the fitness of related pairs of individuals in discovering a neighboring food source position. Therefore, this paper also proposes a mutual learning technique that modifies the produced candidate food source with the higher fitness between two individuals selected by a mutual learning factor. We tested our model on three datasets, LegalQA, TrecQA, and WikiQA, and the results show that RLAS-BIABC can be recognized as a state-of-the-art method. [ABSTRACT FROM AUTHOR]

Boosting has proven its superiority by increasing the diversity of base classifiers, mainly in various classification problems. In reality, target variables in classification often are formed by numerical variables, in possession of ordinal information. However, existing boosting algorithms for classification are unable to reflect such ordinal target variables, resulting in non‐optimal solutions. In this paper, we propose a novel algorithm of ordinal encoding adaptive boosting (AdaBoost) using a multi‐dimensional encoding scheme for ordinal target variables. Extending an original binary‐class AdaBoost, the proposed algorithm is equipped with a multi‐class exponential loss function. We show that it achieves the Bayes classifier and establishes forward stagewise additive modeling. We demonstrate the performance of the proposed algorithm with a base learner as a neural network. Our experiments show that it outperforms existing boosting algorithms in various ordinal datasets. [ABSTRACT FROM AUTHOR]

This study illustrates the utility and effectiveness of machine learning algorithms in identifying dependencies in data transmitted in industrial networks. The analysis was performed for two different algorithms. The study was carried out for the XGBoost (Extreme Gradient Boosting) algorithm based on a set of decision tree model classifiers, and the second algorithm tested was the EBM (Explainable Boosting Machines), which belongs to the class of Generalized Additive Models (GAM). Tests were conducted for several test scenarios. Simulated data from static equations were used, as were data from a simulator described by dynamic differential equations, and the final one used data from an actual physical laboratory bench connected via Modbus TCP/IP. Experimental results of both techniques are presented, thus demonstrating the effectiveness of the algorithms. The results show the strength of the algorithms studied, especially against static data. For dynamic data, the results are worse, but still at a level that allows using the researched methods to identify dependencies. The algorithms presented in this paper were used as a passive protection layer of a commercial IDS (Intrusion Detection System). [ABSTRACT FROM AUTHOR]

Harris hawks optimization (HHO) has been accepted as one of the well-established swarm-based methods in the community of optimization and machine learning that primarily works based on multiple dynamic features and various exploratory and exploitative traits. Compared with other optimization algorithms, it has been observed that HHO can obtain high-quality solutions for continuous and constrained complex and real-world problems. While there is a wide variety of strategies in the HHO for dealing with diverse situations, there are chances for sluggish performance, where the convergence rate can gradually slow with time, and the HHO may stay stuck in the current relatively better place and may be unable to explore other better areas. To mitigate this concern, this paper combines the Cauchy mutation mechanism into the HHO algorithm named CMHHO. This idea can boost performance and provide a promising optimizer for solving complex optimization problems. The Cauchy mutation mechanism can speed up the convergence of the solution and help HHO explore more promising regions compared to its basic release. On 30 IEEE CEC2017 benchmark functions, the study compared the proposed CMHHO with various conventional and advanced metaheuristics to validate its performance and quality of solutions. It has been found through experiments that the overall optimization performance of CMHHO is far superior to all competitors. The CMHHO method is applied to four engineering challenges to investigate the capabilities of the proposed algorithm in solving real-world problems, and experimental results show that the suggested algorithm is more successful than existing algorithms. [ABSTRACT FROM AUTHOR]

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

Electrocardiogram (ECG) signal is a measure of the heart's electrical activity. Recently, ECG detection and classification have benefited from the use of computer-aided systems by cardiologists. The goal of this paper is to improve the accuracy of ECG classification by combining the Dipper Throated Optimization (DTO) and Differential Evolution Algorithm (DEA) into a unified algorithm to optimize the hyperparameters of neural network (NN) for boosting the ECG classification accuracy. In addition, we proposed a new feature selection method for selecting the significant feature that can improve the overall performance. To prove the superiority of the proposed approach, several experimentswere conducted to compare the results achieved by the proposed approach and other competing approaches. Moreover, statistical analysis is performed to study the significance and stability of the proposed approach using Wilcoxon and ANOVA tests. Experimental results confirmed the superiority and effectiveness of the proposed approach. The classification accuracy achieved by the proposed approach is (99.98%). [ABSTRACT FROM AUTHOR]

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

Building electricity load forecasting plays an important role in building energy management, peak demand and power grid security. In the past two decades, a large number of data-driven models have been applied to building and larger-scale energy consumption predictions. Although these models have been successful in specific cases, their performances would be greatly affected by the quantity and quality of the building data. Moreover, for older buildings with sparse data, or new buildings with no historical data, accurate predictions are difficult to achieve. Aiming at such a data silos problem caused by the insufficient data collection in the building energy consumption prediction, this study proposes a building electricity load forecasting method based on a similarity judgement and an improved TrAdaBoost algorithm (iTrAdaBoost). The Maximum Mean Discrepancy (MMD) is used to search similar building samples related to the target building from public datasets. Different from general Boosting algorithms, the proposed iTrAdaBoost algorithm iteratively updates the weights of the similar building samples and combines them together with the target building samples for a prediction accuracy improvement. An educational building's case study is carried out in this paper. The results show that even when the target and source samples belong to different domains, i.e., the geographical location and meteorological condition of the buildings are different, the proposed MMD-iTradaBoost method has a better prediction accuracy in the transfer learning process than the BP or traditional AdaBoost models. In addition, compared with other advanced deep learning models, the proposed method has a simple structure and is easy for engineering implementation. [ABSTRACT FROM AUTHOR]

The Surface Water and Ocean Topography (SWOT) mission will be affected by various sources of systematic errors, which are correlated in space and in time. Their amplitude before calibration might be as large as tens of centimeters, i.e., able to dominate the mission error budget. To reduce their magnitude, we developed so-called data-driven (or empirical) calibration algorithms. This paper provided a summary of the overall problem, and then presented the calibration framework used for SWOT, as well as the pre-launch performance simulations. We presented two complete algorithm sequences that use ocean measurements to calibrate KaRIN globally. The simple and robust Level-2 algorithm was implemented in the ground segment to control the main source of error of SWOT's hydrology products. In contrast, the more sophisticated Level-3 (multi-mission) algorithm was developed to improve the accuracy of ocean products, as well as the one-day orbit of the SWOT mission. The Level-2 algorithm yielded a mean inland error of 3–6 cm, i.e., a margin of 25–80% (of the signal variance) with respect to the error budget requirements. The Level-3 algorithm yielded ocean residuals of 1 cm, i.e., a variance reduction of 60–80% with respect to the Level-2 algorithm. [ABSTRACT FROM AUTHOR]

Using Business Intelligence to strategize the use of technology and reduce the rate of an Indian economic issue of unemployment by developing a Start-up web application using By coordinating with the Indian Sports and Cultural Institutions, and establishing agreements with NGOs/Corporates and other sponsorship providers to raise stipends/employment for underprivileged Indian youth using a novel algorithm with the GBDT algorithm for a suitable and secure recruiter recommendation system using firebase encryption. Since the Indian youth require a vast stage of opportunities and growth in variety of employment, the creatives and the sports industry are primarily focused to display limelight on those nurtured with inborn talents using our recruiter recommendation system using the 3 BI principles namely relevance, query intelligence and personalization. This app will seek to eradicate insufficient assessments, location barriers, inaccessibility of academies due to lack of funds, inadequate cultural categories, loopholes in the database due to weak security, and manual screening and verification of UUP details, this paper aims to give an overview and a studied literature review including proposed concepts and describes the need, significance and goal of developing an algorithm using business intelligence and machine learning to solve a socio-economic crisis. [ABSTRACT FROM AUTHOR]

Honey badger algorithm (HBA) is a recently developed meta-heuristic algorithm, which mainly simulates the dynamic search behavior of honey badger in wild nature. Similar to other basic algorithms, HBA may suffer from the weakness of poor convergence accuracy, inadequate balance between exploration and exploitation, and ease of getting trapped into the local optima. In order to address these drawbacks, this paper proposes an enhanced honey badger algorithm (EHBA) to improve the search quality of the basic method from three aspects. First, we introduce the highly disruptive polynomial mutation to initialize the population. This is considered from increasing the population diversity. Second, Lévy flight is integrated into the position update formula to boost search efficiency and balance exploration and exploitation capabilities of the algorithm. Furthermore, the refraction opposition-based learning is applied to the current global optimum of the swarm to help the population jump out of the local optima. To validate the function optimization performance, the proposed EHBA is comprehensively analyzed on 18 standard benchmark functions and IEEE CEC2017 test suite. Compared with the basic HBA and seven state-of-the-art algorithms, the experimental results demonstrate that EHBA can outperform other competitors on most of the test functions with superior solution accuracy, local optima avoidance, and stability. Additionally, the applicability of the proposed method is further highlighted by solving four engineering design problems. The results indicate that EHBA also has competitive performance and promising prospects for real-world optimization tasks. [ABSTRACT FROM AUTHOR]

Kmeans clustering algorithm is an iterative unsupervised learning algorithm that tries to partition the given dataset into k pre-defined distinct non-overlapping clusters where each data point belongs to only one group. However, its performance is affected by its sensitivity to the initial cluster centroids with the possibility of convergence into local optimum and specification of cluster number as the input parameter. Recently, the hybridization of metaheuristics algorithms with the K-Means algorithm has been explored to address these problems and effectively improve the algorithm's performance. Nonetheless, most metaheuristics algorithms require rigorous parameter tunning to achieve an optimum result. This paper proposes a hybrid clustering method that combines the well-known symbiotic organisms search algorithm with K-Means using the SOS as a global search metaheuristic for generating the optimum initial cluster centroids for the K-Means. The SOS algorithm is more of a parameter-free metaheuristic with excellent search quality that only requires initialising a single control parameter. The performance of the proposed algorithm is investigated by comparing it with the classical SOS, classical K-means and other existing hybrids clustering algorithms on eleven (11) UCI Machine Learning Repository datasets and one artificial dataset. The results from the extensive computational experimentation show improved performance of the hybrid SOSK-Means for solving automatic clustering compared to the standard K-Means, symbiotic organisms search clustering methods and other hybrid clustering approaches. [ABSTRACT FROM AUTHOR]

Given a set of facilities and a set of users, a reverse nearest neighbors (RNN) query retrieves every user $u$ for which the query facility $q$ is its closest facility. Since $q$ is the closest facility to $u$ , the user $u$ is said to be influenced by $q$ . In this paper, we propose a relaxed definition of influence where a user $u$ is said to be influenced by not only its closest facility but also every other facility that is almost as close to $u$ as its closest facility is. Based on this definition of influence, we propose reverse approximate nearest neighbors (RANN) queries. Formally, given a value $x>1$ , an RANN query $q$ returns every user $u$ for which $dist(u,q) \leq x\times NNDist(u)$ where $NNDist(u)$ denotes the distance between a user $u$ and its nearest facility, i.e., $q$ is an approximate nearest neighbor of $u$ . In this paper, we study both snapshot and continuous versions of RANN queries. In a snapshot RANN query, the underlying data sets do not change and the results of a query are to be computed only once. In the continuous version, the users continuously change their locations and the results of RANN queries are to be continuously monitored. Based on effective pruning techniques and several non-trivial observations, we propose efficient RANN query processing algorithms for both the snapshot and continuous RANN queries. We conduct extensive experiments on both real and synthetic data sets and demonstrate that our algorithm for both snapshot and continuous queries are significantly better than the competitors. [ABSTRACT FROM PUBLISHER]

Previous works trained the Transformer and its variants end-to-end and achieved remarkable translation performance when there are huge parallel sentences available. However, these models suffer from the data scarcity problem in low-resource machine translation tasks. To deal with the mismatch problem between the big model capacity of the Transformer and the small parallel training data set, this paper adds the BERT supervision on the latent representation between the encoder and the decoder of the Transformer and designs a multi-step training algorithm to boost the Transformer on such a basis. The algorithm includes three stages: (1) encoder training, (2) decoder training, and (3) joint optimization. We introduce the BERT of the target language in the encoder and the decoder training and alleviate the data starvation problem of the Transformer. After the training stage, the BERT will not further attend the inference section explicitly. Another merit of our training algorithm is that it can further enhance the Transformer in the task where there are limited parallel sentence pairs but large amounts of monolingual corpus of the target language. The evaluation results on six low-resource translation tasks suggest that the Transformer trained by our algorithm significantly outperforms the baselines which were trained end-to-end in previous works. [ABSTRACT FROM AUTHOR]

The software-assisted reliability assessment of power electronic converters is increasingly important due to its multi-domain nature and extensive parametric calculations. The rainflow counting algorithm is gaining popularity for its low relative error in device lifetime estimation. Nevertheless, the offline operation of the algorithm prevents most simulation software packages considering other parameters for the device under study, such as aging and the current state of health in the estimation, as it requires a complete loading profile to run recursive comparison. This also brings difficulties in realization in circuit simulators such as SPICE. To tackle the issue, an in-the-loop circuit-based rainflow counting algorithm is proposed in this paper, and applied to estimate the consumed lifetime of the MOSFET in a boost converter for illustration. Instantaneous electrical and thermal performances, and the accumulated stress of the device can be monitored. Not only does this assist in evaluating the state of health of a device, but also allows the possibility of integrating the aging into the lifetime evaluation. The method follows the four-point rainflow counting algorithms, which continuously compares three adjacent temperature fluctuations Δ T j to select full cycles for two rounds, and the remaining cycles are counted as half cycles. To validate the performance, a comparative analysis in terms of counting accuracy and simulation speed was performed alongside the proposed method, MATLAB® and also with a well-accepted half-cycle counting method. Reported results show that the proposed method has an improved counting accuracy compared to the half-cycle counting from 24% to 3.5% on average under different load stresses and length conditions. The accuracy can be effectively improved by a further 1.3–2% by adding an extra comparison round. [ABSTRACT FROM AUTHOR]

Feature selection can efficiently improve classification accuracy and reduce the dimension of datasets. However, feature selection is a challenging and complex task that requires a high-performance optimization algorithm. In this paper, we propose an enhanced binary bat algorithm (EBBA) which is originated from the conventional binary bat algorithm (BBA) as the learning algorithm in a wrapper-based feature selection model. First, we model the feature selection problem and then transfer it as a fitness function. Then, we propose an EBBA for solving the feature selection problem. In EBBA, we introduce the Lévy flight-based global search method, population diversity boosting method and chaos-based loudness method to improve the BA and make it more applicable to feature selection problems. Finally, the simulations are conducted to evaluate the proposed EBBA and the simulation results demonstrate that the proposed EBBA outmatches other comparison benchmarks. Moreover, we also illustrate the effectiveness of the proposed improved factors by tests. [ABSTRACT FROM AUTHOR]

The imbalanced data problem is widespread in the real world. In the process of training machine learning models, ignoring imbalanced data problems will cause the performance of the model to deteriorate. At present, researchers have proposed many methods to deal with the imbalanced data problems, but these methods mainly focus on the imbalanced data problems in two-class classification tasks. Learning from multi-class imbalanced data sets is still an open problem. In this paper, an ensemble method for classifying multi-class imbalanced data sets is put forward, called multi-class WHMBoost. It is an extension of WHMBoost that we proposed earlier. We do not use the algorithm used in WHMBoost to process the data, but use random balance based on average size so as to balance the data distribution. The weak classifiers we use in the boosting algorithm are support vector machine and decision tree classifier. In the process of training the model, they participate in training with given weights in order to complement each other's advantages. On 18 multi-class imbalanced data sets, we compared the performance of multi-class WHMBoost with state of the art ensemble algorithms using MAUC, MG-mean and MMCC as evaluation criteria. The results demonstrate that it has obvious advantages compared with state of the art ensemble algorithms and can effectively deal with multi-class imbalanced data sets. [ABSTRACT FROM AUTHOR]

This article is part of a For-Discussion-Section of Methods of Information in Medicine about the papers "The Evolution of Boosting Algorithms - From Machine Learning to Statistical Modelling" [1] and "Extending Statistical Boosting - An Overview of Recent Methodological Developments" [2], written by Andreas Mayr and co-authors. It is introduced by an editorial. This article contains the combined commentaries invited to independently comment on the Mayr et al. papers. In subsequent issues the discussion can continue through letters to the editor. [ABSTRACT FROM AUTHOR]

To a large extent, classical boosting denoising algorithms can improve denoising performance. However, these algorithms can only work well when the denoisers are linear. In this paper, we propose a boosting algorithm that can be used for a nonlinear denoiser. We further implement the proposed algorithm into a shrinkage curve learning denoising algorithm, which is a nonlinear denoiser. Concurrently, the convergence of the proposed algorithm is proved. Experimental results indicate that the proposed algorithm is effective and the dependence of the shrinkage curve learning denoising algorithm on training samples has improved. In addition, the proposed algorithm can achieve better performance in terms of visual quality and peak signal-to-noise ratio (PSNR). [ABSTRACT FROM AUTHOR]

Heart disease is the most life-threatening disease globally, affecting human life very critically. On-time and precise diagnosis of heart disease is vital for the prevention and treatment of heart failure. In the earlier stage, several detection techniques were developed to detect heart disease using machine learning techniques. But the heart problems have not been detected accurately with the minimum required time. This paper presented an effective heart disease prediction system that accurately diagnoses abnormality within a short duration. The feature selection process is carried with stochastic gradient boosting with a recursive feature elimination approach. For classification, the features are clustered by using the adaptive Harris hawk optimization clustering approach. Based on clustered features, the classification is processed with an enhanced deep genetic algorithm. This method improves the performance of the deep neural network by augmenting its initial weights with an enhanced genetic algorithm, which recommends better weights for the neural network. The demonstration of the proposed work is simulated in the MATLAB platform and the dataset used in UCI machine learning repository. The experimental outcome shows that the developed feature selection and classification approach attain 98.36% and 97.3% accuracy compared with the state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

With the rapid development of science and technology, UAVs (Unmanned Aerial Vehicles) have become a new type of weapon in the informatization battlefield by their advantages of low loss and zero casualty rate. In recent years, UAV navigation electromagnetic decoy and electromagnetic interference crashes have activated widespread international attention. The UAV LiDAR detection system is susceptible to electromagnetic interference in a complex electromagnetic environment, which results in inaccurate detection and causes the mission to fail. Therefore, it is very necessary to predict the effects of the electromagnetic environment. Traditional electromagnetic environment effect prediction methods mostly use a single model of mathematical model and machine learning, but the traditional prediction method has poor processing nonlinear ability and weak generalization ability. Therefore, this paper uses the Stacking fusion model algorithm in machine learning to study the electromagnetic environment effect prediction. This paper proposes a Stacking fusion model based on machine learning to predict electromagnetic environment effects. The method consists of Extreme Gradient Boosting algorithm (XGB), Gradient Boosting Decision Tree algorithm (GBDT), K Nearest Neighbor algorithm (KNN), and Decision Tree algorithm (DT). Experimental results show that, comprising with the other seven machine learning algorithms, the Stacking fusion model has a better classification prediction accuracy of 0.9762, a lower Hamming code distance of 0.0336, and a higher Kappa coefficient of 0.955. The fusion model proposed in this paper has a better predictive effect on electromagnetic environment effects and is of great significance for improving the accuracy and safety of UAV LiDAR detection systems under the complex electromagnetic environment on the battlefield. [ABSTRACT FROM AUTHOR]

This paper presents a simple and novel vector control technique for induction motor drives based on sophisticated look-up tables. Vector control and direct torque control (DTC) are two popular approaches for high-performance drives. Though these algorithms give better dynamic torque response, vector control algorithm uses reference frame transformations and DTC gives large ripple in steady state current, torque and flux. To overcome these drawbacks, the proposed vector control algorithm combines the principles of both vector control and DTC. In the proposed algorithm, the d- and q-axes reference currents are generated as per conventional vector control algorithm and regulated according to a switching table as given in DTC. This paper presents two switching tables. Switching table-I is based on the conventional DTC principle, which gives good performance with increased common mode voltage variations. To reduce the common mode voltage variations, switching table-II is presented. To validate the proposed method numerical simulations have been carried out and compared with the existing algorithms. The simulation results show the effectiveness of the proposed technique. [ABSTRACT FROM AUTHOR]

This paper provides an in-depth study and analysis of image processing for graphic design through chaotic encryption combined with a wavelet transform algorithm. Firstly, the traditional Mallat algorithm is optimized; since the mean value of the transform coefficients generated after the wavelet transform of the image is used as the initial value of the chaotic system to iterate, when the image is modified, then the mean value of the wavelet coefficients will also change, and the final iteration comes out as two different sequences using the property that the chaotic system is extremely sensitive to the initial conditions, so the algorithm has a certain sensitivity to tampering and localization effect. The image of the encrypted graphic design is decrypted by the chaos decryption system, and the final image information of the graphic design is obtained. In terms of the security of the graphic design image itself, the complex dynamical properties of chaos are fully utilized to encrypt it, and the algorithm has a good encryption effect after statistical characteristic analysis, attack complexity, difference analysis, adjacent pixel correlation analysis, and key sensitivity analysis. The plaintext image is decomposed in odd-even sequence using the boosting algorithm to get the sequence with an even index and the sequence with an odd index; then, the diffusion algorithm is applied to the two sequences by the prediction and update algorithm, and this process is repeated many times to get the two ciphertext sequences after scrambling, merging these two sequences, and matrixing them to get the ciphertext image. Finally, the testing of the embedded planar designed image revolves around four aspects, namely, image processing, tamper sensitivity, robustness, and imperceptibility, to examine the designed planar designed image system. In the diffusion manipulation, the key matrix for diffusion is obtained using the threshold processing method of the Local Binary Pattern (LBP) algorithm for the matrices generated by the Logistic Chaos system, which improves the randomness of the algorithm. The experimental results verify the effectiveness and security of the algorithm. [ABSTRACT FROM AUTHOR]

Adaptive boosting (Adaboost) is a typical ensemble learning algorithm, which has been studied and widely used in classification tasks. Traditional Adaboost algorithms ignore the sample weights while selecting the most useful features, and most of them ignore the fact that the performances of weak classifiers on each category are always different. On this basis, a weighted feature selection and category classification confidence based Adaboost algorithm is proposed in this paper. The first contribution, is that we propose a weighted feature selection to select the most useful features, which can both distinguish the majority of all samples and the previous misclassified samples. The second contribution, is that we improve the traditional error rate calculation method and propose a category based error rate calculation method to combine the classification abilities of Adaboost on different categories. A detailed performances comparison of various Adaboost algorithms are carried out on eight typical datasets. The experimental results show that the proposed algorithm obtains significant improvement on classification accuracy compared to typical Adaboost algorithms when different datasets especially the unbalanced datasets are used. [ABSTRACT FROM AUTHOR]

With the continuous rise of federated learning, gradient boosting decision tree（GBDT）,as a traditional machine learning method, is gradually applied to federated learning to achieve ideal classification results.Aiming at the problems of the existing horizontal federated learning model of GBDT,such as the accuracy is greatly influenced by non-IID dataset, information leakage and high communication cost, the paper proposed a federated gradient boosting decision tree for non-IID dataset, called nFL-GBDT.Firstly, the algorithm calculated similar samples among the participants by utilizing the LSH,and using weighted gradient constructed the first tree.Secondly, a reliable third party calculated the global leaf weight that only needed one round of communication.Finally, the experimental analysis shows that the algorithm can protect the privacy of the original data, and its communication cost is lower than that of simFL and FederBoost.At the same time, the experiment divides three groups of public data sets according to the imbalance ratio.The results show that the accuracy of this algorithm is improved by 3.53%,5.46% and 4.43% respectively compared with Individual, TFL and F-GBDT-G. [ABSTRACT FROM AUTHOR]

Maximum power point tracking (MPPT) is an indispensable component of the Photovoltaic (PV) systems to maximize efficiency. Perturb and observe (P&O) is one of the prevalent MPPT methods owing to its easier structure for implementation but it suffers from problems of slow tracking and oscillations around the MPP. In this paper, a modified variable step size MPPT algorithm based on P&O method is proposed to obtain maximum power output from the PV system coupled with a boost DC-DC converter. The proposed method employs the scaled power difference as a control variable to enable variation of step size for each cycle. Results obtained by simulation and experimental work verified that the proposed algorithm is potent mitigating the problems related with classical P&O method. [ABSTRACT FROM AUTHOR]

The peak shear strength of clayey soil-geomembrane interfaces is a vital parameter for the design of relevant engineering infrastructure. However, due to the large number of influence factors and the complex action mechanism, accurate prediction of the peak shear strength for clayey soil-geomembrane interfaces is always a challenge. In this paper, a machine learning model was established by combining Mind Evolutionary Algorithm (MEA) and the ensemble algorithm of Adaptive Boosting Algorithm (ADA)-Back Propagation Artificial Neural Network (BPANN) to predict the peak shear strength of clayey soil-geomembrane interfaces based on the results of 623 laboratory interface direct shear experiments. By comparing with the conventional machine learning algorithms, including Particle Swarm Optimisation Algorithm (PSO) and Genetic Algorithm (GA) tuned ADA-BPANN, MEA tuned Support Vector Machine (SVM) and Random Forest (RF), the superior performance of MEA tuned ADA-BPANN has been validated, with higher predicting precision, shorter training time, and the avoidance of local optimum and overfitting. By adopting the proposed novel model, sensitivity analysis was carried out, which indicates that normal pressure has the largest influence on the peak shear strength, followed by geomembrane roughness. Furthermore, an analytical equation was proposed to assess the peak shear strength that allows the usage of machine learning skills for the practitioners with limited machine learning knowledge. The present research highlights the potential of the MEA tuned ADA-BPANN model as a useful tool to assist in preciously estimating the peak shear strength of clayey soil-geomembrane interfaces, which can provide benefits for the design of relevant engineering applications. • The ensemble artificial intelligence algorithms in predicting the peak shear strength of interfaces is compared. • An analytical equation for estimating the peak shear strength is proposed. • Physical experiments are conducted to validate the effectiveness of the proposed analytical equation. [ABSTRACT FROM AUTHOR]

The feature least-mean-square (F-LMS) algorithm has already been introduced to exploit hidden sparsity in lowpass and highpass systems. In this paper, by proposing the extended F-LMS (EF-LMS) algorithm, we boosted the F-LMS algorithm to exploit hidden sparsity in more general systems, those which are neither lowpass nor highpass. To this end, by means of the so-called feature matrix, we reveal the hidden sparsity in coefficients and utilize the l 1 -norm to exploit the exposed sparsity. As a result, the EF-LMS algorithm will improve the convergence rate and the steady-state mean-squared error (MSE) as compared to the traditional least-mean-square algorithm. Moreover, in this work, we analyze the convergence behavior of the coefficient vector and the steady-state MSE performance of the EF-LMS algorithm. Through synthetic and real-world experiments, it has been seen that the EF-LMS algorithm can improve the convergence rate and the steady-state MSE whenever the hidden sparsity is revealed. [ABSTRACT FROM AUTHOR]

Recent years have witnessed extensive studies of graph classification due to the rapid increase in applications involving structural data and complex relationships. To support graph classification, all existing methods require that training graphs should be relevant (or belong) to the target class, but cannot integrate graphs irrelevant to the class of interest into the learning process. In this paper, we study a new universum graph classification framework which leverages additional 'non-example' graphs to help improve the graph classification accuracy. We argue that although universum graphs do not belong to the target class, they may contain meaningful structure patterns to help enrich the feature space for graph representation and classification. To support universum graph classification, we propose a mathematical programming algorithm, ugBoost, which integrates discriminative subgraph selection and margin maximization into a unified framework to fully exploit the universum. Because informative subgraph exploration in a universum setting requires the search of a large space, we derive an upper bound discriminative score for each subgraph and employ a branch-and-bound scheme to prune the search space. By using the explored subgraphs, our graph classification model intends to maximize the margin between positive and negative graphs and minimize the loss on the universum graph examples simultaneously. The subgraph exploration and the learning are integrated and performed iteratively so that each can be beneficial to the other. Experimental results and comparisons on real-world dataset demonstrate the performance of our algorithm. [ABSTRACT FROM AUTHOR]

This paper gives a survey of the inverse boosting algorithm which employs an inverse error vector to produce new sample distributions. The experimental result shows that the inverse boosting can outperform normal boosting in some cases. Further experiments on several benchmark real-world data sets available from the UCI repository are taken to get a better insight into the inverse boosting algorithm, and then we find that the performance of the ensemble is determined by the performance of its base classifiers. This distinctive feature of inverse boosting indicates that traditional ways to improve the performance of an ensemble through enhancing the diversity between the base classifier are invalid here. Therefore, this paper proposes a method with pertinence to improve the performance of inverse boosting. [ABSTRACT FROM PUBLISHER]

Filter or screening methods are often used as a preprocessing step for reducing the number of variables used by a learning algorithm in obtaining a classification or regression model. While there are many such filter methods, there is a need for an objective evaluation of these methods. Such an evaluation is needed to compare them with each other and also to answer whether they are at all useful, or a learning algorithm could do a better job without them. For this purpose, many popular screening methods are partnered in this paper with three regression learners and five classification learners and evaluated on ten real datasets to obtain accuracy criteria such as R-square and area under the ROC curve (AUC). The obtained results are compared through curve plots and comparison tables in order to find out whether screening methods help improve the performance of learning algorithms and how they fare with each other. Our findings revealed that the screening methods were useful in improving the prediction of the best learner on two regression and two classification datasets out of the ten datasets evaluated. [ABSTRACT FROM AUTHOR]

This paper introduces an improved differential evolution algorithm based on cooperative multi-population (CMp-DE for short), which combines diverse population collaboration mechanisms and catalytic factors into an improved differential evolution framework. By harnessing various population collaboration mechanisms, the algorithm enhances the diversity of individuals within populations during initial iterations and reduces it during later iterations, thereby harmonizing the algorithm's exploratory and exploitative capabilities. Furthermore, a novel mutation operator is proposed that divides the iterative process into exploration and exploitation phases, thereby augmenting the algorithm's global exploration prowess. Lastly, a catalytic operator is introduced to generate new individuals near post-crossover individuals based on a specified rule, which enhances the algorithm's ability to escape local optima and increasing stability. The proposed CMp-DE is benchmarked against the CEC2017 benchmark test functions and compared against 13 algorithms, including five differential evolution algorithms and their variants, as well as eight state-of-the-art metaheuristic optimization algorithms. This evaluation assesses the CMp-DE's solution accuracy, convergence, stability, and scalability. Finally, the applicability of CMp-DE is validated by addressing six practical optimization problems. The experimental results show that CMp-DE surpasses other algorithms in terms of both convergence accuracy and robustness. Moreover, integrating a catalytic operator with other optimization algorithms notably boosts performance in convergence accuracy and stability. The inclusion of the catalytic operator has significantly enhanced the performance of algorithms compared to their performance before its addition. This underscores the potential of the catalytic operator in improving the performance of various algorithms, particularly in terms of convergence accuracy and robustness. [ABSTRACT FROM AUTHOR]

Total thrust and torque are two key indicators of shield movement performance. Most existing data-driven machine learning studies focus on developing more accurate models for predicting total thrust and torque but overlook the interpretability of the models. To address this black-box issue, this study proposes an interpretable probabilistic prediction algorithm for the shield movement performance. The algorithm uses the natural gradient boosting (NGBoost) model to iteratively update the parametric probability distributions (e.g., mean and variance) and achieve probabilistic predictions of the total thrust and torque. The impact of each feature on the prediction values and uncertainty is quantified by extending the importance analysis of a single deterministic predictive value to both the mean and variance. The feature interactions are analyzed and their predictive contributions are quantified by the shapley additive explanations (SHAP) method. The transparency of the NGBoost model is improved through the visualization of the decision-making process. A shield tunneling project in Hangzhou is used to validate the effectiveness of the proposed algorithm. The results indicate that the NGboost model outperforms other five models in terms of accuracy. The prediction results are interpretable, and the interpretable probabilistic model provides decision-makers with a more intuitive and reliable reference. [ABSTRACT FROM AUTHOR]

In recent times, companies and institutions globally are increasingly adopting automated systems for recording employee attendance due to the inefficiency and error-prone nature of traditional methods. Face recognition is the fastest, most natural, and most accurate way to identify someone, despite its difficulty. Remote deployment and control of the technology using internet of things (IoT) protocols provides real-time attendance data worldwide. We use the Haar-cascade algorithm to detect and extract features and the adaptive boost algorithm confused with convolutional neural network (CNN) algorithm to recognize the face in our proposed smart attendance system. Per frame, the proposed system recognizes multiple faces. Face recognition in 18 conditions was designed into the proposed system to ensure its versatility. The system's graphical user interface (GUI) was made for average users. This work is more important because IoT technology records student attendance and sends data to authorities. We use Raspberry Pi 4 and camera module for our suggested system. Python and OpenCV libraries tested the multiple face image recognition proposal in 18 situations under four conditions. Single-face image recognition was compared to other methods. In most cases, the proposed method was 100% accurate and outperformed related methods. [ABSTRACT FROM AUTHOR]

We present a correction and an improvement to Algorithm 1010 [A. Orellana and C. De Michele 2020]. [ABSTRACT FROM AUTHOR]

Pharmacologically active molecules can provide remedies for a range of different illnesses and infections. Therefore, the search for such bioactive molecules has been an enduring mission. As such, there is a need to employ a more suitable, reliable, and robust classification method for enhancing the prediction of the existence of new bioactive molecules. In this paper, we adopt a recently developed combination of different boosting methods (Adaboost) for the prediction of new bioactive molecules. We conducted the research experiments utilizing the widely used MDL Drug Data Report (MDDR) database. The proposed boosting method generated better results than other machine learning methods. This finding suggests that the method is suitable for inclusion among the in silico tools for use in cheminformatics, computational chemistry and molecular biology. [ABSTRACT FROM AUTHOR]

Prediction-based dynamic multiobjective optimization evolutionary algorithms have become one of the mainstream methods for solving dynamic multiobjective optimization problems. However, the unknown nonlinear relationships in sequential environments bring great challenge to the construction of prediction model and the inevitable error between the historical obtained solutions and the real pareto-optimal solutions troubles the prediction accuracy. In this paper, a gradient boosting regression tree based dynamic multiobjective optimization evolutionary algorithm is proposed, called MOEA/D-XGB. The time series solutions formed by subspace decomposition are trained in the XGBoost-based predictor to produce a high-quality initial population when environmental change occurs. And a novel population promotion strategy based on generalized additive model is proposed to improve the quality of historical obtained solutions. The performance comparisons with five state-of-the-art algorithms have shown that MOEA/D-XGB achieves best performance in 59 out of 70 experiments on MIGD and 60 out of 70 experiments on MHV, respectively, which demonstrates that the proposed design is capable of significantly improving the performance of dynamic multiobjective optimization. [ABSTRACT FROM AUTHOR]

[Display omitted] • An entropy-aggregation layer proposed to strengthen reasoning ability of GCN. • An ingenious checking part based on self-training to enhance node classification. • Sufficient experiments and analyses to validate the superiority of ES-GCN. Recently, graph convolutional networks (GCNs) have achieved significant success in many graph-based learning tasks, especially for node classification, due to its excellent ability in representation learning. Nevertheless, it remains challenging for GCN models to obtain satisfying predictions on graphs where only few nodes are with known labels. In this paper, we propose a novel entropy-aware self-training algorithm to boost semi-supervised node classification on graphs with little supervised information. Firstly, an entropy-aggregation layer is developed to strengthen the reasoning ability of GCN models. To the best of our knowledge, this is the first work to combine the entropy-based random walk theory with GCN design. Furthermore, we propose an ingenious checking part to add new nodes as supervision after each training round to enhance node prediction. In particular, the checking part is designed based on aggregated features, which is demonstrated more effective than previous methods and boosts node classification significantly. The proposed algorithm is validated on six public benchmarks in comparison with several state-of-the-art baseline algorithms, and the results illustrate its excellent performance. [ABSTRACT FROM AUTHOR]