A novel 3-D graphical representation of protein sequence has been introduced. A right cone of a unit base and unit height has been selected to represent protein sequences on its surface. The twenty amino acids have be...A novel 3-D graphical representation of protein sequence has been introduced. A right cone of a unit base and unit height has been selected to represent protein sequences on its surface. The twenty amino acids have been represented by 20 circles and all protein's residues have been represented by n lines on the cone's surface. All the spots which represent the protein's residues have been shown in the cone's top view. The spatial median of all the spots is used as a new descriptor of any protein sequence. This approach was applied on two short segments of protein of yeast Saccharomyces cerevisiae. The examination of the similarities/dissimilarities for the eight ND5 proteins and the six β-globin proteins illustrate the utility of our approach. A linear correlation and significance analysis have been provided to compare our results and the percentage sequence alignment identity.展开更多
The k-median problem has attracted a number of researchers. However,few of them have considered both the dynamic environment and the issue of accuracy. In this paper,a new type of query is studied,called continuous me...The k-median problem has attracted a number of researchers. However,few of them have considered both the dynamic environment and the issue of accuracy. In this paper,a new type of query is studied,called continuous median monitoring （CMM） query. It considers the k-median problem under dynamic environment with an accuracy guarantee. A continuous group nearest neighbor based （CGB） algorithm and an average distance medoid （ADM） algorithm are proposed to solve the CMM problem. ADM is a hill climbing schemed algorithm and achieves a rapid converging speed by checking only qualified candidates. Experiments show that ADM is more efficient than CGB and outperforms the classical PAM （partitioning around medoids） and CLARANS （clustering large applications based on randomized search） algorithms with various parameter settings.展开更多
无线传感器网络中的错误测量数据会导致网络服务质量下降和能量浪费.提出了一种通过融合邻居节点的测量数据来实现故障检测的策略.主要做了以下3项工作:(1)提出了一种新颖的对邻居节点测量数据进行加权的方法;(2)提出了一种衡量测量数...无线传感器网络中的错误测量数据会导致网络服务质量下降和能量浪费.提出了一种通过融合邻居节点的测量数据来实现故障检测的策略.主要做了以下3项工作:(1)提出了一种新颖的对邻居节点测量数据进行加权的方法;(2)提出了一种衡量测量数据之间差距的方法;(3)提出了基于加权中值的故障诊断策略WMFDS(weighted median fault detection scheme),它同时适用于二进制决策和实数测量值.理论分析及仿真结果表明,即使节点发生故障的概率很高,提出的诊断策略也能得到很高的检测精度和较小的误判率,这表明在无线传感器网络故障检测中应用该方法具有很好的性能.展开更多
文摘A novel 3-D graphical representation of protein sequence has been introduced. A right cone of a unit base and unit height has been selected to represent protein sequences on its surface. The twenty amino acids have been represented by 20 circles and all protein's residues have been represented by n lines on the cone's surface. All the spots which represent the protein's residues have been shown in the cone's top view. The spatial median of all the spots is used as a new descriptor of any protein sequence. This approach was applied on two short segments of protein of yeast Saccharomyces cerevisiae. The examination of the similarities/dissimilarities for the eight ND5 proteins and the six β-globin proteins illustrate the utility of our approach. A linear correlation and significance analysis have been provided to compare our results and the percentage sequence alignment identity.
文摘The k-median problem has attracted a number of researchers. However,few of them have considered both the dynamic environment and the issue of accuracy. In this paper,a new type of query is studied,called continuous median monitoring （CMM） query. It considers the k-median problem under dynamic environment with an accuracy guarantee. A continuous group nearest neighbor based （CGB） algorithm and an average distance medoid （ADM） algorithm are proposed to solve the CMM problem. ADM is a hill climbing schemed algorithm and achieves a rapid converging speed by checking only qualified candidates. Experiments show that ADM is more efficient than CGB and outperforms the classical PAM （partitioning around medoids） and CLARANS （clustering large applications based on randomized search） algorithms with various parameter settings.
基金Supported by the National Natural Science Foundation of China under Grant No.60633060(国家自然科学基金)the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z223(国家高技术研究发展计划(863))the National Grand Fundamental Research973Program of China under Grant No.2005CB321604(国家重点基础研究发展规划(973))
文摘无线传感器网络中的错误测量数据会导致网络服务质量下降和能量浪费.提出了一种通过融合邻居节点的测量数据来实现故障检测的策略.主要做了以下3项工作:(1)提出了一种新颖的对邻居节点测量数据进行加权的方法;(2)提出了一种衡量测量数据之间差距的方法;(3)提出了基于加权中值的故障诊断策略WMFDS(weighted median fault detection scheme),它同时适用于二进制决策和实数测量值.理论分析及仿真结果表明,即使节点发生故障的概率很高,提出的诊断策略也能得到很高的检测精度和较小的误判率,这表明在无线传感器网络故障检测中应用该方法具有很好的性能.
