Search

Having fast, accurate, and broad spectrum methods for the identification of microorganisms is of paramount importance to public health, research, and safety. Bottom-up mass spectrometer-based proteomics has emerged as an effective tool for the accurate identification of microorganisms from microbial isolates. However, one major hurdle that limits the deployment of this tool for routine clinical diagnosis, and other areas of research such as culturomics, is the instrument time required for the mass spectrometer to analyze a single sample, which can take ∼1 h per sample, when using mass spectrometers that are presently used in most institutes. To address this issue, in this study, we employed, for the first time, tandem mass tags (TMTs) in multiplex identifications of microorganisms from multiple TMT-labeled samples in one MS/MS experiment. A difficulty encountered when using TMT labeling is the presence of interference in the measured intensities of TMT reporter ions. To correct for interference, we employed in the proposed method a modified version of the expectation maximization (EM) algorithm that redistributes the signal from ion interference back to the correct TMT-labeled samples. We have evaluated the sensitivity and specificity of the proposed method using 94 MS/MS experiments (covering a broad range of protein concentration ratios across TMT-labeled channels and experimental parameters), containing a total of 1931 true positive TMT-labeled channels and 317 true negative TMT-labeled channels. The results of the evaluation show that the proposed method has an identification sensitivity of 93-97% and a specificity of 100% at the species level. Furthermore, as a proof of concept, using an in-house-generated data set composed of some of the most common urinary tract pathogens, we demonstrated that by using the proposed method the mass spectrometer time required per sample, using a 1 h LC-MS/MS run, can be reduced to 10 and 6 min when samples are labeled with TMT-6 and TMT-10, respectively. The proposed method can also be used along with Orbitrap mass spectrometers that have faster MS/MS acquisition rates, like the recently released Orbitrap Astral mass spectrometer, to further reduce the mass spectrometer time required per sample.

Computational approaches employed for predicting potential microbe-disease associations often rely on similarity information between microbes and diseases. Therefore, it is important to obtain reliable similarity information by integrating multiple types of similarity information. However, existing similarity fusion methods do not consider multi-order fusion of similarity networks. To address this problem, a novel method of linear neighborhood label propagation with multi-order similarity fusion learning (MOSFL-LNP) is proposed to predict potential microbe-disease associations. Multi-order fusion learning comprises two parts: low-order global learning and high-order feature learning. Low-order global learning is used to obtain common latent features from multiple similarity sources. High-order feature learning relies on the interactions between neighboring nodes to identify high-order similarities and learn deeper interactive network structures. Coefficients are assigned to different high-order feature learning modules to balance the similarities learned from different orders and enhance the robustness of the fusion network. Overall, by combining low-order global learning with high-order feature learning, multi-order fusion learning can capture both the shared and unique features of different similarity networks, leading to more accurate predictions of microbe-disease associations. In comparison to six other advanced methods, MOSFL-LNP exhibits superior prediction performance in the leave-one-out cross-validation and 5-fold validation frameworks. In the case study, the predicted 10 microbes associated with asthma and type 1 diabetes have an accuracy rate of up to 90% and 100%, respectively., (© 2024. International Association of Scientists in the Interdisciplinary Areas.)

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., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Motion rehabilitation is increasingly required owing to an aging population and suffering of stroke, which means human motion analysis must be valued. Based on the concept mentioned above, a deep-learning-based system is proposed to track human motion based on three-dimensional (3D) images in this work; meanwhile, the features of traditional red green blue (RGB) images, known as two-dimensional (2D) images, were used as a comparison. The results indicate that 3D images have an advantage over 2D images due to the information of spatial relationships, which implies that the proposed system can be a potential technology for human motion analysis applications.

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.

Motivation: There is a growing trend for biomedical researchers to extract evidence and draw conclusions from mass spectrometry based proteomics experiments, the cornerstone of which is peptide identification. Inaccurate assignments of peptide identification confidence thus may have far-reaching and adverse consequences. Although some peptide identification methods report accurate statistics, they have been limited to certain types of scoring function. The extreme value statistics based method, while more general in the scoring functions it allows, demands accurate parameter estimates and requires, at least in its original design, excessive computational resources. Improving the parameter estimate accuracy and reducing the computational cost for this method has two advantages: it provides another feasible route to accurate significance assessment, and it could provide reliable statistics for scoring functions yet to be developed., Results: We have formulated and implemented an efficient algorithm for calculating the extreme value statistics for peptide identification applicable to various scoring functions, bypassing the need for searching large random databases., Availability and Implementation: The source code, implemented in C ++ on a linux system, is available for download at ftp://ftp.ncbi.nlm.nih.gov/pub/qmbp/qmbp_ms/RAId/RAId_Linux_64Bit, Contact: yyu@ncbi.nlm.nih.gov, Supplementary Information: Supplementary data are available at Bioinformatics online., (Published by Oxford University Press 2016. This work is written by US Government employees and is in the public domain in the US.)

Background: Disease-disease similarities can be investigated from multiple perspectives. Identifying similar diseases based on the underlying biomolecular interactions can be especially useful, because it may shed light on the common causes of the diseases and therefore may provide clues for possible treatments. Here we introduce DeCoaD, a web-based program that uses a novel method to assign pair-wise similarity scores, called correlations, to genetic diseases., Findings: DeCoaD uses a random walk to model the flow of information in a network within which nodes are either diseases or proteins and links signify either protein-protein interactions or disease-protein associations. For each protein node, the total number of visits by the random walker is called the weight of that node. Using a disease as both the starting and the terminating points of the random walks, a corresponding vector, whose elements are the weights associated with the proteins, can be constructed. The similarity between two diseases is defined as the cosine of the angle between their associated vectors. For a user-specified disease, DeCoaD outputs a list of similar diseases (with their corresponding correlations), and a graphical representation of the disease families that they belong to. Based on a probabilistic clustering algorithm, DeCoaD also outputs the clusters that the disease of interest is a member of, and the corresponding probabilities. The program also provides an interface to run enrichment analysis for the given disease or for any of the clusters that contains it., Conclusions: DeCoaD uses a novel algorithm to suggest non-trivial similarities between diseases with known gene associations, and also clusters the diseases based on their similarity scores. DeCoaD is available at http://www.ncbi.nlm.nih.gov/CBBresearch/Yu/mn/DeCoaD/.

Motivation: Assigning statistical significance accurately has become increasingly important as metadata of many types, often assembled in hierarchies, are constructed and combined for further biological analyses. Statistical inaccuracy of metadata at any level may propagate to downstream analyses, undermining the validity of scientific conclusions thus drawn. From the perspective of mass spectrometry-based proteomics, even though accurate statistics for peptide identification can now be achieved, accurate protein level statistics remain challenging., Results: We have constructed a protein ID method that combines peptide evidences of a candidate protein based on a rigorous formula derived earlier; in this formula the database P-value of every peptide is weighted, prior to the final combination, according to the number of proteins it maps to. We have also shown that this protein ID method provides accurate protein level E-value, eliminating the need of using empirical post-processing methods for type-I error control. Using a known protein mixture, we find that this protein ID method, when combined with the Sorić formula, yields accurate values for the proportion of false discoveries. In terms of retrieval efficacy, the results from our method are comparable with other methods tested., Availability and Implementation: The source code, implemented in C++ on a linux system, is available for download at ftp://ftp.ncbi.nlm.nih.gov/pub/qmbp/qmbp_ms/RAId/RAId_Linux_64Bit., (Published by Oxford University Press 2014. This work is written by US Government employees and is in the public domain in the US.)

The improvement of brain imaging technique brings about an opportunity for developing and investigating brain-computer interface (BCI) which is a way to interact with computer and environment. The measured brain activities usually constitute the signals of interest and noises. Applying the portable device and removing noise are the benefits to real-world BCI. In this study, one portable electroencephalogram (EEG) system non-invasively acquired brain dynamics through wireless transmission while six subjects participated in the rapid serial visual presentation (RSVP) paradigm. The event-related potential (ERP) was traditionally estimated by ensemble averaging (EA) to increase the signal-to-noise ratio. One adaptive filter of data-reusing radial basis function network (DR-RBFN) was also utilized as the estimator. The results showed that this portable EEG system stably acquired brain activities. Furthermore, the task-related potentials could be clearly explored from the limited samples of EEG data through DR-RBFN. According to the artifact-free data from the portable device, this study demonstrated the potential to move the BCI from laboratory research to real-life application in the near future.

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]

Frequency-domain adaptive filter (FDAF) algorithms have been widely used in many fields in virtue of its fast convergence and low computational complexity. However, FDAF algorithms with fixed step-size cannot balance convergence rate and steady-state misadjustment. In this paper, we propose the switching step-size based FDAF (SSS-FDAF) algorithm that selects the optimal step-size at each iteration for the FDAF update by comparing the mean-square deviation (MSD) trends with different step-sizes, to obtain fast convergence and low steady-state misadjustment at the same time. Furthermore, a novel reset strategy is designed for guaranteeing the tracking capability of the proposed algorithm. Computer simulations of colored signals and real-world signals have demonstrated the effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

The projection order of the affine projection algorithm (APA) affects not only the convergence performance but also the steady-state behavior. Therefore, for solving the fixed projection order of the conventional APA, we develop a new scheme of variable projection order (VPO) that enables the evolution from the maximum projection order to the minimum one by resorting to the adaptation of the mixing factor, thereby yielding a novel APA with VPO. Moreover, for dealing with sparse systems with fast convergence, we extend the proposed VPO scheme to proportionate APA and develop a VPO-based memory proportionate APA. Simulation results in the scenarios of system identification and acoustic echo cancellation have shown that the proposed algorithms have a faster convergence rate and lower steady-state error as compared to their original counterparts and the existing VPO algorithms. [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]

Edge computing is a key technology in computational imaging, where the algorithms determine reconstruction quality and reconstruction speed. Recovering spectral information from ill-conditioned data of coded aperture snapshots is a novel but challenging solution in spectral imaging for dynamic scenes. Further study is necessary to enhance the edge computing power of computational spectral programs. Deep unfolding networks have made considerable headway in this direction, but the existing methods still have two drawbacks: (1) The 3D spectral cube exhibits long-range dependency and non-local self-similarity in both spatial and spectral dimensions, yet learn the global features of spatial and spectral is difficult, which remains to be investigated. (2) The global features degenerate as the number of iterations increases. To solve the above problems, this paper proposes a Momentum Accelerated Unfolding Network with Spectral–Spatial prior (MAUNSS). Specifically, a denoising module based on a spectral–spatial transformer is designed, which uses both sparse spectral features to recover global information and dense spatial features to enhance detail texture. Within such a framework, cross-stage feature transmission channels transmitting features across spectral and spatial transformers at different stages are built to avoid feature degeneration. In order to increase the training speed and save the time and cost associated with the iterative approach, we improve it by means of the momentum acceleration module. Supplemented by a re-projection loss, a technique introduced from 3D measurement, the accuracy is further improved. To the best of our knowledge, the proposed method is an attempt to use momentum to expedite the convergence of unfolding networks. Extensive experiments demonstrate that our proposed method outperforms previous state-of-the-art methods by more than 1.94 dB. • MAUN with learnable hyper-parameters and Momentum methods ensures better accuracy. • A reprojection loss is proposed to improve the reconstruction accuracy of HIS. • MAUNSS exceeds the previous SOTA methods while requiring less memory costs. [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]

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]

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]

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]

To obtain fast convergence rate and low steady-state error in acoustic echo cancellation, a convex combination scheme of the improved proportionate normalized subband adaptive filter algorithm is proposed. Instead of the gradient method in the conventional combination theory, the mixing parameter is adapted by using the normalized gradient method which makes it more robust to the variations of subband error signals. Also, to implement a smooth transition from the fast filter to the accurate filter, a cyclic feedback of the overall tap-weights giving to all component filters is applied. [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]

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]

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]

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]

• 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]

Singing voice detection or vocal detection is a classification task that determines whether a given audio segment contains singing voices. This task plays a very important role in vocal-related music information retrieval tasks, such as singer identification. Although humans can easily distinguish between singing and nonsinging parts, it is still very difficult for machines to do so. Most existing methods focus on audio feature engineering with classifiers, which rely on the experience of the algorithm designer. In recent years, deep learning has been widely used in computer hearing. To extract essential features that reflect the audio content and characterize the vocal context in the time domain, this study adopted a long-term recurrent convolutional network (LRCN) to realize vocal detection. The convolutional layer in LRCN functions in feature extraction, and the long short-term memory (LSTM) layer can learn the time sequence relationship. The preprocessing of singing voices and accompaniment separation and the postprocessing of time-domain smoothing were combined to form a complete system. Experiments on five public datasets investigated the impacts of the different features for the fusion, frame size, and block size on LRCN temporal relationship learning, and the effects of preprocessing and postprocessing on performance, and the results confirm that the proposed singing voice detection algorithm reached the state-of-the-art level on public datasets. [ABSTRACT FROM AUTHOR]

• 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]

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]

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]