Finding finer functions for partially characterized proteins by protein-protein interaction networks

Based on high-throughput data, numerous algorithms have been designed to find functions of novel proteins. However, the effectiveness of such algorithms is currently limited by some fundamental factors, including (1) the low a-priori probability of novel proteins participating in a detailed function; (2) the huge false data present in high-throughput datasets; (3) the incomplete data coverage of functional classes; (4) the abundant but heterogeneous negative samples for training the algorithms; and (5) the lack of detailed functional knowledge for training algorithms. Here, for partially characterized proteins, we suggest an approach to finding their finer functions based on protein interaction sub-networks or gene expression patterns, defined in function-specific subspaces. The proposed approach can lessen the above-mentioned problems by properly defining the prediction range and functionally filtering the noisy data, and thus can efficiently find proteins’ novel functions. For thousands of yeast and human proteins partially characterized, it is able to reliably find their finer functions (e.g., the translational functions) with more than 90% precision. The predicted finer functions are highly valuable both for guiding the follow-up wet-lab validation and for providing the necessary data for training algorithms to learn other proteins.     

共轭斜量法在某些特征向量上收敛速度的估计

设 Ａ是对称正定矩阵，λ_1是 Ａ 的最大或最小特征值，χ_1是对应的特征向量．｛zk｝是用共轭斜量法求解方程组 Αχ＝ｂ时的近似解序列，ｅi＝Ａ～(_1)b-zi,本文给出了|x_1～Tei|较合理的上界估计式。从而为分析预处理共轭斜量法提供了进一步的理论基础。     

带式输送机液压恒张力控制系统

本文介绍了一种新型的液压张紧装置,适合于与堆取料机配套使用的胶带输送机,阐述了该装置的组成及工作原理,并着重对该设备恒张力控制工况研究,提出一种简易有效的计算机控制算法。     

受顶点数限制的最短路问题及其算法

本文提出了若干受顶点数限制的最短路问题。引入非支配路的概念，用双标号和取字典序最小方法，给出求解问题的多项式算法。     

Security Analysis of Discrete Logarithm Based Cryptosystems

0 IntroductionNowthere are many well known cryptosystems based ondiscrete logarithms , such as the ElGamal cryptosys-tem[1]and the digital signature algorithm(DSA)[2]. Discretelogarithms have many advantages . Breaking the discrete log-arithm modulo pri mepappears to be somewhat harder thanfactoringintegern,and elliptic curve cryptosystems may usemuchsmaller keysizesthan RSA-basedcryptosystems of com-parable security.The discrete logarithmproblemover a group can be bro-ken down into a numb…     

改进QDPSO算法在BP网络训练中的应用

QDPSO（Quantum Delta-Potential-Well-based Particle Swarm Optimization）算法是基于量子空间的粒子群算法，对QDPSO算法进行了改进，结合Iris分类问题，应用到BP网络的权值优化中，并和基于标准PSO算法的方法进行了比较。实验结果表明：该算法性能优于所比较的两种算法，并且具有良好的收敛性和稳定性。     

蚁群算法的应用研究与发展

蚁群算法是一种新兴的模拟进化算法,由于其具有鲁棒性、正反馈、并行分布式计算等特点,迅速得到广泛的应用和发展。本文首先介绍了蚁群算法的原理和实现方法,进而又对其研究进展和实际应用做了较详细的综述,并对其前景和发展方向进行了展望。     

(Mn1-xCox)65Ge35(x=0.2～0.5)合金的磁热效应

在氩气的保护下用熔炼法制备了(Mn1-xCox)65Ge35系列合金,通过X射线衍射和振动样品磁强计研究了样品的结构和磁熵变.结果表明,(Mn1-xCox)65Ge35系列合金在Co含量x=0.2时,样品为正交结构,磁矩反铁磁排列; 当Co含量0.2≤x≤0.5时,样品为六角结构,磁矩铁磁排列.随着Co含量的增加,合金的居里温度在250～302K范围内变化.在低磁场(0-1.5T)下,(Mn1-xCox)65Ge35系列合金的最大等温磁熵变为1.7J·kg-1·K-1.