Search

The normalized subband adaptive filtering algorithm provides fast convergence rate for colored input signals as compared to the normalized least mean square algorithm, but it suffers from a poor convergence issue in the α -stable noise. In light of this, the normalized subband p-norm (NSPN) algorithm, which is based on the least mean p-power error (MPE) criterion, is proposed in this study. This technique is not only robust against impulsive noise samples, but it also maintains a fast convergence rate when colored input signals are used. In addition to this, we develop both the steady-state and the transient models of the NSPN algorithm and provide some insights. Then, in order to solve the problem of making a choice regarding the order p in the NSPN algorithm, we design an autonomous system and come up with the NSPN algorithm with a variable p-norm (VP-NSPN). In addition, we offer the TFC-based VP-NSPN algorithm with a fast convergence rate and low steady-state misadjustment simultaneously by making use of the tap-weights feedback-based convex combination (TFC) scheme. In conclusion, simulation results on system identification and acoustic echo cancellation are undertaken in order to validate the superiority of the proposed algorithms and validate the usefulness of the theoretical analysis. [ABSTRACT FROM AUTHOR]

The normalized least mean M-estimate (NLMM) algorithm exhibits good robustness in impulsive noises, but it suffers from the trade-off between convergence rate and steady-state misadjustment. In response to this problem, this paper proposes a switching step-sizes NLMM (SSS-NLMM) algorithm, which selects the optimal step-size at each iteration by comparing the mean square deviation (MSD) values of the algorithm with different step-sizes. Furthermore, to improve the convergence of the algorithm in the transition stage, we embed a feedback mechanism on the minimum MSD. Simulations in various environments have verified that the proposed SSS-NLMM algorithm has better performance than its counterparts in terms of convergence rate and steady-state misadjustment. [ABSTRACT FROM AUTHOR]

DNA 4 mC plays a crucial role in the genetic expression process of organisms. However, existing deep learning algorithms have shortcomings in the ability to represent DNA sequence features. In this paper, we propose a 4 mC site identification algorithm, DNABert-4mC, based on a fusion of the pruned pre-training DNABert-Pruning model and artificial feature encoding to identify 4 mC sites. The algorithm prunes and compresses the DNABert model, resulting in the pruned pre-training model DNABert-Pruning. This model reduces the number of parameters and removes redundancy from output features, yielding more precise feature representations while upholding accuracy.Simultaneously, the algorithm constructs an artificial feature encoding module to assist the DNABert-Pruning model in feature representation, effectively supplementing the information that is missing from the pre-trained features. The algorithm also introduces the AFF-4mC fusion strategy, which combines artificial feature encoding with the DNABert-Pruning model, to improve the feature representation capability of DNA sequences in multi-semantic spaces and better extract 4 mC sites and the distribution of nucleotide importance within the sequence. In experiments on six independent test sets, the DNABert-4mC algorithm achieved an average AUC value of 93.81%, outperforming seven other advanced algorithms with improvements of 2.05%, 5.02%, 11.32%, 5.90%, 12.02%, 2.42% and 2.34%, respectively. [Display omitted] • Train a new pruning pretraining model on DNA sequences to extract feature information. • The introduction of manually assisted features has expanded the search space for sequence feature. • Attention fusion strategy better promotes the fusion output of features from different dimensions. • The complementary nature of machine features and manual features better fits the target features. [ABSTRACT FROM AUTHOR]

Auxiliary stopping area (ASA) is the key guarantee for high-speed maglev train operation safety. Aiming at the layout of the ASA along the track, this article constructs an optimized model of ASA layout and proposes a solving algorithm based on the single target genetic algorithm by analyzing the influence factors of ASA layout. The result of the numerical experiment shows that the proposed method could fulfill the requirements of the maglev train operation safety and efficiency and optimize the cost of the ASA layout while taking the complex line situation, train tracking operation, and bidirectional operation on a single line into account. [ABSTRACT FROM AUTHOR]

In this paper, two arctangent-based normalized subband adaptive filter (Arc-NSAF) algorithms are proposed, which are derived from two different forms of arctangent cost function and their difference is the order of the arctangent computation and the summation operation of the normalized subband error signal. Benefiting from the excellent property of the arctangent function for suppressing impulsive interferences, the proposed Arc-NSAF algorithms not only possess good robustness against impulsive interferences, but also obtain faster convergence rate for the colored input signals. To further improve the convergence performance of the Arc-NSAFs when identifying sparse system, the proportionate versions of the Arc-NSAF algorithms are also proposed. Simulation results have demonstrated the superiority of the proposed algorithms in impulsive interferences environments as compared to their respective competitors. [ABSTRACT FROM AUTHOR]

The dispatching of hydro-thermal system is a nonlinear programming problem with multiple constraints and high dimensions and the solution techniques of the model have been a hotspot in research. Based on the advantage of that the artificial bee colony algorithm (ABC) can efficiently solve the high-dimensional problem, an improved artificial bee colony algorithm has been proposed to solve DHTS problem in this paper. The improvements of the proposed algorithm include two aspects. On one hand, local search can be guided in efficiency by the information of the global optimal solution and its gradient in each generation. The global optimal solution improves the search efficiency of the algorithm but loses diversity, while the gradient can weaken the loss of diversity caused by the global optimal solution. On the other hand, inspired by genetic algorithm, the nectar resource which has not been updated in limit generation is transformed to a new one by using selection, crossover and mutation, which can ensure individual diversity and make full use of prior information for improving the global search ability of the algorithm. The two improvements of ABC algorithm are proved to be effective via a classical numeral example at last. Among which the genetic operator for the promotion of the ABC algorithm’s performance is significant. The results are also compared with those of other state-of-the-art algorithms, the enhanced ABC algorithm has general advantages in minimum cost, average cost and maximum cost which shows its usability and effectiveness. The achievements in this paper provide a new method for solving the DHTS problems, and also offer a novel reference for the improvement of mechanism and the application of algorithms. [ABSTRACT FROM AUTHOR]

To improve the performance of the recently presented individual weighting factors sign subband adaptive filter (IWF-SSAF) algorithm, its 2 combination algorithms using different step sizes are proposed. The first algorithm is to convexly combine the weight vectors of a large step-size IWF-SSAF filter and a small step-size one; and the second algorithm is to obtain a time-varying step size for the IWF-SSAF by combining a large step size and a small one. The minimization of the sum of the l1-norm of subband errors is used to indirectly update the mixing parameters in these 2 algorithms through a modified sigmoidal function. Moreover, in the first algorithm, to implement a smooth transition from the large step-size IWF-SSAF filter to the small step-size one, the component filters receive a cyclic feedback of the combined weight vector. Both proposed algorithms have almost the same convergence performance, but the second algorithm saves computational cost. Simulation results in impulsive noise scenarios demonstrate the superiority of our proposed algorithms. [ABSTRACT FROM AUTHOR]

A novel normalized subband adaptive filter algorithm with combined step size is proposed for acoustic echo cancellation, which is derived by utilizing a variable mixing parameter to combine a large step size and a small one, thus providing fast convergence rate and small steady-state error. The mixing parameter is indirectly updated by utilizing the stochastic gradient method which minimizes the sum of squared subband errors. Simulation results demonstrate the superiority of the proposed algorithm in terms of the convergence rate and steady-state error as compared to other algorithms mentioned in this paper. [ABSTRACT FROM AUTHOR]

In acoustic echo cancellation (AEC), the sparseness of impulse responses can vary over time or/and context. For such scenario, the proportionate normalized subband adaptive filter (PNSAF) and μ -law (MPNSAF) algorithms suffer from performance deterioration. To this end, we propose their sparseness-measured versions by incorporating the estimated sparseness into the PNSAF and MPNSAF algorithms, respectively, which can adapt to the sparseness variation of impulse responses. In addition, based on the energy conservation argument, we provide a unified formula to predict the steady-state mean-square performance of any PNSAF algorithm, which is also supported by simulations. Simulation results in AEC have shown that the proposed algorithms not only exhibit faster convergence rate than their competitors in sparse, quasi-sparse and dispersive environments, but also are robust to the variation in the sparseness of impulse responses. [ABSTRACT FROM AUTHOR]

Proportionate-type normalized subband adaptive filter (PNSAF-type) algorithms are very attractive choices for echo cancellation. To further obtain both fast convergence rate and low steady-state error, in this paper, a variable step size (VSS) version of the presented improved PNSAF (IPNSAF) algorithm is proposed by minimizing the square of the noise-free a posterior subband error signals. A noniterative shrinkage method is used to recover the noise-free a priori subband error signals from the noisy subband error signals. Significantly, the proposed VSS strategy can be applied to any other PNSAF-type algorithm, since it is independent of the proportionate principles. Simulation results in the context of acoustic echo cancellation have demonstrated the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

• To analyze the performance of three proportionate algorithms in impulsive noises. • To reveal the ranges and relations of the step-sizes in three proportionate algorithms. • To develop a decorrelation technique based variable step-size scheme to deal with the trade-off between convergence rate and steady-state error. In the literature, the proportionate least mean M-estimate (PLMM) algorithm exhibits good performance when dealing with sparse systems in the presence of impulsive noises. In this paper, the mean and mean-square behaviors of three recursion types of the PLMM algorithm are studied in depth. We derive analytically the stability, transient and steady-state results of these PLMM recursions, and find that they can achieve the same performance when properly choosing the step-size and the proportionate matrix. To improve the filter performance in both convergence rate and steady-state error, we derive a variable step-size (VSS) scheme and then present the VSS-based PLMM algorithms. In addition, based on the adaptive decorrelation strategy aiming at the colored input signals, the VSS adaptive decorrelation PLMM algorithms are developed to further speed up the convergence. Computer simulations have verified our theoretical analyses and the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a new sign subband adaptive filter (SSAF) algorithm with an individual-weighting-factor (IWF) for each subband, instead of a common weighting factor in the original SSAF algorithm, called the IWF-SSAF. Each individual weighting factor only depends on the corresponding subband input signal power. Compared with the SSAF algorithm, the proposed approach fully utilizes the inherent decorrelating property of subband adaptive filter for colored inputs, leading to a better convergence performance. After that, to further enhance the performance of the IWF-SSAF in a sparse system, an improved proportionate IWF-SSAF (IWF-IPSSAF) algorithm is proposed. The proposed algorithms not only inherit the good robustness of sign algorithm against impulsive interferences, but also obtain a significant improvement in the performance as compared to their counterparts (i.e., SSAF and IPSSAF), in terms of the convergence rate and tracking capability. Besides, the IWF-IPSSAF algorithm has faster convergence rate than the IWF-SSAF algorithm for sparse impulse responses. Finally, the performances of two proposed algorithms are demonstrated in the system identification and the acoustic echo cancellation with double-talk. [ABSTRACT FROM AUTHOR]

Proposed is a new subband adaptive filter (SAF) algorithm by minimizing Huber’s cost function that is robust to impulsive noises. Generally, this algorithm works in the mode of the normalized SAF (NSAF) algorithm, while it behaves like the sign SAF (SSAF) algorithm only when the impulsive noises appear. To further improve the robustness of this algorithm against impulsive noises, the subband cutoff parameters are updated in a recursive way. Moreover, the proposed algorithm can be interpreted as a variable step size NSAF algorithm, thus it exhibits faster convergence rate and lower steady-state error than the NSAF. Simulation results, using different colored input signals in both impulsive and free-impulsive noise environments, show that the proposed algorithm works better than some existing algorithms. [ABSTRACT FROM AUTHOR]

In order to reduce the steady-state misalignment of real-coefficient proportionate affine projection sign algorithm (RP-APSA) for sparse impulse responses, a memory RP-APSA is proposed in this paper by exploiting the historical values of proportionate factors, called MP-APSA. Further, to improve the robustness of MP-APSA and the recently proposed memory-improved RP-APSA (MIP-APSA) for impulse responses with mutative sparseness, two sparseness-controlled algorithms (SC-MP-APSA and SC-MIP-APSA) are developed by estimating the sparseness of the impulse response at each iteration. Simulation results in the context of acoustic echo cancellation show that the proposed algorithms retain good robustness against impulsive interferences. More importantly, the proposed sparseness-controlled algorithms can not only obtain low steady-state misalignment in both the sparse and dispersive situations, but also adapt to the variations in the sparseness of the impulse response. [ABSTRACT FROM AUTHOR]

Base on the integration of urban transportation, the paper studied the dispatching problem of bus vehicles associating with urban rail transit to transport passengers during the large-scale events. For the operation characteristics of dedicated-line and over-line, optimizing models of independent dispatching and centralized dispatching were developed separately while whose algorithms were provided. An application of the models to the case of Expo 2010 Shanghai shows that the optimizing models are practical and useful for reducing the cost of bus transit operation and improving the efficiency of the intermodal transportation system composed of urban rail transit and bus transit. [ABSTRACT FROM AUTHOR]

Dirichlet mixtures provide an elegant formalism for constructing and evaluating protein multiple sequence alignments. Their use requires the inference of Dirichlet mixture priors from curated sets of accurately aligned sequences. This article addresses two questions relevant to such inference: of how many components should a Dirichlet mixture consist, and how may a maximum-likelihood mixture be derived from a given data set. To apply the Minimum Description Length principle to the first question, we extend an analytic formula for the complexity of a Dirichlet model to Dirichlet mixtures by informal argument. We apply a Gibbs-sampling based approach to the second question. Using artificial data generated by a Dirichlet mixture, we demonstrate that our methods are able to approximate well the true theory, when it exists. We apply our methods as well to real data, and infer Dirichlet mixtures that describe the data better than does a mixture derived using previous approaches. [ABSTRACT FROM AUTHOR]

Dirichlet mixture priors provide a Bayesian formalism for scoring alignments of protein profiles to individual sequences, which can be generalized to constructing scores for multiple-alignment columns. A Dirichlet mixture is a probability distribution over multinomial space, each of whose components can be thought of as modeling a type of protein position. Applied to the simplest case of pairwise sequence alignment, a Dirichlet mixture is equivalent to an implied symmetric substitution matrix. For alphabets of even size L, Dirichlet mixtures with L/2 components and symmetric substitution matrices have an identical number of free parameters. Although this suggests the possibility of a one-to-one mapping between the two formalisms, we show that there are some symmetric matrices no Dirichlet mixture can imply, and others implied by many distinct Dirichlet mixtures. Dirichlet mixtures are derived empirically from curated sets of multiple alignments. They imply 'background' amino acid frequencies characteristic of these sets, and should thus be non-optimal for comparing proteins with non-standard composition. Given a mixture ?, we seek an adjusted ?? that implies the desired composition, but that minimizes an appropriate relative-entropy-based distance function. To render the problem tractable, we fix the mixture parameter as well as the sum of the Dirichlet parameters for each component, allowing only its center of mass to vary. This linearizes the constraints on the remaining parameters. An approach to finding ?? may be based on small consecutive parameter adjustments. The relative entropy of two Dirichlet distributions separated by a small change in their parameter values implies a quadratic cost function for such changes. For a small change in implied background frequencies, this function can be minimized using the Lagrange-Newton method. We have implemented this method, and can compositionally adjust to good precision a 20-component Dirichlet mixture prior for proteins in under half a second on a standard workstation. [ABSTRACT FROM AUTHOR]

In this paper, a receiver algorithm for uplink multiuser orthogonal frequency-division multiplexing (OFDM) with a receiver-diversity system is proposed. The receiver uses a simple multiuser generalization of the maximum a posteriori probability (MAP) selection diversity combining followed by parallel interference cancellation with least-squares projection (PIC-LSP) for multiuser detection. Compared with the near-maximal-ratio-combining (near-MRC) scheme, simulation results show that the proposed approach achieves very good performance and has much lower complexity. [ABSTRACT FROM AUTHOR]

Abstract: This paper demonstrates an approach to predict the chaotic time series with outliers using annealing robust fuzzy neural networks (ARFNNs). A combination model that merges support vector regression (SVR), radial basis function networks (RBFNs) and simplified fuzzy inference system is used. The SVR has the good performances to determine the number of rules in the simplified fuzzy inference system and initial weights for the fuzzy neural networks (FNNs). Based on these initial structures, and then annealing robust learning algorithm (ARLA) can be used effectively to overcome outliers and adjust the parameters of structures. Simulation results show the superiority of the proposed method with different SVR for training and prediction of chaotic time series with outliers. [Copyright &y& Elsevier]

The power harnessed by wave energy converters (WECs) in oceans is highly variable and, therefore, has a high peak-to-average power (PTAP) ratio. To minimize the cost of a WEC power take off (PTO) system, it is desirable to reduce the PTAP ratio while maximizing the mean power extracted by WECs. The important issue of how PTAP ratio reduction measures (such as adding an inertia element) can affect the mean power extracted in a reference model has not been thoroughly addressed in the literature. To investigate this correlation, this study focuses on the integration of the U.S. Department of Energy's Reference Model 3, a two-body point absorber, with a slider-crank WEC for linear-to-rotational conversion. In the first phase of this study, a full-scale numerical model was developed that predicts how PTO system parameters, along with an advanced control algorithm, can potentially affect the proposed WEC's PTAP ratio as well as the mean power extracted. In the second phase, an appropriate scaled-down model was developed, and extracted power results were successfully validated against the full-scale model. Finally, numerical and hardware-in-the-loop (HIL) simulations based on the scaled-down model were designed and conducted to optimize or make trade-offs between the operational performance and PTAP ratio. The initial results with numerical and HIL simulations reveal that gear ratio, crank radius, and generator parameters substantially impact the PTAP ratio and mean power extracted. [ABSTRACT FROM AUTHOR]

A computational method combining the genetic algorithm (GA) and shape mutation is reported for electromagnetic imaging of a homogeneous cylinder of arbitrary shape. By measuring the scattered field, the shape location, size, and permittivity of the object are retrieved quite successfully. The forward problem is solved based on the equivalent source current and the method of moments (MoM), while the inverse problem is reformulated into an optimization one, and is solved by the proposed scheme. Numerical simulation shows that, even with a bad initial guess, good reconstruction can be obtained for a hollow object or multiple-cylinder object as long as the noise level is ≤-20 dB. © 1998 John Wiley & Sons, Inc. Microwave Opt Technol Lett 19: 188–192, 1998. [ABSTRACT FROM AUTHOR]

A novel method combining the genetic algorithm (GA) and regular shape expansion technique is reported for electromagnetic imaging of a multilayer dielectric object of arbitrary shape. By measuring the scattered field, the shape, location, size, and permittivity of each layer of the object are retrieved quite successfully. The forward problem is solved based on the equivalent source current and the method of moments (MoM), while the inverse problem is reformulated as an optimization problem. The optimization problem is solved by the proposed method. Numerical simulation shows that good image reconstruction can be obtained for various multilayer dielectric objects as long as the noise level is ≤-20 dB. © 1999 John Wiley & Sons, Inc. Int J Imaging Syst Technol 10, 347–354, 1999 [ABSTRACT FROM AUTHOR]

• By incorporating the sparsity-aware technique, we propose the S-IWF-SSAF algorithm, and analyze its performance in-depth in impulsive noise. • The proposed analysis covers the behaviors of the IWF-SSAF algorithm in impulsive noise, with better accuracy than the analysis in [15]. • We devise a joint optimization scheme to automatically choose the step-size and the sparsity penalty parameter for the S-IWF-SSAF algorithm. • To make the proposed algorithms suitable for AEC, we develop delayless implementation of the proposed algorithms. In this paper, we propose and analyze the sparsity-aware sign subband adaptive filtering with individual weighting factors (S-IWF-SSAF) algorithm, and consider its application in acoustic echo cancellation (AEC). Furthermore, we design a joint optimization scheme of the step-size and the sparsity penalty parameter to enhance the S-IWF-SSAF performance in terms of convergence rate and steady-state error. A theoretical analysis shows that the S-IWF-SSAF algorithm outperforms the previous sign subband adaptive filtering with individual weighting factors (IWF-SSAF) algorithm in sparse scenarios. In particular, compared with the existing analysis on the IWF-SSAF algorithm, the proposed analysis does not require the assumptions of large number of subbands, long adaptive filter, and paraunitary analysis filter bank, and matches well the simulated results. Simulations in both system identification and AEC situations have demonstrated our theoretical analysis and the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

A relatively simple method to improve the image resolution of light field based on a liquid crystal (LC) microlens doped with multi-walled carbon nanotubes (MWCNTs) was developed and evaluated. As the nanoparticles were doped in LC, its electro-optical features could enhance, leading to a short response time compared to the pure LC microlens. With the maximum use of the proposed LC microlens, a method combining aperiodicity extraction and weighted average algorithm was adopted to realize the high-resolution light field imaging. The aperiodicity extraction method was proposed, which could effectively improve resolution of view angle image. For synthesizing the full resolution image at 0 Vrms and the extracted view angle image of light field imaging at 2.0 Vrms, the final high-resolution light field imaging could be obtained in a short time by weighted average algorithm. In this way, the common problem of low resolution in light field imaging could be solved. This proposed method was in good agreement with our experimental results. And it was also in line with the development of the trend of the smart imaging sensor combining algorithm with hardware. [ABSTRACT FROM AUTHOR]

This paper presents a new proportionate normalized subband adaptive filter (PNSAF) algorithm, called the IAF-PNSAF, which assigns an individual activation factor for each filter coefficient instead of a common one for all filter coefficients as in the standard PNSAF algorithm. This algorithm achieves an improved performance in terms of the convergence rate and tracking capability for identifying a highly sparse system. Moreover, to overcome the trade-off of the fixed-step-size IAF-PNSAF algorithm between the fast convergence rate and small steady-state misalignment, its adaptive combination version is proposed. Simulation results for identifying the impulse response with high sparseness have demonstrated that the proposed algorithms outperform their counterparts. [ABSTRACT FROM AUTHOR]

In this paper, we present Molecular Isotopic Distribution Analysis (MIDAs), a new software tool designed to compute molecular isotopic distributions with adjustable accuracies. MIDAs offers two algorithms, one polynomial-based and one Fourier-transform-based, both of which compute molecular isotopic distributions accurately and efficiently. The polynomial-based algorithm contains few novel aspects, whereas the Fourier-transform-based algorithm consists mainly of improvements to other existing Fourier-transform-based algorithms. We have benchmarked the performance of the two algorithms implemented in MIDAs with that of eight software packages (BRAIN, Emass, Mercury, Mercury5, NeutronCluster, Qmass, JFC, IC) using a consensus set of benchmark molecules. Under the proposed evaluation criteria, MIDAs's algorithms, JFC, and Emass compute with comparable accuracy the coarse-grained (low-resolution) isotopic distributions and are more accurate than the other software packages. For fine-grained isotopic distributions, we compared IC, MIDAs's polynomial algorithm, and MIDAs's Fourier transform algorithm. Among the three, IC and MIDAs's polynomial algorithm compute isotopic distributions that better resemble their corresponding exact fine-grained (high-resolution) isotopic distributions. MIDAs can be accessed freely through a user-friendly web-interface at .[Figure not available: see fulltext.] [ABSTRACT FROM AUTHOR]

Abstract: A practical brain–machine interface (BMI) requires real-time decoding algorithms to be realised in a portable device rather than a personal computer. In this article, a field-programmable gate array (FPGA) implementation of a probabilistic neural network (PNN) is proposed and developed to decode motor cortical ensemble recordings in rats performing a lever-pressing task for water rewards. A chronic 16-channel microelectrode array was implanted into the primary motor cortex of the rat to record neural activity, and the pressure signal of the lever were recorded simultaneously. To decode the pressure value from neural activity, both Matlab-based and FPGA-based mapping algorithms using a PNN were implemented and evaluated. In the FPGA architecture, training data of the network were stored in random access memory (RAM) blocks and multiply–add operations were realised by on-chip DSP48E slices. In the approximation of the activation function, a Taylor series and a look-up table (LUT) are used to achieve an accurate approximation. The results of FPGA implementation are as accurate as the realisation of Matlab, but the running speed is 37.9 times faster. This novel and feasible method indicates that the performance of current FPGAs is competent for portable BMI applications. [Copyright &y& Elsevier]

• This paper provides the robust SAF-LHC-MNAG algorithm for nonlinear system identification in impulsive noise scenarios. • The proposed algorithm can accelerate the convergence under the premise of low steady-state error. • The convergence condition and the mean square performance of the SAF-LHC-MNAG algorithm are given. • The proposed algorithm is implemented to identify the hysteresis model of the piezoelectric actuator. This paper proposes a novel spline adaptive filtering (SAF) algorithm for nonlinear system identification under impulsive noise environments. This algorithm combines the logarithmic hyperbolic cosine (LHC) cost function and the modified Nesterov accelerated gradient (MNAG) learning method, which is called the SAF-LHC-MNAG algorithm. The LHC cost function can reduce the sensitivity of SAF to large outliers and improve the robustness to impulsive noises. Additionally, the MNAG method can further accelerate the convergence under the premise of low steady-state error. Performance analysis of this algorithm is carried out and supported by simulations. Numerical results show that the SAF-LHC-MNAG algorithm has better convergence performance than some existing SAF algorithms. Besides, experimental results confirm the effectiveness of SAF-LHC-MNAG for the accurate identification of nonlinear hysteresis system. [ABSTRACT FROM AUTHOR]

• The variable step-size widely linear complex-valued NLMS (VSS-WL-CNLMS) algorithm which is applicable to the case of highly correlated input is proposed, where the variable step-size (VSS) is derived by minimizing the mean-square deviation (MSD). • The proposed VSS-WL-CNLMS algorithm is convergent in the mean square sense. • Based on the approximate uncorrelating transform and Rayleigh distribution, the theoretical transient and stead-state behaviors of the VSS-WL-CNLMS algorithm are analyzed in detail. The shrinkage widely linear complex-valued least mean square (SWL-CLMS) algorithm with a variable step-size (VSS) overcomes the tradeoff between fast convergence and low steady-state misalignment, but meanwhile suffers from instability for highly correlated input signals because of the gradient noise amplification problem. To obtain a VSS that is also applicable to the case of highly correlated input signals, in this paper, we propose the VSS widely linear complex-valued normalized least mean square (VSS-WL-CNLMS) algorithm, where the VSS is derived by minimizing the mean-square deviation (MSD). Owing to the normalization, the VSS-WL-CNLMS algorithm is convergent in the mean square sense. By using the Rayleigh distribution, we calculate the mean step-size, which is then combined with the approximate uncorrelating transform to analyze the transient and steady-state mean square error (MSE) behaviors. Simulations for system identification scenario show that the proposed VSS-WL-CNLMS algorithm outperforms some well-known techniques and verify the accuracy of the theoretical analysis. [ABSTRACT FROM AUTHOR]

The wave energy control competition established a benchmark problem which was offered as an open challenge to the wave energy system control community. The competition had two stages: In the first stage, competitors used a standard wave energy simulation platform (WEC-Sim) to evaluate their controllers while, in the second stage, competitors were invited to test their controllers in a real-time implementation on a prototype system in a wave tank. The performance function used was based on converted energy across a range of standard sea states, but also included aspects related to economic performance, such as peak/average power, peak force, etc. This paper compares simulated and experimental results and, in particular, examines if the results obtained in a linear system simulation are borne out in reality. Overall, within the scope of the device tested, the range of sea states employed, and the performance metric used, the conclusion is that high-performance WEC controllers work well in practice, with good carry-over from simulation to experimentation. However, the availability of a good WEC mathematical model is deemed to be crucial. • Comprehensive documentation of the first international wave energy control competition (WECCCOMP). • Description of the various control algorithms used and experimental procedure employed. • Comparison of both simulation and experimental wave tank testing results, with critical analysis. • Proposal of the WECCCOAP system as a benchmark problem for the appraisal of WEC control systems. [ABSTRACT FROM AUTHOR]

Highlights • This paper provides the development of the robust censored adaptive algorithm for the impulsive noise. • This paper gives Consideration of non-Gaussian background noise as different from previous literature which only consider the Gaussian noise. • Theoretical insights into the mean and mean square performance of the CR-MCC algorithm are provided. • Simulation examples to demonstrate the performance of the proposed algorithm in impulsive noise scenarios are given. Abstract Censored observations and impulsive measurement noise are encountered in many practical applications of adaptive signal processing. Traditional adaptive filtering algorithms may fail to work in such cases. This paper proposes a robust adaptive filter algorithm predicated on maximum correntropy criteria (MCC) for censored regression. A detailed performance analysis in terms of mean and mean-square behaviour is provided. Simulations with Gaussian and non-Gaussian noise are presented to verify the theoretical results, and to demonstrate the superior performance of the proposed algorithm over existing algorithms. [ABSTRACT FROM AUTHOR]

Background: Isokinetic muscle strength training is presently the most advanced method of muscle strength training. However, the existing control schemes of the training equipment are usually limited to the structure of the brake.Objective: In order to solve this problem, this paper presents a solution to an isokinetic system based on the force control of a DC servomotor.Methods: A new fuzzy impedance nonlinear controller is designed by analyzing the relevant requirements of isokinetic motion. A series of force tracking comparison experiments between a fuzzy PI controller and a classical PI controller are studied. In addition, some strength training experiments employing different driving forces and target speeds are also conducted.Results: The results demonstrate the effectiveness of this fuzzy impedance force tracking control strategy.Conclusion: Using the aforementioned methods, a comprehensive motion algorithm was designed. [ABSTRACT FROM AUTHOR]