正交匹配追踪算法的迭代残差重建方法

正交匹配追踪(Orthogonal Matching Pursuit, OMP)算法是一种重要的压缩感知重构算法. OMP算法在每次迭代中选择与当前残差最相关的原子. 针对每次迭代需要重新计算残差的问题, 本文考虑偶数次迭代下残差未知的情况. 首先, 研究了奇数次迭代的残差与下一次迭代的残差之间的关系, 得到了一种偶数次迭代时选择原子的标准. 然后, 引入一种回溯机制来处理前面所得的迭代结果, 这种机制通过剔除其中多余的原子来实现精确重建. 据此, 提出了可减少计算残差的改进型正交匹配追踪算法.     

基于流量测点的热网变动阻力系数优化辨识

随着供热计量系统的普及，系统可以根据负荷的变化进行调整，管网的阻力系数随即发生变化。对变动阻力系数进行优化辨识是了解供热管网实时运行状况的有效手段。提出一种基于流量监测数据的供热管网变动阻力系数优化辨识方法，并利用遗传算法进行求解。对洛阳市某小区供暖季管网实际运行数据进行验证，辨识结果的相对误差在5%以内。结果表明：该方法可以在只有流量观测数据时得到精度较高的供热管网变动阻力系数，为供热系统的运行调节提供指导。     

An artificial hummingbird algorithm based localization with reduced number of reference nodes for wireless sensor networks

Wireless Sensor Networks (WSN) are widely used in recent years due to the advancements in wireless and sensor technologies. Many of these applications require to know the location information of nodes. This information is useful to understand the collected data and to act on them. Existing localization algorithms make use of a few reference nodes for estimating the locations of sensor nodes. But, the positioning and utilization of reference nodes increase the cost and complexity of the network. To reduce the dependency on reference nodes, in this paper, we have developed a novel optimization based localization method using only two reference nodes for the localization of the entire network. This is achieved by reference nodes identifying a few more nodes as reference nodes by the analysis of the connectivity information. The sensor nodes then use the reference nodes to identify their locations in a distributive manner using Artificial Hummingbird Algorithm (AHA). We have observed that the localization performance of the reported algorithm at a lower reference node ratio is comparable with other algorithms at higher reference node ratios.     

Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem

This paper is concerned with the Online Quota Traveling Salesman Problem. Depending on the symmetry of the metric and the requirement for the salesman to return to the origin, four variants are analyzed. We present optimal deterministic algorithms for each variant defined on a general space, a real line, or a half-line. As a byproduct, an improved lower bound for a variant of Online TSP on a half-line is also obtained.     

A consensus successive projections algorithm – multiple linear regression method for analyzing near infrared spectra

The successive projections algorithm (SPA) is widely used to select variables for multiple linear regression (MLR) modeling. However, SPA used only once may not obtain all the useful information of the full spectra, because the number of selected variables cannot exceed the number of calibration samples in the SPA algorithm. Therefore, the SPA-MLR method risks the loss of useful information. To make a full use of the useful information in the spectra, a new method named “consensus SPA-MLR” (C-SPA-MLR) is proposed herein. This method is the combination of consensus strategy and SPA-MLR method. In the C-SPA-MLR method, SPA-MLR is used to construct member models with different subsets of variables, which are selected from the remaining variables iteratively. A consensus prediction is obtained by combining the predictions of the member models. The proposed method is evaluated by analyzing the near infrared (NIR) spectra of corn and diesel. The results of C-SPA-MLR method showed a better prediction performance compared with the SPA-MLR and full-spectra PLS methods. Moreover, these results could serve as a reference for combination the consensus strategy and other variable selection methods when analyzing NIR spectra and other spectroscopic techniques.     

Development of models for prediction of the antioxidant activity of derivatives of natural compounds

Antioxidants are important for maintaining the appropriate balance between oxidizing and reducing species in the body and thus preventing oxidative stress. Many natural compounds are being screened for their possible antioxidant activity. It was found that a mushroom pigment Norbadione A, which is a pulvinic acid derivative, shows an antioxidant activity; the same was found for other pulvinic acid derivatives and structurally related coumarines. Based on the results of in vitro studies performed on these compounds as a part of this study quantitative structure–activity relationship (QSAR) predictive models were constructed using multiple linear regression, counter-propagation artificial neural networks and support vector regression (SVR). The models have been developed in accordance with current QSAR guidelines, including the assessment of the models applicability domains. A new approach for the graphical evaluation of the applicability domain for SVR models is suggested. The developed models show sufficient predictive abilities for the screening of virtual libraries for new potential antioxidants.     

Low‐memory iterative density fitting

A new low‐memory modification of the density fitting approximation based on a combination of a continuous fast multipole method (CFMM) and a preconditioned conjugate gradient solver is presented. Iterative conjugate gradient solver uses preconditioners formed from blocks of the Coulomb metric matrix that decrease the number of iterations needed for convergence by up to one order of magnitude. The matrix‐vector products needed within the iterative algorithm are calculated using CFMM, which evaluates them with the linear scaling memory requirements only. Compared with the standard density fitting implementation, up to 15‐fold reduction of the memory requirements is achieved for the most efficient preconditioner at a cost of only 25% increase in computational time. The potential of the method is demonstrated by performing density functional theory calculations for zeolite fragment with 2592 atoms and 121,248 auxiliary basis functions on a single 12‐core CPU workstation. © 2015 Wiley Periodicals, Inc.     

Network-based ranking methods for prediction of novel disease associated microRNAs

BackgroundMany studies have shown roles of microRNAs on human disease and a number of computational methods have been proposed to predict such associations by ranking candidate microRNAs according to their relevance to a disease. Among them, machine learning-based methods usually have a limitation in specifying non-disease microRNAs as negative training samples. Meanwhile, network-based methods are becoming dominant since they well exploit a “disease module” principle in microRNA functional similarity networks. Of which, random walk with restart (RWR) algorithm-based method is currently state-of-the-art. The use of this algorithm was inspired from its success in predicting disease gene because the “disease module” principle also exists in protein interaction networks. Besides, many algorithms designed for webpage ranking have been successfully applied in ranking disease candidate genes because web networks share topological properties with protein interaction networks. However, these algorithms have not yet been utilized for disease microRNA prediction.MethodsWe constructed microRNA functional similarity networks based on shared targets of microRNAs, and then we integrated them with a microRNA functional synergistic network, which was recently identified. After analyzing topological properties of these networks, in addition to RWR, we assessed the performance of (i) PRINCE (PRIoritizatioN and Complex Elucidation), which was proposed for disease gene prediction; (ii) PageRank with Priors (PRP) and K-Step Markov (KSM), which were used for studying web networks; and (iii) a neighborhood-based algorithm.ResultsAnalyses on topological properties showed that all microRNA functional similarity networks are small-worldness and scale-free. The performance of each algorithm was assessed based on average AUC values on 35 disease phenotypes and average rankings of newly discovered disease microRNAs. As a result, the performance on the integrated network was better than that on individual ones. In addition, the performance of PRINCE, PRP and KSM was comparable with that of RWR, whereas it was worst for the neighborhood-based algorithm. Moreover, all the algorithms were stable with the change of parameters. Final, using the integrated network, we predicted six novel miRNAs (i.e., hsa-miR-101, hsa-miR-181d, hsa-miR-192, hsa-miR-423-3p, hsa-miR-484 and hsa-miR-98) associated with breast cancer.ConclusionsNetwork-based ranking algorithms, which were successfully applied for either disease gene prediction or for studying social/web networks, can be also used effectively for disease microRNA prediction.     

Delay optimization and energy balancing algorithm for improving network lifetime in fixed wireless sensor networks

Since wireless in terms of energy-restricted processes, dispersion radii, processing power limitations, buffers, bandwidth-limited connections, active network topologies, and network stream of traffic outlines, sensor networks provide difficult design issues. The number of hops and latency are decreased if there is a relay mote because it interacts directly with relay motes that are closer to the destination mote. The tremendous intensive research in the area of Wireless Sensor Networks (WSN) has gained a lot of significance among the technical community and research. The job of WSN is to sense the data using sensor motes, pass on the data to the destination detection mote which is associated with a processing center and can be used in multiple spans of Internet of Things (IoT) applications. Wireless sensor network has a set of sensor motes. By making use of sensor mote placement strategy all the sensor motes are spread in an area with each mote having its own exceptional location. Internet of things applications are delay sensitive those applications have a challenge of forming the complete path at a lower delay constraint. The proposal is to modify the game theory energy balancing algorithm by making use of relay motes so that overall network lifetime is increased. It has been proved that modified GTEB is better with respect to existing algorithms in terms of delay, figure of hops, energy depletion, figure of alive motes, figure of dead motes, lifespan ratio, routing overhead and throughput.