A Self-Adapting and Efficient Dandelion Algorithm and Its Application to Feature Selection for Credit Card Fraud Detection

A dandelion algorithm(DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA,which might not be appropriate for all optimization problems. A self-adapting and efficient dandelion algorithm is proposed in this work to lower the number of DA's parameters and simplify DA's structure. Only the normal sowing operator is retained;while the other operators are discarded. An adaptive seeding radius strategy is designed for the core dandelion. The results show that the proposed algorithm achieves better performance on the standard test functions with less time consumption than its competitive peers. In addition, the proposed algorithm is applied to feature selection for credit card fraud detection(CCFD), and the results indicate that it can obtain higher classification and detection performance than the-state-of-the-art methods.

Maximizing Resource Efficiency in Cloud Data Centers through Knowledge-Based Flower Pollination Algorithm (KB-FPA)

Cloud computing is a dynamic and rapidly evolving field,where the demand for resources fluctuates continuously.This paper delves into the imperative need for adaptability in the allocation of resources to applications and services within cloud computing environments.The motivation stems from the pressing issue of accommodating fluctuating levels of user demand efficiently.By adhering to the proposed resource allocation method,we aim to achieve a substantial reduction in energy consumption.This reduction hinges on the precise and efficient allocation of resources to the tasks that require those most,aligning with the broader goal of sustainable and eco-friendly cloud computing systems.To enhance the resource allocation process,we introduce a novel knowledge-based optimization algorithm.In this study,we rigorously evaluate its efficacy by comparing it to existing algorithms,including the Flower Pollination Algorithm(FPA),Spark Lion Whale Optimization(SLWO),and Firefly Algo-rithm.Our findings reveal that our proposed algorithm,Knowledge Based Flower Pollination Algorithm(KB-FPA),consistently outperforms these conventional methods in both resource allocation efficiency and energy consumption reduction.This paper underscores the profound significance of resource allocation in the realm of cloud computing.By addressing the critical issue of adaptability and energy efficiency,it lays the groundwork for a more sustainable future in cloud computing systems.Our contribution to the field lies in the introduction of a new resource allocation strategy,offering the potential for significantly improved efficiency and sustainability within cloud computing infrastructures.

LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment

In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account.

Data-Driven Learning Control Algorithms for Unachievable Tracking Problems

For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to investigate solutions using the Ptype learning control scheme. Initially, we demonstrate the necessity of gradient information for achieving the best approximation.Subsequently, we propose an input-output-driven learning gain design to handle the imprecise gradients of a class of uncertain systems. However, it is discovered that the desired performance may not be attainable when faced with incomplete information.To address this issue, an extended iterative learning control scheme is introduced. In this scheme, the tracking errors are modified through output data sampling, which incorporates lowmemory footprints and offers flexibility in learning gain design.The input sequence is shown to converge towards the desired input, resulting in an output that is closest to the given reference in the least square sense. Numerical simulations are provided to validate the theoretical findings.

An Innovative K-Anonymity Privacy-Preserving Algorithm to Improve Data Availability in the Context of Big Data

The development of technologies such as big data and blockchain has brought convenience to life,but at the same time,privacy and security issues are becoming more and more prominent.The K-anonymity algorithm is an effective and low computational complexity privacy-preserving algorithm that can safeguard users’privacy by anonymizing big data.However,the algorithm currently suffers from the problem of focusing only on improving user privacy while ignoring data availability.In addition,ignoring the impact of quasi-identified attributes on sensitive attributes causes the usability of the processed data on statistical analysis to be reduced.Based on this,we propose a new K-anonymity algorithm to solve the privacy security problem in the context of big data,while guaranteeing improved data usability.Specifically,we construct a new information loss function based on the information quantity theory.Considering that different quasi-identification attributes have different impacts on sensitive attributes,we set weights for each quasi-identification attribute when designing the information loss function.In addition,to reduce information loss,we improve K-anonymity in two ways.First,we make the loss of information smaller than in the original table while guaranteeing privacy based on common artificial intelligence algorithms,i.e.,greedy algorithm and 2-means clustering algorithm.In addition,we improve the 2-means clustering algorithm by designing a mean-center method to select the initial center of mass.Meanwhile,we design the K-anonymity algorithm of this scheme based on the constructed information loss function,the improved 2-means clustering algorithm,and the greedy algorithm,which reduces the information loss.Finally,we experimentally demonstrate the effectiveness of the algorithm in improving the effect of 2-means clustering and reducing information loss.

Marine Predators Algorithm with Deep Learning-Based Leukemia Cancer Classification on Medical Images

In blood or bone marrow,leukemia is a form of cancer.A person with leukemia has an expansion of white blood cells(WBCs).It primarily affects children and rarely affects adults.Treatment depends on the type of leukemia and the extent to which cancer has established throughout the body.Identifying leukemia in the initial stage is vital to providing timely patient care.Medical image-analysis-related approaches grant safer,quicker,and less costly solutions while ignoring the difficulties of these invasive processes.It can be simple to generalize Computer vision(CV)-based and image-processing techniques and eradicate human error.Many researchers have implemented computer-aided diagnosticmethods andmachine learning(ML)for laboratory image analysis,hopefully overcoming the limitations of late leukemia detection and determining its subgroups.This study establishes a Marine Predators Algorithm with Deep Learning Leukemia Cancer Classification(MPADL-LCC)algorithm onMedical Images.The projectedMPADL-LCC system uses a bilateral filtering(BF)technique to pre-process medical images.The MPADL-LCC system uses Faster SqueezeNet withMarine Predators Algorithm(MPA)as a hyperparameter optimizer for feature extraction.Lastly,the denoising autoencoder(DAE)methodology can be executed to accurately detect and classify leukemia cancer.The hyperparameter tuning process using MPA helps enhance leukemia cancer classification performance.Simulation results are compared with other recent approaches concerning various measurements and the MPADL-LCC algorithm exhibits the best results over other recent approaches.

Hybrid Gene Selection Methods for High-Dimensional Lung Cancer Data Using Improved Arithmetic Optimization Algorithm

Lung cancer is among the most frequent cancers in the world,with over one million deaths per year.Classification is required for lung cancer diagnosis and therapy to be effective,accurate,and reliable.Gene expression microarrays have made it possible to find genetic biomarkers for cancer diagnosis and prediction in a high-throughput manner.Machine Learning(ML)has been widely used to diagnose and classify lung cancer where the performance of ML methods is evaluated to identify the appropriate technique.Identifying and selecting the gene expression patterns can help in lung cancer diagnoses and classification.Normally,microarrays include several genes and may cause confusion or false prediction.Therefore,the Arithmetic Optimization Algorithm(AOA)is used to identify the optimal gene subset to reduce the number of selected genes.Which can allow the classifiers to yield the best performance for lung cancer classification.In addition,we proposed a modified version of AOA which can work effectively on the high dimensional dataset.In the modified AOA,the features are ranked by their weights and are used to initialize the AOA population.The exploitation process of AOA is then enhanced by developing a local search algorithm based on two neighborhood strategies.Finally,the efficiency of the proposed methods was evaluated on gene expression datasets related to Lung cancer using stratified 4-fold cross-validation.The method’s efficacy in selecting the optimal gene subset is underscored by its ability to maintain feature proportions between 10%to 25%.Moreover,the approach significantly enhances lung cancer prediction accuracy.For instance,Lung_Harvard1 achieved an accuracy of 97.5%,Lung_Harvard2 and Lung_Michigan datasets both achieved 100%,Lung_Adenocarcinoma obtained an accuracy of 88.2%,and Lung_Ontario achieved an accuracy of 87.5%.In conclusion,the results indicate the potential promise of the proposed modified AOA approach in classifying microarray cancer data.

A method for cleaning wind power anomaly data by combining image processing with community detection algorithms

Current methodologies for cleaning wind power anomaly data exhibit limited capabilities in identifying abnormal data within extensive datasets and struggle to accommodate the considerable variability and intricacy of wind farm data.Consequently,a method for cleaning wind power anomaly data by combining image processing with community detection algorithms(CWPAD-IPCDA)is proposed.To precisely identify and initially clean anomalous data,wind power curve(WPC)images are converted into graph structures,which employ the Louvain community recognition algorithm and graph-theoretic methods for community detection and segmentation.Furthermore,the mathematical morphology operation(MMO)determines the main part of the initially cleaned wind power curve images and maps them back to the normal wind power points to complete the final cleaning.The CWPAD-IPCDA method was applied to clean datasets from 25 wind turbines(WTs)in two wind farms in northwest China to validate its feasibility.A comparison was conducted using density-based spatial clustering of applications with noise(DBSCAN)algorithm,an improved isolation forest algorithm,and an image-based(IB)algorithm.The experimental results demonstrate that the CWPAD-IPCDA method surpasses the other three algorithms,achieving an approximately 7.23%higher average data cleaning rate.The mean value of the sum of the squared errors(SSE)of the dataset after cleaning is approximately 6.887 lower than that of the other algorithms.Moreover,the mean of overall accuracy,as measured by the F1-score,exceeds that of the other methods by approximately 10.49%;this indicates that the CWPAD-IPCDA method is more conducive to improving the accuracy and reliability of wind power curve modeling and wind farm power forecasting.

Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm

Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.

A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation

It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.

Horizontal-to-vertical spectral ratio inversion method based on multimodal forest optimization algorithm

The exploration of urban underground spaces is of great significance to urban planning,geological disaster prevention,resource exploration and environmental monitoring.However,due to the existing of severe interferences,conventional seismic methods cannot adapt to the complex urban environment well.Since adopting the single-node data acquisition method and taking the seismic ambient noise as the signal,the microtremor horizontal-to-vertical spectral ratio(HVSR)method can effectively avoid the strong interference problems caused by the complex urban environment,which could obtain information such as S-wave velocity and thickness of underground formations by fitting the microtremor HVSR curve.Nevertheless,HVSR curve inversion is a multi-parameter curve fitting process.And conventional inversion methods can easily converge to the local minimum,which will directly affect the reliability of the inversion results.Thus,the authors propose a HVSR inversion method based on the multimodal forest optimization algorithm,which uses the efficient clustering technique and locates the global optimum quickly.Tests on synthetic data show that the inversion results of the proposed method are consistent with the forward model.Both the adaption and stability to the abnormal layer velocity model are demonstrated.The results of the real field data are also verified by the drilling information.

Novel Adaptive Memory Event-Triggered-Based Fuzzy Robust Control for Nonlinear Networked Systems via the Differential Evolution Algorithm

This article mainly investigates the fuzzy optimization robust control issue for nonlinear networked systems characterized by the interval type-2(IT2)fuzzy technique under a differential evolution algorithm.To provide a more reasonable utilization of the constrained communication channel,a novel adaptive memory event-triggered(AMET)mechanism is developed,where two event-triggered thresholds can be dynamically adjusted in the light of the current system information and the transmitted historical data.Sufficient conditions with less conservative design of the fuzzy imperfect premise matching(IPM)controller are presented by introducing the Wirtinger-based integral inequality,the information of membership functions(MFs)and slack matrices.Subsequently,under the IPM policy,a new MFs intelligent optimization technique that takes advantage of the differential evolution algorithm is first provided for IT2 TakagiSugeno(T-S)fuzzy systems to update the fuzzy controller MFs in real-time and achieve a better system control effect.Finally,simulation results demonstrate that the proposed control scheme can obtain better system performance in the case of using fewer communication resources.

Congestion Control Algorithms for the Internet-A Secondary Publication

In the last five years,there has been a V-shaped recovery in the number of papers on congestion control algorithms on the Internet.In this paper,congestion problems on the Internet are discussed,such as congestion collapse and bufferbloat from the perspective of the necessity of congestion control algorithms.The typical congestion control algorithms are introduced,and the research areas and methods of congestion control algorithms are described.Recent research trends and future prospects of congestion control algorithms are also presented.

A Study of EM Algorithm as an Imputation Method: A Model-Based Simulation Study with Application to a Synthetic Compositional Data

Compositional data, such as relative information, is a crucial aspect of machine learning and other related fields. It is typically recorded as closed data or sums to a constant, like 100%. The statistical linear model is the most used technique for identifying hidden relationships between underlying random variables of interest. However, data quality is a significant challenge in machine learning, especially when missing data is present. The linear regression model is a commonly used statistical modeling technique used in various applications to find relationships between variables of interest. When estimating linear regression parameters which are useful for things like future prediction and partial effects analysis of independent variables, maximum likelihood estimation (MLE) is the method of choice. However, many datasets contain missing observations, which can lead to costly and time-consuming data recovery. To address this issue, the expectation-maximization (EM) algorithm has been suggested as a solution for situations including missing data. The EM algorithm repeatedly finds the best estimates of parameters in statistical models that depend on variables or data that have not been observed. This is called maximum likelihood or maximum a posteriori (MAP). Using the present estimate as input, the expectation (E) step constructs a log-likelihood function. Finding the parameters that maximize the anticipated log-likelihood, as determined in the E step, is the job of the maximization (M) phase. This study looked at how well the EM algorithm worked on a made-up compositional dataset with missing observations. It used both the robust least square version and ordinary least square regression techniques. The efficacy of the EM algorithm was compared with two alternative imputation techniques, k-Nearest Neighbor (k-NN) and mean imputation (), in terms of Aitchison distances and covariance.

东海OBN和三维DAS-VSP数据的联合采集与处理方法研究

近年来,光纤传感技术已经应用于地面地震数据、海洋地震数据、井中地震数据和井地联合地震数据的采集,推动了光纤传感技术在地球物理特别是地震数据采集中的应用。井地或井海联合地震勘探是陆地或海洋三维地震与三维DAS-VSP勘探相结合形成的三维立体地震勘探方法,利用井海联采的三维DAS-VSP数据,可以获得地下井周围准确的时深关系、地层速度、反褶积算子、球面扩散补偿因子、吸收衰减因子、各向异性参数和井筒周围的高分辨率构造成像,这些参数可以基于井驱处理提高陆地或海洋三维地震数据的处理质量。在中国东海某OBN数据勘探中首次开展了井下套管内铠装光缆同步采集的三维DAS-VSP数据的处理方法研究以及成像处理。首先,采用常规的三维VSP数据成像处理技术对三维DAS-VSP数据进行常规处理,具体处理流程包括:观测系统定义、预处理、初至拾取、静校正、振幅补偿、反褶积、波场分离、速度分析与建模和利用上行反射波进行井周围地层的构造成像;然后,再根据海上三维DAS-VSP数据下行多次波的特点,研发了海上三维DAS-VSP数据的下行多次波成像技术,扩展了三维DAS-VSP数据成像范围,提高了三维DAS-VSP数据成像的整体质量。与本工区早期的三维OBC数据成像结果相比,本次三维DAS-VSP数据的下行多次波成像结果表明,井周围三维构造成像质量得到了显著改进,大幅度扩展了成像范围;新采集的OBN数据和三维DAS-VSP数据的成像结果展示了更为详细和较高分辨率的构造成像,基于新的成像资料,对储层顶部和储层内流体的识别与追踪变得更加容易和清晰。井海联采技术生产效率高且成本低,既能快速获得三维DAS-VSP数据及成像,还能对三维海洋地震数据进行井驱提高分辨率处理。此外,三维OBN或OBC数据和三维DAS-VSP数据还能够进行融合处理,实现井地或井海同步采集数据的联合偏移成像,可以大幅度提高三维海洋地震数据的成像品质,值得在有条件的地方推广应用。

基于“脑肠轴理论”探讨龟羚帕安丸对PD大鼠纹状体DA及血清CCK、VIP水平影响的研究

目的:基于“脑肠轴理论”探讨龟羚帕安丸对PD大鼠纹状体裂解液多巴胺(Dopamine,DA)、血清胆囊收缩素(cholecystokinin,CCK)及血管活性肠肽(vasoactive intestinal peptide,VIP)水平的影响。方法:采用6-羟基多巴胺注射法制作PD大鼠模型,随机分为模型组、西药组、中药高、中、低剂量组,每组15只,另设15只假手术组。模型组及假手术组给予等容积生理盐水灌胃,其余组给予相应药物灌胃,连续给药4周。酶联免疫吸附测定法(ELISA)检测纹状体裂解液DA及血清CCK、VIP水平。结果:模型组大鼠纹状体DA、血清CCK及VIP水平显著降低;中药各剂量组、西药组大鼠纹状体DA、血清CCK及VIP水平明显均增加(P<0.01)。结论:龟羚帕安丸具有明显神经保护作用,作用机制与激活脑肠轴、增加血清CCK及VIP水平、增加中脑黑质纹状体DA的水平、发挥改善肠道功能作用有关。

采用非稳相偏振滤波的DAS-VSP数据P/S波分离方法及其应用

分布式光纤声学传感(DAS)因成本低、易布设以及高密度采样等优势正成为重要的地震观测技术,尤其是越来越多地与垂直地震剖面(VSP)结合,用于主动地震勘探或被动地震监测.DAS传感器通过感知弹性波场产生的轴向应变或应变速率来观测地震波场振动.然而,目前单分量DAS-VSP数据未完整地记录地下弹性波场的三维矢量振动信号,因此如何从中分离出P波或S波用于后续地震成像与参数反演是重要且很有挑战的课题.以弹性波传播理论为基础,本文根据P波和S波的频散关系估算接收点处各自的偏振方向,通过随频率和空间位置变化的偏振滤波实现DAS-VSP数据的P/S波分离.理论模型合成数据与东海实际DAS-VSP数据实验结果表明,该方法能有效地将P波和S波信号从单分量DAS-VSP数据中分离出来,可为后续纵横波速度反演、PP与PS波成像提供关键的数据预条件处理.

基于Adaboost-PSO-SVM的铝电解槽健康状态诊断方法研究

针对铝电解槽在铝电解生产过程中故障频发的问题,提出了一种基于支持向量机(support vector machine,SVM)的铝电解槽健康状态诊断模型,考虑传统的支持向量机只能适用于二分类问题,采用自适应推进算法(adaptive boosting,Adaboost)将支持向量机的二分类问题转化为多分类问题用于求解铝电解槽健康状态诊断问题,充分考虑了子模型的权重,强化了模型的适用性。并利用粒子群优化算法(particle swarm optimization,PSO)对其超参数寻优,提高模型的预测精度。实验结果表明,提出的铝电解槽健康状态诊断模型的准确率和Macro-F1分数分别达到94.70%和0.9453,相较于其他传统模型均有显著提升。

Recommendation Algorithm Integrating CNN and Attention System in Data Extraction

With the rapid development of the Internet globally since the 21st century,the amount of data information has increased exponentially.Data helps improve people’s livelihood and working conditions,as well as learning efficiency.Therefore,data extraction,analysis,and processing have become a hot issue for people from all walks of life.Traditional recommendation algorithm still has some problems,such as inaccuracy,less diversity,and low performance.To solve these problems and improve the accuracy and variety of the recommendation algorithms,the research combines the convolutional neural networks(CNN)and the attention model to design a recommendation algorithm based on the neural network framework.Through the text convolutional network,the input layer in CNN has transformed into two channels:static ones and non-static ones.Meanwhile,the self-attention system focuses on the system so that data can be better processed and the accuracy of feature extraction becomes higher.The recommendation algorithm combines CNN and attention system and divides the embedding layer into user information feature embedding and data name feature extraction embedding.It obtains data name features through a convolution kernel.Finally,the top pooling layer obtains the length vector.The attention system layer obtains the characteristics of the data type.Experimental results show that the proposed recommendation algorithm that combines CNN and the attention system can perform better in data extraction than the traditional CNN algorithm and other recommendation algorithms that are popular at the present stage.The proposed algorithm shows excellent accuracy and robustness.

Adaptive Fault Estimation for Dynamics of High Speed Train Based on Robust UKF Algorithm

This paper proposes an adaptive unscented Kalman filter algorithm(ARUKF)to implement fault estimation for the dynamics of high⁃speed train(HST)with measurement uncertainty and time⁃varying noise with unknown statistics.Firstly,regarding the actuator and sensor fault as the auxiliary variables of the dynamics of HST,an augmented system is established,and the fault estimation problem for dynamics of HST is formulated as the state estimation of the augmented system.Then,considering the measurement uncertainties,a robust lower bound is proposed to modify the update of the UKF to decrease the influence of measurement uncertainty on the filtering accuracy.Further,considering the unknown time⁃varying noise of the dynamics of HST,an adaptive UKF algorithm based on moving window is proposed to estimate the time⁃varying noise so that accurate concurrent actuator and sensor fault estimations of dynamics of HST is implemented.Finally,a five-car model of HST is given to show the effectiveness of this method.