Prediction of drug-target interaction by integrating diverse heterogeneous information source with multiple kernel learning and clustering methods

BackgroundIdentification of potential drug-target interaction pairs is very important for pharmaceutical innovation and drug discovery. Numerous machine learning-based and network-based algorithms have been developed for predicting drug-target interactions. However, large-scale pharmacological, genomic and chemical datum emerged recently provide new opportunity for further heightening the accuracy of drug-target interactions prediction.ResultsIn this work, based on the assumption that similar drugs tend to interact with similar proteins and vice versa, we developed a novel computational method (namely MKLC-BiRW) to predict new drug-target interactions. MKLC-BiRW integrates diverse drug-related and target-related heterogeneous information source by using the multiple kernel learning and clustering methods to generate the drug and target similarity matrices, in which the low similarity elements are set to zero to build the drug and target similarity correction networks. By incorporating these drug and target similarity correction networks with known drug-target interaction bipartite graph, MKLC-BiRW constructs the heterogeneous network on which Bi-random walk algorithm is adopted to infer the potential drug-target interactions.ConclusionsCompared with other existing state-of-the-art methods, MKLC-BiRW achieves the best performance in terms of AUC and AUPR. MKLC-BiRW can effectively predict the potential drug-target interactions.     

基于双因子已实现GARCH模型的波动率预测研究

准确地预测金融市场的波动率对市场管理者和参与者而言都是至关重要的。本文在标准已实现GARCH模型基础上,将条件方差乘性分解为长期方差和短期方差两部分,分别构造包含杠杆函数的长期方差方程和短期方差方程,用以捕捉波动率的长记忆性和短期微观波动。运用上证综指和日经指数的日收盘价、已实现方差和已实现核波动此类高频数据进行实证分析,结果表明:与标准已实现GARCH模型相比,两指数的双因子已实现GARCH模型在样本内表现出更大的似然估计值;通过样本外误差函数分析和DM检验,双因子已实现GARCH模型也取得更好表现。     

一种基于序贯估计的直达声区水面舰船 被动测距方法 *

该文利用基于射线的盲解卷积方法，从直达声区的水面舰船噪声中提取出船和锚系于海底的垂直接收阵之间的时域信道响应，并利用直达波在不同阵元相对于参考阵元的到达时间差，通过序贯方法，利用射线模型和声速剖面信息，对水面舰船距接收阵的距离进行了估计。通过处理海深约为580 m的2016年美国圣巴巴拉海峡的实验数据，对1.6~3.5 km直达声区范围内Anna Maersk商船与垂直阵之间的距离进行了估计，验证了测距方法的有效性，并将结果与系统测量值和几何方法的估计值进行了比较。由于该方法不需要对海底参数进行估计，所以在海底参数未知时要优于传统匹配场方法；在声速剖面存在跃层且海底为多层分布的复杂信道条件下，该方法仍能对距离进行有效估计，且与测量值的相对误差在6%以内，小于几何方法的估计误差，测距结果精度较高。     

一类零膨胀广义线性模型极大似然估计的相合性与渐近正态性

讨论了响应变量为单参数指数族且在零点处膨胀的广义线性模型的大样本性质，对其参数进行了极大似然估计，给出了一些正则条件.基于所提出的正则条件，证明了模型参数极大似然估计的相合性与渐近正态性.     

New reproducing kernel Hilbert spaces on semi-infinite domains with existence and uniqueness results for the nonhomogeneous telegraph equation

We introduce new reproducing kernel Hilbert spaces on a semi-infinite domain and demonstrate existence and uniqueness of solutions to the nonhomogeneous telegraph equation in these spaces if the driver is square-integrable and sufficiently smooth.     

More efficient time integration for Fourier pseudospectral DNS of incompressible turbulence

Time integration of Fourier pseudospectral DNS is usually performed using the classical fourth-order accurate Runge-Kutta method or other second- or third-order methods, with a fixed step size. We investigate the use of higher-order Runge-Kutta pairs and automatic step size control based on local error estimation. We find that the fifth-order accurate Runge-Kutta pair of Bogacki and Shampine gives much greater accuracy at a significantly reduced computational cost. Specifically, we demonstrate speedups of 2× to 10× for the same accuracy. Numerical tests (including the Taylor-Green vortex, Rayleigh-Taylor instability, and homogeneous isotropic turbulence) confirm the reliability and efficiency of the method. We also show that adaptive time stepping provides a significant computational advantage for some problems (like the development of a Rayleigh-Taylor instability) without compromising accuracy.     

Existence of solutions for a higher-order semilinear parabolic equation with singular initial data

We establish the existence of solutions of the Cauchy problem for a higher-order semilinear parabolic equation by introducing a new majorizing kernel. We also study necessary conditions on the initial data for the existence of local-in-time solutions and identify the strongest singularity of the initial data for the solvability of the Cauchy problem.     

Regularity,continuity and approximation of isotropic Gaussian random fields on compact two-point homogeneous spaces

Gaussian random fields defined over compact two-point homogeneous spaces are considered and Sobolev regularity and Hölder continuity are explored through spectral representations. It is shown how spectral properties of the covariance function associated to a given Gaussian random field are crucial to determine such regularities and geometric properties. Furthermore, fast approximations of random fields on compact two-point homogeneous spaces are derived by truncation of the series expansion, and a suitable bound for the error involved in such an approximation is provided.     

The Application of Fractal Transform and Entropy for Improving Fault Tolerance and Load Balancing in Grid Computing Environments

This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate.