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

IEEE International Conference on Granular Computing (GRC)

作者： Junwan Liu Zhoujun Li Xiaohua Hu Yiming Chen School of Computer Information Engineering Central South University of Forestry and Technology China State Key Laboratory of Software Development Environment Beijing China College of Information Science and Technology Drexel University USA School of Information Science and Technology Hunan Agricultural University China

Multi-objective optimization (MOP) a fast growing area of research. Bioinformatics data sets come mostly from DNA microarray experiments. The analysis of microarray data sets can provide valuable information on the biological relevance of genes and correlations among them. Biclustering methods allow us to identify genes with similar behavior with respect to different conditions. A single bicluster represents a given subset of genes in a given subset of conditions. For solving multiple objectives optimization, ant colony optimization algorithms have been shown to be very effective for MOP. This paper proposes online Multiple Objective Ant Colony Optimization biclustering algorithm to solve patterns mining problem of microarray dataset. During optimization, the size of ant population is dynamically changed to quicken the convergence of the algorithm. Experimental analysis on two real dataset shows that the proposed algorithm achieves good performance in the diversity of solution and the time complexity of the algorithm.

关键词： Heuristic algorithms Optimization Algorithm design and analysis Humans Gene expression Convergence Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

A 3D shape retrieval framework for 3D smart cities

引用

中国高等学校学术文摘·计算机科学 2010年第3期4卷 394-404页

作者： Biao LENG Zhang XIONG Xiangwei FU State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China College of Software Engineering Southeast UniversityNanjing 210089China

This paper introduces the importance of 3D shape retrieval frameworks in 3D smart cities, and proposes a unified framework for 3D shape retrieval. The proposed method is based on the concept of visual representation, where each object is rendered with several depth images and binary images from distributed vertices in the regular polyhedron. For each image, several shape descriptors are utilized to extract features. Finally, different feature vectors are concatenated into a composite one. The experimental results show that the proposed method not only significantly improves the retrieval performance, but also achieves better retrieval effectiveness than other state-of-the-art algorithms, running princeton shape benchmark (PSB) and other standard evaluation measures.

关键词： 3D smart city 3D shape retrieval unified framework

来源：评论

学校读者我要写书评

暂无评论

DeepComp: towards a balanced system design for high performance computer systems

引用

中国计算机科学前沿 2010年第4期4卷 475-479页

作者： Mingfa ZHU Limin XIAO Li RUAN Qinfen HAO State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China

Today, cluster-based computing is the mainstream architecture for high end computer *** system design is critical for large scale cluster systems to achieve high efficiency. This paper addresses the practice on DeepComp high end computer systems toward a balanced system design. Methodologies of designing balanced large scale cluster systems are given.A method for balancing central processing unit (CPU) and memory hierarchy is addressed. For balancing computing nodes and I/O systems, two approaches are given:maximum bandwidth criterion and rnax imum number of computing nodes which can concurrently access I/O systems. Experiences of Lenovo high end cluster systems show that above methods are effective. Lenovo strategies toward a balanced system design for both peta and 10 peta scale high productivity computing systems (HPCSs).

关键词： high performance computer systems (HPCs) high productivity computing systems (HPCSs) cluster balanced system design

来源：评论

学校读者我要写书评

暂无评论

Logical verification of scientific discovery

引用

science China(Information sciences) 2010年第4期53卷 677-684页

作者： LI Wei state key lab.ratory of software development environment, school of computer science and engineering, Beihang University, Beijing 100191, China 1. State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China

This paper shows that the discovery processes of Einstein’s special theory of relativity and Darwin’s theory of evolution of species can be formally verified by R-calculus which is a logical inference system. The aim of R-calculus is to delete the principles of scientific theories which contradict empirical evidence. The paper shows that the special theory of relativity is the only and correct choice for physics to meet the experimental evidence given at the time. As far as the biology of Darwin’s time is concerned, however, the R-calculus has derived three logically correct but different theories, which are all consistent with the empirical evidence provided by Darwin and his principle of natural selection. Darwin’s theory of evolution matches one of the three theories derived by R-calculus. This theory has a logical consequence that is "each species has been independently created is erroneous". But the other two theories support the negation of the above statement. The existence of the other two theories may be a reason of the controversies over Darwin’s theory.

关键词： R-calculus theory of relativity theory of evolution

来源：评论

学校读者我要写书评

暂无评论

Resilient virtual network service provision in Network Virtualization environments

Resilient virtual network service provision in Network Virtu...

引用

16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010

作者： Chen, Yang Li, Jianxin Wo, Tianyu Hu, Chunming Liu, Wantao State Key Laboratory of Software Development Environment China School of Computer Science and Engineering Beihang University China

ISBN: (纸本)9780769543079

Network Virtualization has recently emerged to provide scalab.e, customized and on-demand virtual network services over a shared substrate network. How to provide VN services with resiliency guarantees against network failures has become a critical issue, meanwhile the service resource usages should be minimized under the strict constraints such as link bandwidth capability and service resiliency guarantees etc. In this paper, we present a resource allocation algorithm to balance the tradeoff between service resource consumptions and service resiliency. By exploiting a heuristic VN mapping scheme and a restoration path selection scheme based on intelligent bandwidth sharing, the algorithm simultaneously makes cost-effective usage of network resources and protects VN services against network failures. We perform evaluations and find that the algorithm is near optimal in terms of network resource usage, especially the additional restoration bandwidth cost for resiliency protection. © 2010 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Computing R-contraction for propositional logic is hard

RETRACTED ARTICLE: Computing R-contraction for propositional...

引用

2nd International Workshop on Education Technology and computer science, ETCS 2010

作者： Li, He Li, Lusong State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769539874

R-calculus is a formal revision calculus system which can formally deduce R-contraction. R-contraction is the axiom system's maximal subset that is consistent with the refutations by facts. In this paper, we prove that computing R-contraction for propositional logic is hard by two steps. Firstly, we prove that computing R-contraction is at least as hard as its decision problem. Secondly, we prove that the decision problem of computing R-contraction is NP-complete by presenting that the satisfiability problem, a known NP-complete problem, can polynomially reduce to it. So for this problem, we should direct our efforts at developing efficient heuristic algorithms or some other technology such as human-computer interaction. © 2010 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Formal analysis of behavioural equivalence for trustworthy and composite web services

Formal analysis of behavioural equivalence for trustworthy a...

引用

International Conference on Autonomic and Trusted Computing

作者： Zhao, Yongwang Hu, Chunyang Liu, Min Ma, Dianfu State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769542720

Trustworthy and composite web services play important roles in service-oriented systems. Web services choreography as one important approach of composing web services describes the global model of service interactions among a set of participants. Bisimilar analysis that checks whether two choreographies are behavioural equivalent is an important verification approach for trustworthy composition. This paper discusses strong and weak bisimilarity of choreographies. Internal and external roles are distinguished from special roles that we hope to verify their observable behaviours. A language named Chor which is based on abstract syntax of WS-CDL is proposed to describe behaviours. In Chor, internal roles and internal activities among them are abstracted for their no effect on externally observable behaviour. A real example is presented to illustrate the usages and benefits of the formal analysis. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Marching prisms: Rapid section generation in 3D geological model

Marching prisms: Rapid section generation in 3D geological m...

引用

2010 International Conference on computer Modeling and Simulation, ICCMS 2010

作者： Xu, Ping Yang, Qin Meng, Xianhai State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University BUAA Beijing China

ISBN: (纸本)9780769539416

To efficiently construct the profile in 3D geological model expressed by triangular mesh and rapidly cut the model into separated parts, a new idea is presented in large scale compatible triangular mesh. It promotes the stratums surface meshes to volume model, and then treats the profile generation process as the isosurface extraction process in the model. A new method called Marching Prisms (MP) used to construct the isosurface. Using a divide-and-conquer approach to generate inter-slice connectivity, the MP algorithm uses a case table to define the inter-slice triangle topology in tri-prism cells just like the Marching Cubes algorithm in cube grids. After using linear interpolation to calculate the location of inter-slice triangle vertices, the MP algorithm uses the distance from every vertex of a prism to the isosurface to index the cases from the case table. According to the practical application, MP algorithm also can handle the ambiguous conditions in isosurface construction. To get the separated parts of the original meshes by the cutting, it is only need to modify the topology on top and bottom of the intersected prisms. Results from demo applications illustrate that the Marching Prisms is effective and efficient. © 2010 IEEE.

关键词： Prisms

来源：评论

学校读者我要写书评

暂无评论

A revision approach based on assignment equivalence classes

A revision approach based on assignment equivalence classes

引用

2nd International Workshop on Intelligent Systems and Applications, ISA2010

作者： Jiang, Dongchen Lou, Yihua Jin, Yi State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China China Development Laboratory IBM Beijing China

ISBN: (纸本)9781424458745

The problem of belief revision and specification evolution has been studied for years. Different methods have been proposed to solve this problem. However, the problem of efficiency has not been solved well. Therefore, this paper proposes a revision algorithm based on assignment equivalence classes to improve the efficiency of the delegate model based algorithm. The new algorithm follows the same structure of the delegate model based algorithm but reduces the times of model checking. Concepts such as delegate models of a proposition set and sub-assignment equivalence classes are introduced, and relevant properties are also proved. The new algorithm is implemented, which has a better performance than before. ©2010 IEEE.

关键词： Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

Parallel point-multiplication for conic curves cryptosystem

Parallel point-multiplication for conic curves cryptosystem

引用

International Symposium on Parallel Architectures, Algorithms, and Programming

作者： Li, Yongnan Xiao, Limin State Key Laboratory of Software Development Environment Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9780769543123

Cryptosystem on conic curves, which is a new developing cryptography, becomes more widespread in these days. It is important to explore fast parallel algorithms to both encrypt and decrypt information in conic curves cryptosystem. Point-multiplication is the key operation for constructing security protocol in conic curves cryptosystem. There is no existing research focused on paralleling point-multiplication for conic curves cryptosystem. This paper presents parallel computation of point-multiplication for conic curves cryptosystem over finite field Fp and ring Zn. Research in this paper is based on our previous works about several parallel algorithms for conic curves cryptosystem. The parallel technique of point-multiplication is computing point-addition and pointdouble respectively. The performance evaluation demonstrates that our methodology could improve efficiency for conic curves cryptosystem over finite field Fp and ring Zn. © 2010 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：