Search

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

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]

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

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]