检索结果-内蒙古大学图书馆

Inferring protein-protein interactions from sequence using sequence order information

Inferring protein-protein interactions from sequence using s...

The 5th International Conference on Computer Science & education(第五届国际计算机新技术与教育学术研讨会 ICCSE'10)

作者： Xiuquan Du Jiaxing Cheng Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui UniversityH Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University

Identification of protein-protein interaction is crucial for nearly all biological process. In this paper, we introduce a new transformation of protein sequence based on sequence order information. We use 5594 interacting pairs of yeast organism from DIP core database as training data set, seven types organism as independent data set. The model with a new protein coding scheme obtains 88.927％ accuracy, 88.243％ sensitivity, 89.468％ specificity, 77.864％ MCC. The average performance on independent data set is 79.4999％.

关键词： protein-protein interaction:sequence order information:support vector machine:auto covariance

来源：评论

学校读者我要写书评

暂无评论

An improved radius of gyration similarity measure between generalized fuzzy numbers and its application to multisource data fusion

引用

Journal of Computers 2011年第8期6卷 1732-1739页

作者： Yong, Deng Dong, Sun Wen, Jiang Jianling, Xu College of computer and information sciences Southwest University Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University Hanzhou Zhejiang 310036 China School of Electronics and Information Technology Shanghai Jiao Tong University Shanghai 200240 China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China Department of Electronics Engineering Northwestern Polytechnical University Xían 710072 China Grain Economics Institute Nanjing University of Finance and Economics Nanjing 210003 China

The degree of similarity between fuzzy numbers plays an important role in fuzzy information fusion. In this paper, improved ROG-based similarity measure developed from the current ROG method is presented. It is shown that the new method can overcome some shortcomings of the existing similarity measures. Based on the proposed similarity measure, a more flexible and intelligent algorithm is developed to deal with multisensor data fusion problems. A numerical example is used to illustrate the efficiency of the proposed method. © 2011 ACADEMY PUBLISHER.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Optimal aggregation of interval numbers based on genetic algorithm in group decision

引用

Journal of Information and Computational Science 2011年第5期8卷 842-849页

作者： Kang, Bingyi Zhang, Yajuan Deng, Xinyang Wu, Jiyi Sun, Xiaohong Li, Ya Deng, Yong College of Computer and Information Sciences Southwest University Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University Hangzhou 310036 China College of Food Science and Technology Shanghai Ocean University 999 Hucheng Huan Road Shanghai 201306 China Key Subject Laboratory of National Defense for Radioactive Waste and Environmental Security Southwest University of Science and Technology Mianyang 621010 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China School of Electronics and Information Technology Shanghai Jiaotong University Shanghai 200240 China

A group of decision-makers may differ in their choice of alternatives while making a decision. As a result, how to aggregate opinions of different experts is still an open issue. Due to the uncertainty in the process of decision making, some mathematic tools such as fuzzy sets theory and evidence theory, are used to model uncertain information. In this paper, the experts' opinions are represented by interval numbers. A new optimal aggregation method to combine interval data is proposed based on genetic algorithm. The new method can deal with experts' opinions in an efficient manner. A numerical example on group decision making under uncertain environment is used to illustrate the efficiency of our proposed method. Copyright © 2011 Binary Information Press.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A more effective definition of evidential conflict combined with evidential distance

引用

Journal of Information and Computational Science 2011年第9期8卷 1729-1734页

作者： Chen, Yuxin Wu, Jiyi Cong, Jian Jie, Wenjing Deng, Yong School of Electronics and Information Technology Shanghai Jiao Tong University Shanghai 20024 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University Hangzhou 310036 China College of Food Science and Technology Shanghai Ocean University 999 Hucheng Huan Road Shanghai 201306 China Key Subject Laboratory of National Defense for Radioactive Waste and Environment Security Southwest University of Science and Technology Mianyang 621010 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China College of Computer and Information Sciences Southwest University Chongqing 400715 China

Evidence theory is widely used in many application systems such as information fusion and decision making under uncertainty environment. However, the classical Dempster combination rule is not efficient to deal with highly conflicting evidences. One of the open issues is how to determine the conflict degree in conflict evidence management. In this paper, a new conflict coefficient is proposed to measure the conflict degree between bodies of evidence. It can overcome some drawbacks of the classical conflict coefficient. The numerical example shows the efficiency of our proposed method. Copyright © 2011 Binary Information Press.

关键词： Information fusion

来源：评论

学校读者我要写书评

暂无评论

A secure scheme for data statistics

A secure scheme for data statistics

引用

International Conference on E-Business and E-Government (ICEE)

作者： Huang, Hongsheng Zhong, Hong Shi, Runhua Key Laboratory of Intelligent Computing and Signal Processing Anhui University Ministry of Education Hefei Anhui 230039 China School of Computer Science and Technology Anhui University Hefei Anhui 230039 China

ISBN: (纸本)9780769539973

Secure Multi-party Computation (SMC) is a hot point concerning with information security and it is widely used in many fields, such as e-voting, e-auction and e-payment systems et al. This paper mainly discusses a special issue, data statistics, of SMC and its practical application background. Based on the oblivious transfer protocol and the homomorphic encryption scheme, a solution scheme is proposed. Furthermore, the security and the computational complexity of this scheme are as well analyzed. The results of analysis show that the proposed scheme is secure and efficient. © 2010 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Two protocols for computing the sub-polygon's areas divided by a line

Two protocols for computing the sub-polygon's areas divided ...

引用

International Conference on Advanced Computer Theory and Engineering

作者： Zhong, Hong Huang, Hongsheng Shi, Runhua Key Laboratory of Intelligent Computing and Signal Processing Anhui University Ministry of Education Hefei Anhui 230039 China School of Computer Science and Technology Anhui University Hefei Anhui 230039 China

ISBN: (纸本)9781424465408

Secure Multi-party Computation (SMC) plays an important role in information security under the circumstance of cooperation calculation, so SMC on privacy-preservation is of great interest. In this paper we discuss an issue which is a special SMC problem. Based on Scalar Product Protocol, Monte Carlo Method and Oblivious Transfer, we give two solutions to the problem about how to decide the areas. That is, a polygon is divided into two parts by a line: SI and S2. Furthermore, we analyze the security and computational complexity, as well as the comparison of these two protocols. The results of analysis show that the proposed protocols are secure and efficient. We believe the two protocols will be useful in other geometric and combinatorial problems. © 2010 IEEE.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Design of image-reject hairpin filter applied for Ku-band LNB

Design of image-reject hairpin filter applied for Ku-band LN...

引用

2010 9th International Symposium on Antennas Propagation and EM Theory, ISAPE 2010

作者： Sun, Jia-Xun Huang, Zhi-Xiang Wu, Xian-Liang Wang, Hui Zhou, Yan Key Lab of Intelligent Computing and Signal Processing Anhui University Ministry of Education Hefei China Department of Physics and Electronic Engineering Hefei Normal University Hefei China

ISBN: (纸本)9781424469062

An image-reject hairpin bandpass filter used in Ku-band low noise block (LNB) is designed, and optimized in the paper. The designed detail of the filter is explained and the image-reject is illustrated theoretically. According to the research, under the condition of reducing the size as small as possible, the hairpin filter used in Ku-band LNB we designed not only can satisfy the demands from bandwidth and return loss, but also has good image-reject. In the end, the results of the simulation and measurement are presented, which prove the feasibility of our design. ©2010 IEEE.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Improved particle swarm algorithm for portfolio optimization problem

Improved particle swarm algorithm for portfolio optimization...

引用

2010 2nd International Conference on Industrial Mechatronics and Automation, ICIMA 2010

作者： Cao, Jianguo Tao, Liang Department of Computer Science Anhui Vocational and Technical College of Industry and Trade Huainan 232007 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China

ISBN: (纸本)9781424476541

Particle swarm optimization (PSO) is a recently proposed population-based random search algorithm, which performs well in some optimization problems. In this paper, we proposed an improved PSO algorithm to solve portfolio selection problems. The proposed approach IPSO employs an opposite mutation operator to enhance the performance of the standard PSO. In order to verify the performance of IPSO, we test it on five well-known benchmark function optimization problems. At last, we use IPSO to solve a classical portfolio selection problem. The results show that the proposed approach is effective and achieves better results than standard PSO. ©2010 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Ontology mapping based on structures and instances

Ontology mapping based on structures and instances

引用

International Conference on Machine Learning and Cybernetics

作者： Zheng, Cheng Shen, Ya-Ping Mei, Lin Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China School of Computer Science Anhui University Hefei 230039 China School of Adult Education Anhui Agricultural University Hefei 230036 China

ISBN: (纸本)9781424465262

Ontology mapping is to find the mapping relationship between different ontology to reuse and share ontology. In this paper we present a multi-strategy ontology mapping technique based on the structure and instance. When the similarity between the mapping pairs is approximating to the threshold, context structures are used to judge their similarity. The key of the instance mapping is calculating the instance similarity. Firstly the instance is preprocessed. Then set similarity and probability similarity based on Bayesian theory is calculated respectively. Finally instance similarity is calculated by the set similarity and probability similarity comprehensively. Experimental results show its effectiveness. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Optimal combination of conflicting evidence based on genetic algorithm

引用

ICIC Express Letters 2011年第4 A期5卷 1145-1150页

作者： Jiang, Wen Peng, Jinye Deng, Yong School of Electronics and Information Northwestern Polytechnical University No. 127 Youyixi Road Xi'an 710072 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University No. 16 Xuelin Street Xiasha Higher Education Zone Hanzhou 310036 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan 411105 China School of Computer and Information Sciences Southwest University No. 2 Tiansheng Road Beibei District Chongqing 400715 China School of Electronics and Information Technology Shanghai Jiao Tong University No. 800 Dongchuan Road Shanghai 200240 China

The Dempster-Shafer (D-S) evidence theory is widely used in many fields of information fusion. However, counter-intuitive results may be obtained by the classical Dempster combination rule when collected evidences are highly in conflict with each other. So an optimal weighted average information fusion method is proposed. Firstly, the global distance of the weighted evidence is presented based on the distance function. Secondly, the optimal weight of every evidence body was acquired by genetic algorithm, while the global distance is the minimum. Finally, the weighted average of the masses is combined by classical Dempster's rule. Compared with existing methods, the proposed optimal method can effectively handle conflicting evidence with better performance of convergence. Numerical examples are illustrated the effectiveness of the proposed method. ICIC International © 2011.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：