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

22nd International Joint Conference on Artificial Intelligence, IJCAI 2011

作者： Liu, Tian Lin, Xiaxiang Wang, Chaoyi Su, Kaile Xu, Ke Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing 100871 China State Key Laboratory of Software Development Environment Beihang University Beijing 100083 China

ISBN: (纸本)9781577355120

Consider random hypergraphs on n vertices, where each k-element subset of vertices is selected with probability p independently and randomly as a hyperedge. By sparse we mean that the total number of hyperedges is O(n) or O(n ln n). When k = 2, these are exactly the classical Erdös-Rényi random graphs G(n, p). We prove that with high probability, hinge width on these sparse random hypergraphs can grow linearly with the expected number of hyperedges. Some random constraint satisfaction problems such as Model RB and Model RD have satisfiability thresholds on these sparse constraint hypergraphs, thus the large hinge width results provide some theoretical evidence for random instances around satisfiability thresholds to be hard for a standard hinge-decomposition based algorithm. We also conduct experiments on these and other kinds of random graphs with several hundreds vertices, including regular random graphs and power law random graphs. The experimental results also show that hinge width can grow linearly with the number of edges on these different random graphs. These results may be of further interests.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Energy-based cluster-head inheritance algorithm for wireless sensor networks

Energy-based cluster-head inheritance algorithm for wireless...

引用

3rd International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2011

作者： Ding, Rong Du, Haiying Yang, Bing State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9780769545578

Energy-efficiency is a critical factor in designing clustering protocols of Wireless Sensor networks. In this paper, we propose an Energy-based Cluster-head Inheritance Algorithm (EICA), which adopts a novel kind of CH inheritance mechanism with each cluster based on an energy threshold to balance energy cost among the network. Simulation results show that ECIA algorithm performs much better than the classical clustering algorithm LEACH and our previous work. © 2011 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

High performance point-multiplication for conic curves cryptosystem based on standard NAF algorithm and Chinese Remainder Theorem

High performance point-multiplication for conic curves crypt...

引用

2011 International Conference on Information science and Applications, ICISA 2011

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

ISBN: (纸本)9781424492244

This paper presents parallel point-multiplication on conic curves based on standard NAF algorithm and Chinese Remainder Theorem. All analysis of parallel methodologies should take advantage of the basic parallel algorithms of conic curves cryptosystem in our previous works. We employ standard NAF algorithm to parallel the point-multiplication over finite field Fp by adopting the pipeline technique to compute point-addition and point-double respectively. The expression of point-addition over ring Zn is deduced to declare that the parallel methodology over finite field Fp could be used over ring Zn. The operation of pointmultiplication over ring Zn is paralleled by partitioning the operation into two different finite fields based on Chinese Remainder Theorem and then combining the two temporary parameters to get the final result. After that, a quantitative performance contrast is made between sequential algorithm and parallel algorithm to show our approaches allow speeding up the point-multiplication on conic curves and reduce the time complexity. Additionally, the parallel method of paralleling point-multiplication over ring Zn introduced in this paper is also more efficient than an old parallel algorithm we proposed before. © 2011 IEEE.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Lazy symbolic execution for test data generation

Lazy symbolic execution for test data generation

引用

作者： Lin, M.X. Chen, Y.L. Yu, K. Wu, G.S. State Key Laboratory of Software Development Environment Beihang University China School of Mechanical Engineering and Automation Beihang University China School of Computer Science and Engineering Beihang University China School of Software Engineering Beijing University of Posts and Telecommunications China

In the context of test data generation, symbolic execution gets more attention as computing power increases continuously. Experiments show that test generation tools based on symbolic execution can get high coverage and find bugs on real applications. However, symbolic execution still has limitations in handling some complex program structures such as pointers, arrays and library functions. To address the problem, this study proposes a technique called lazy symbolic execution, which combines symbolic execution with a lazy evaluation strategy. The authors approach is motivated by the observation that some program structures can be reasoned about symbolically and the others have to be evaluated concretely. Traditional symbolic execution can cope with the former well, whereas lazy symbolic evaluation is used to handle the latter. However, lazy symbolic evaluation introduces intermediate variables into path constraints. To eliminate those variables, concrete values for some input variables are first obtained by constraint solving or searching processes. Then, the given path is executed again using inputs consisting of concrete and symbolic values. The procedure is repeated until all intermediate variables are wiped out. The authors have implemented a prototype tool and performed some experiments. The empirical results show the effectiveness of their approach. © 2011 The Institution of engineering and Technology.

关键词： Concretes

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of BIOS for godson-3A interconnections

Design and implementation of BIOS for godson-3A interconnect...

引用

International Conference on computer and Management

作者： Gao, Yuhui Zhu, Mingfa Huo, Jiantong Xiao, Limin Xiao, Yuqian State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China Beijing Aerospace Control Center Beijing 100094 China

ISBN: (纸本)9781424492831

The hardware design of Godson-3A processor adopts the scalab.e distributed multi-core structure which is based on a 2D mesh. It can make use of multi-chip interconnection to construct a unified topology structure for board level or system level. This kind of interconnected system can't achieve entirely by hardware design, and it also needs the reasonable design of the BIOS and upper software. As the only bridge between hardware and software, the BIOS plays an important role in the computer system. In this paper, we introduce the two-level scalab.e architecture implemented inside Godson-3A, and discuss the realization of software routing configuration mechanism by the crossbar switch in detail. Based on the above analysis, we analyze the design and implementation of BIOS in a CC-NUMA system composed by multiple processors with support of Godson-3A hardware design, and in a larger NCC-NUMA system formed by multiple CC-NUMA systems. ©2011 IEEE.

关键词： Integrated circuit interconnects

来源：评论

学校读者我要写书评

暂无评论

引用

2011 7th International Conference on Computational Intelligence and Security, CIS 2011

作者： Zuo, Yanfei Liu, Guohua Yue, Xiaoli Wang, Wei Wu, Honghua School of Computer Science and Technology Donghua University Shanghai China State Key Lab. for Novel Software Technology Nanjing University Nanjing China School of Mechanical Engineering Donghua University Shanghai China

ISBN: (纸本)9780769545844

Similarity matching is one of the most important operations for data mining over time series. But previous works mainly focus on certain data. With the development of the internet of things and sensor networks, uncertain time series are emerging from various sources, which is a new challenge for data processing. In this paper, a novel similarity matching algorithm over uncertain time series is proposed based on a simple model representing the uncertain time series. According to the certainty of the query time series and the database, similarity matching is classified to three types. Then a certain time series is extracted to represent the original uncertain time series. Finally, a similarity search algorithm for certain time series is adopted. Experimental evaluation shows that our algorithm has high efficiency for similarity matching over uncertain time series. © 2011 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

A binary-centric wrapping approach for software migration based on behavior analysis and resource mapping

引用

Journal of Computational Information Systems 2011年第12期7卷 4541-4551页

作者： Zhu, Kenan Yin, Baolin State Key Laboratory of Software Development Environment School of Computer Science and Engineering BeiHang University Beijing 100191 China

software migration is an effective way to achieve software reuse and reduce the costs of software maintenance. Wrapping approach is a valuable option for software migration. After analyzing the framework of software interface and resource interface characteristics, a common resource definition model which is described by a resource description language, and a resource mapping mechanism which is expressed by a resource mapping description language are proposed in this paper. Then, we present a binary-centric and black-box wrapping approach based on software behavior analysis and resource mapping technique. We also design and implement an automatic software wrapper prototype called EasyWrapper. Through evaluating EasyWrapper in some software reuse scenario, we prove that it can deal with all these reuse requirements. Additionally, we show that our approach is easily deployable and widely applicable and has minimal performance overhead. Copyright © 2011 Binary Information Press.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Multi-lab.l classification with Bayes' theorem

Multi-label classification with Bayes' theorem

引用

2011 4th International Conference on Biomedical engineering and Informatics, BMEI 2011

作者： Qu, Guangzhi Zhang, Hui Hartrick, Craig T. Computer Science and Engineering Department Oakland University Rochester MI 48309 United States State Key Laboratory of Software Development Environment School of Computer Science Beihang University Beijing 100191 China Anesthesiology Research School of Medicine Oakland University Rochester MI 48309 United States

ISBN: (纸本)9781424493524

Compared with single-lab.l classification, multi-lab.l classification is more general in practice, since it allows one instance to have more than one lab.l simultaneously. Bayes' Theorem has been successfully applied to deal with single-lab.l classification. In this paper, we proposed to tackle multi-lab.l classification using Bayes' Theorem. We propose two approaches, coined as Pair-Dependency Multi-lab.l Bayesian Classifier (PDMLBC) and Complete-Dependency Multi-lab.l Bayesian Classifier (CDMLBC). PDMLBC takes advantage of lab.l dependency between any two lab.ls, while CDMLBC considers the dependency among a set of lab.ls. In the experiments, we evaluate the performance of PDMLBC and CDMLBC on real medical data, the results show that both PDMLBC and CDMLBC methods outperform NB+BR on all metrics, and CDMLBC works best among the three methods. © 2011 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Online MOACO biclustering of microarray data

Online MOACO biclustering of microarray data

引用

2011 IEEE International Conference on Granular Computing, GrC 2011

作者： Liu, Junwan Li, Zhoujun Hu, Xiaohua Chen, Yiming 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 United States School of Information Science and Technology Hunan Agricultural University China

ISBN: (纸本)9781457703713

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. © 2011 IEEE.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

The construction of fuzzy concept lattices based on (θ, σ)-fuzzy rough approximation operators

The construction of fuzzy concept lattices based on (θ, σ)...

引用

作者： Yao, Yanqing Mi, Jusheng Li, Zhoujun Xie, Bin State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China College of Mathematics and Information Science Hebei Normal University Shijiazhuang Hebei 050016 China Beijing Key Laboratory of Network Technology Beihang University Beijing China

Formal concept analysis and rough set analysis are two complementary approaches for analyzing data. This paper studies approaches to constructing fuzzy concept lattices based on generalized fuzzy rough approximation operators. For a residual implicator θ satisfying θ (a, b) = θ(1-b, 1-a) and its dual σ, a pair of (θ, σ)-fuzzy rough approximation operators is defined. We then propose three kinds of fuzzy operators, and examine some of their basic properties. Thus, three complete fuzzy concept lattices can be produced, for which the properties are analogous to those of the classical concept lattices.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：