Identification of time-varying system and energy-based optimization of adaptive control in seismically excited structure

The combination of structural health monitoring and vibration control is of great importance to provide components of smart structures.While synthetic algorithms have been proposed,adaptive control that is compatible with changing conditions still needs to be used,and time-varying systems are required to be simultaneously estimated with the application of adaptive control.In this research,the identification of structural time-varying dynamic characteristics and optimized simple adaptive control are integrated.First,reduced variations of physical parameters are estimated online using the multiple forgetting factor recursive least squares(MFRLS)method.Then,the energy from the structural vibration is simultaneously specified to optimize the control force with the identified parameters to be operational.Optimization is also performed based on the probability density function of the energy under the seismic excitation at any time.Finally,the optimal control force is obtained by the simple adaptive control(SAC)algorithm and energy coefficient.A numerical example and benchmark structure are employed to investigate the efficiency of the proposed approach.The simulation results revealed the effectiveness of the integrated online identification and optimal adaptive control in systems.

A Spectral Convolutional Neural Network Model Based on Adaptive Fick’s Law for Hyperspectral Image Classification

Hyperspectral image classification stands as a pivotal task within the field of remote sensing,yet achieving highprecision classification remains a significant challenge.In response to this challenge,a Spectral Convolutional Neural Network model based on Adaptive Fick’s Law Algorithm(AFLA-SCNN)is proposed.The Adaptive Fick’s Law Algorithm(AFLA)constitutes a novel metaheuristic algorithm introduced herein,encompassing three new strategies:Adaptive weight factor,Gaussian mutation,and probability update policy.With adaptive weight factor,the algorithmcan adjust theweights according to the change in the number of iterations to improve the performance of the algorithm.Gaussianmutation helps the algorithm avoid falling into local optimal solutions and improves the searchability of the algorithm.The probability update strategy helps to improve the exploitability and adaptability of the algorithm.Within the AFLA-SCNN model,AFLA is employed to optimize two hyperparameters in the SCNN model,namely,“numEpochs”and“miniBatchSize”,to attain their optimal values.AFLA’s performance is initially validated across 28 functions in 10D,30D,and 50D for CEC2013 and 29 functions in 10D,30D,and 50D for CEC2017.Experimental results indicate AFLA’s marked performance superiority over nine other prominent optimization algorithms.Subsequently,the AFLA-SCNN model was compared with the Spectral Convolutional Neural Network model based on Fick’s Law Algorithm(FLA-SCNN),Spectral Convolutional Neural Network model based on Harris Hawks Optimization(HHO-SCNN),Spectral Convolutional Neural Network model based onDifferential Evolution(DE-SCNN),SpectralConvolutionalNeuralNetwork(SCNN)model,and SupportVector Machines(SVM)model using the Indian Pines dataset and PaviaUniversity dataset.The experimental results show that the AFLA-SCNN model outperforms other models in terms of Accuracy,Precision,Recall,and F1-score on Indian Pines and Pavia University.Among them,the Accuracy of the AFLA-SCNN model on Indian Pines reached 99.875%,and the Accuracy on PaviaUniversity reached 98.022%.In conclusion,our proposed AFLA-SCNN model is deemed to significantly enhance the precision of hyperspectral image classification.

Adaptive Algorithms of Nonlinear Approximation with Finite Terms

This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy algorithm Gm^P（., Ψ）. This makes the greedy algorithm realize the near best approximation in practice. Moreover, we study the efficiency of the finite-term approximation of another Mgorithm introduced by Birge and Massart.

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.

Adaptive block greedy algorithms for receiving multi-narrowband signal in compressive sensing radar reconnaissance receiver

This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications.

Blockchain technology‑based FinTech banking sector involvement using adaptive neuro‑fuzzy‑based K‑nearest neighbors algorithm

The study aims to investigate the financial technology(FinTech)factors influencing Chinese banking performance.Financial expectations and global realities may be changed by FinTech’s multidimensional scope,which is lacking in the traditional financial sector.The use of technology to automate financial services is becoming more important for economic organizations and industries because the digital age has seen a period of transition in terms of consumers and personalization.The future of FinTech will be shaped by technologies like the Internet of Things,blockchain,and artificial intelligence.The involvement of these platforms in financial services is a major concern for global business growth.FinTech is becoming more popular with customers because of such benefits.FinTech has driven a fundamental change within the financial services industry,placing the client at the center of everything.Protection has become a primary focus since data are a component of FinTech transactions.The task of consolidating research reports for consensus is very manual,as there is no standardized format.Although existing research has proposed certain methods,they have certain drawbacks in FinTech payment systems(including cryptocurrencies),credit markets(including peer-to-peer lending),and insurance systems.This paper implements blockchainbased financial technology for the banking sector to overcome these transition issues.In this study,we have proposed an adaptive neuro-fuzzy-based K-nearest neighbors’algorithm.The chaotic improved foraging optimization algorithm is used to optimize the proposed method.The rolling window autoregressive lag modeling approach analyzes FinTech growth.The proposed algorithm is compared with existing approaches to demonstrate its efficiency.The findings showed that it achieved 91%accuracy,90%privacy,96%robustness,and 25%cyber-risk performance.Compared with traditional approaches,the recommended strategy will be more convenient,safe,and effective in the transition period.

Adaptive genetic algorithm-based design of gamma-graphyne nanoribbon incorporating diamond-shaped segment with high thermoelectric conversion efficiency

The gamma-graphyne nanoribbons(γ-GYNRs) incorporating diamond-shaped segment(DSSs) with excellent thermoelectric properties are systematically investigated by combining nonequilibrium Green’s functions with adaptive genetic algorithm. Our calculations show that the adaptive genetic algorithm is efficient and accurate in the process of identifying structures with excellent thermoelectric performance. In multiple rounds, an average of 476 candidates(only 2.88% of all16512 candidate structures) are calculated to obtain the structures with extremely high thermoelectric conversion efficiency.The room temperature thermoelectric figure of merit(ZT) of the optimal γ-GYNR incorporating DSSs is 1.622, which is about 5.4 times higher than that of pristine γ-GYNR(length 23.693 nm and width 2.660 nm). The significant improvement of thermoelectric performance of the optimal γ-GYNR is mainly attributed to the maximum balance of inhibition of thermal conductance(proactive effect) and reduction of thermal power factor(side effect). Moreover, through exploration of the main variables affecting the genetic algorithm, it is revealed that the efficiency of the genetic algorithm can be improved by optimizing the initial population gene pool, selecting a higher individual retention rate and a lower mutation rate. The results presented in this paper validate the effectiveness of genetic algorithm in accelerating the exploration of γ-GYNRs with high thermoelectric conversion efficiency, and could provide a new development solution for carbon-based thermoelectric materials.

Efficient Clustering Using Memetic Adaptive Hill Climbing Algorithm in WSN

Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node to the base station through efficient routing mechanisms.The efficiency of the sensor node is energy bounded,acts as a concentrated area for most researchers to offer a solution for the early draining power of sensors.Network management plays a significant role in wireless sensor networks,which was obsessed with the factors like the reliability of the network,resource management,energy-efficient routing,and scalability of services.The topology of the wireless sensor networks acts dri-ven factor for network efficiency which can be effectively maintained by perform-ing the clustering process effectively.More solutions and clustering algorithms have been offered by various researchers,but the concern of reduced efficiency in the routing process and network management still exists.This research paper offers a hybrid algorithm composed of a memetic algorithm which is an enhanced version of a genetic algorithm integrated with the adaptive hill-climbing algorithm for performing energy-efficient clustering process in the wireless sensor networks.The memetic algorithm employs a local searching methodology to mitigate the premature convergence,while the adaptive hill-climbing algorithm is a local search algorithm that persistently migrates towards the increased elevation to determine the peak of the mountain(i.e.,)best cluster head in the wireless sensor networks.The proposed hybrid algorithm is compared with the state of art clus-tering algorithm to prove that the proposed algorithm outperforms in terms of a network life-time,energy consumption,throughput,etc.

Adaptive Butterfly Optimization Algorithm(ABOA)Based Feature Selection and Deep Neural Network(DNN)for Detection of Distributed Denial-of-Service(DDoS)Attacks in Cloud

Cloud computing technology provides flexible,on-demand,and completely controlled computing resources and services are highly desirable.Despite this,with its distributed and dynamic nature and shortcomings in virtualization deployment,the cloud environment is exposed to a wide variety of cyber-attacks and security difficulties.The Intrusion Detection System(IDS)is a specialized security tool that network professionals use for the safety and security of the networks against attacks launched from various sources.DDoS attacks are becoming more frequent and powerful,and their attack pathways are continually changing,which requiring the development of new detection methods.Here the purpose of the study is to improve detection accuracy.Feature Selection(FS)is critical.At the same time,the IDS’s computational problem is limited by focusing on the most relevant elements,and its performance and accuracy increase.In this research work,the suggested Adaptive butterfly optimization algorithm(ABOA)framework is used to assess the effectiveness of a reduced feature subset during the feature selection phase,that was motivated by this motive Candidates.Accurate classification is not compromised by using an ABOA technique.The design of Deep Neural Networks(DNN)has simplified the categorization of network traffic into normal and DDoS threat traffic.DNN’s parameters can be finetuned to detect DDoS attacks better using specially built algorithms.Reduced reconstruction error,no exploding or vanishing gradients,and reduced network are all benefits of the changes outlined in this paper.When it comes to performance criteria like accuracy,precision,recall,and F1-Score are the performance measures that show the suggested architecture outperforms the other existing approaches.Hence the proposed ABOA+DNN is an excellent method for obtaining accurate predictions,with an improved accuracy rate of 99.05%compared to other existing approaches.

Adaptive Kernel Firefly Algorithm Based Feature Selection and Q-Learner Machine Learning Models in Cloud

CC’s(Cloud Computing)networks are distributed and dynamic as signals appear/disappear or lose significance.MLTs(Machine learning Techniques)train datasets which sometime are inadequate in terms of sample for inferring information.A dynamic strategy,DevMLOps(Development Machine Learning Operations)used in automatic selections and tunings of MLTs result in significant performance differences.But,the scheme has many disadvantages including continuity in training,more samples and training time in feature selections and increased classification execution times.RFEs(Recursive Feature Eliminations)are computationally very expensive in its operations as it traverses through each feature without considering correlations between them.This problem can be overcome by the use of Wrappers as they select better features by accounting for test and train datasets.The aim of this paper is to use DevQLMLOps for automated tuning and selections based on orchestrations and messaging between containers.The proposed AKFA(Adaptive Kernel Firefly Algorithm)is for selecting features for CNM(Cloud Network Monitoring)operations.AKFA methodology is demonstrated using CNSD(Cloud Network Security Dataset)with satisfactory results in the performance metrics like precision,recall,F-measure and accuracy used.

Adaptive Robust Control for A Class of Nonlinear Systems with Unknown Uncertainties

The problem of robust stabilization for nonlinear systems with partially known uncertainties is considered in this paper. The required information about uncertainties in the system is merely that the uncertainties are bounded, but the upper bounds are incompletely known. This paper can be viewed as an extension of the work in reference [1]. To compensate the uncertainties, an adaptive robust controller based on Lyapunov method is proposed and the design algorithm is also suggested. Compared with some previous controllers which can only ensure ultimate uniform boundedness of the systems, the controller given in the paper can make sure that the obtained closed-loop system is asymptotically stable in the large. Simulations show that the method presented is available and effective.

Adaptive Signal Enhancement Unit for EEG Analysis in Remote Patient Care Monitoring Systems

In this paper we propose an efcient process of physiological artifact elimination methodology from brain waves(BW),which are also commonly known as electroencephalogram(EEG)signal.In a clinical environment during the acquisition of BW several artifacts contaminates the actual BW component.This leads to inaccurate and ambiguous diagnosis.As the statistical nature of the EEG signal is more non-stationery,adaptive ltering is the more promising method for the process of artifact elimination.In clinical conditions,the conventional adaptive techniques require many numbers of computational operations and leads to data samples overlapping and instability of the algorithm used.This causes delay in diagnosis and decision making.To overcome this problem in our work we propose to set a threshold value to diminish the problem of round off error.The resultant adaptive algorithm based on this strategy is Non-linear Least mean square(NL2MS)algorithm.Again,to improve this algorithm in terms of ltering capability we perform data normalization,using this algorithm several hybrid versions are developed to improve ltering and reduce computational operations.Using the method,a new signal enhancement unit(SEU)is realized and performance of various hybrid versions of algorithms examined using real EEG signals recorded from the subject.The ability of the proposed schemes is measured in terms of convergence,enhancement and multiplications required.Among various SEUs,the MCN2L 2MS algorithm achieves 14.6734,12.8732,10.9257,15.7790 dB during the artifact removal of RA,EMG,CSA and EBA components with only two multiplications.Hence,this algorithm seems to be better candidate for artifact elimination.

Development of a Three-Dimensional Multiscale Octree SBFEM for Viscoelastic Problems of Heterogeneous Materials

The multiscale method provides an effective approach for the numerical analysis of heterogeneous viscoelastic materials by reducing the degree of freedoms(DOFs).A basic framework of the Multiscale Scaled Boundary Finite Element Method(MsSBFEM)was presented in our previous works,but those works only addressed two-dimensional problems.In order to solve more realistic problems,a three-dimensional MsSBFEM is further developed in this article.In the proposed method,the octree SBFEM is used to deal with the three-dimensional calculation for numerical base functions to bridge small and large scales,the three-dimensional image-based analysis can be conveniently conducted in small-scale and coarse nodes can be flexibly adjusted to improve the computational accuracy.Besides,the Temporally Piecewise Adaptive Algorithm(TPAA)is used to maintain the computational accuracy of multiscale analysis by adaptive calculation in time domain.The results of numerical examples show that the proposed method can significantly reduce the DOFs for three-dimensional viscoelastic analysis with good accuracy.For instance,the DOFs can be reduced by 9021 times compared with Direct Numerical Simulation(DNS)with an average error of 1.87%in the third example,and it is very effective in dealing with three-dimensional complex microstructures directly based on images without any geometric modelling process.

GCAGA: A Gini Coefficient-Based Optimization Strategy for Computation Offloading in Multi-User-Multi-Edge MEC System

To support the explosive growth of Information and Communications Technology(ICT),Mobile Edge Comput-ing(MEC)provides users with low latency and high bandwidth service by offloading computational tasks to the network’s edge.However,resource-constrained mobile devices still suffer from a capacity mismatch when faced with latency-sensitive and compute-intensive emerging applications.To address the difficulty of running computationally intensive applications on resource-constrained clients,a model of the computation offloading problem in a network consisting of multiple mobile users and edge cloud servers is studied in this paper.Then a user benefit function EoU(Experience of Users)is proposed jointly considering energy consumption and time delay.The EoU maximization problem is decomposed into two steps,i.e.,resource allocation and offloading decision.The offloading decision is usually given by heuristic algorithms which are often faced with the challenge of slow convergence and poor stability.Thus,a combined offloading algorithm,i.e.,a Gini coefficient-based adaptive genetic algorithm(GCAGA),is proposed to alleviate the dilemma.The proposed algorithm optimizes the offloading decision by maximizing EoU and accelerates the convergence with the Gini coefficient.The simulation compares the proposed algorithm with the genetic algorithm(GA)and adaptive genetic algorithm(AGA).Experiment results show that the Gini coefficient and the adaptive heuristic operators can accelerate the convergence speed,and the proposed algorithm performs better in terms of convergence while obtaining higher EoU.The simulation code of the proposed algorithm is available:https://github.com/Grox888/Mobile_Edge_Computing/tree/GCAGA.

An Adaptive Method of Image CompressionBased on Wavelet Analysis

Through research for image compression based on wavelet analysis in recent years, we put forward an adaptive wavelet decomposition strategy. Whether sub-images are to be decomposed or not are decided by their energy defined by certain criterion. Then we derive the adaptive wavelet decomposition tree (AWDT) and the way of adjustable compression ratio. According to the feature of AWDT, this paper also deals with the strategies which are used to handle different sub-images in the procedure of quantification and coding of the wavelet coefficients. Through experiments, not only the algorithm in the paper can adapt to various images, but also the quality of recovered image is improved though compression ratio is higher and adjustable. When their compression ratios are near, the quality of subjective vision and PSNR of the algorithm are better than those of JPEG algorithm.

Adaptive Algorithm for Accelerating Direct Isosurface Rendering on GPU

Direct isosurface volume rendering is the most prominent modern method for medical data visualization.It is based on finding intersection points between the rays corresponding to pixels on the screen and isosurface. This article describes a two-pass algorithm for accelerating the method on the graphic processing unit(GPU). On the first pass, the intersections with the isosurface are found only for a small number of rays, which is done by rendering into a lower-resolution texture. On the second pass, the obtained information is used to efficiently calculate the intersection points of all the other. The number of rays to use during the first pass is determined by using an adaptive algorithm, which runs on the central processing unit(CPU) in parallel with the second pass of the rendering. The proposed approach allows to significantly speed up isosurface visualization without quality loss. Experiments show acceleration up to 10 times in comparison with a common ray casting method implemented on GPU. To the authors’ knowledge, this is the fastest approach for ray casting which does not require any preprocessing and could be run on common GPUs.

A Class of Generalized Approximate Inverse Solvers for Unsymmetric Linear Systems of Irregular Structure Based on Adaptive Algorithmic Modelling for Solving Complex Computational Problems in Three Space Dimensions

A class of general inverse matrix techniques based on adaptive algorithmic modelling methodologies is derived yielding iterative methods for solving unsymmetric linear systems of irregular structure arising in complex computational problems in three space dimensions. The proposed class of approximate inverse is chosen as the basis to yield systems on which classic and preconditioned iterative methods are explicitly applied. Optimized versions of the proposed approximate inverse are presented using special storage (k-sweep) techniques leading to economical forms of the approximate inverses. Application of the adaptive algorithmic methodologies on a characteristic nonlinear boundary value problem is discussed and numerical results are given.

A Linear Domain System Identification for Small Unmanned Aerial Rotorcraft Based on Adaptive Genetic Algorithm

This paper proposes a new adaptive linear domain system identification method for small unmanned aerial rotorcraft.Byusing the flash memory integrated into the micro guide navigation control module, system records the data sequences of flighttests as inputs (control signals for servos) and outputs (aircraft’s attitude and velocity information).After data preprocessing, thesystem constructs the horizontal and vertical dynamic model for the small unmanned aerial rotorcraft using adaptive geneticalgorithm.The identified model is verified by a series of simulations and tests.Comparison between flight data and the one-stepprediction data obtained from the identification model shows that the dynamic model has a good estimation for real unmannedaerial rotorcraft system.Based on the proposed dynamic model, the small unmanned aerial rotorcraft can perform hovering,turning, and straight flight tasks in real flight tests.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

A novel algorithm of adaptive IIR lattice notch filter and performance analysis

A novel adaptive algorithm of IIR lattice notch filter realized by all-pass filter is presented. The time-averaged estimation of cross correlation of the present instantaneous input signal and the past output signal is used to update the step-size, leading to a considerably improved convergence rate in a low SNR situation and reduced steady-state bias and MSE. The theoretical expression for steady-state bounds on the step-size is derived, and the influence factors on the stable performance of the algorithm theoretically are analyzed. A normalized power factor is then introduced to control variation of step-size in its steady-state bounds. This technique prevents divergence due to the influence of large power input signal and improves robustness. Numerical experiments are performed to demonstrate superiority of the proposed method.