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

Optimization strategy of top-down join enumeration on modern multi-core CPUs

Journal of Computers 2011年第10期6卷 2004-2012页

作者： Zuo, Wanli Chen, Yongheng He, Fenglin Chen, Kerui Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China

Most contemporary database systems query optimizers exploit System-R's bottom-up dynamic programming method (DP) to find the optimal query execution plan (QEP) without evaluating redundant subplans. The distinguished exceptions are Volcano/Cascades using transforms to generate new plans according to a topdown approach. As recent research has revealed, bottom-up dynamic programming can improve performance with respect to the shape of the join graph and parallelism. However top-down join enumeration dynamic programming method can derive upper bounds for the costs of the plans it generates which is not available to typical bottom-up DP method. In this paper, we propose a comprehensive and practical framework for parallelizing top-down dynamic programming query optimization with complex non-inner join in the multi-core processor architecture, referred as PTDhyp. We have implemented such a search strategy and experimental results show that can improve optimization time effective compared to known existing algorithms. © 2011 ACADEMY PUBLISHER.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Improvement of escape time algorithm by no- escape-point

引用

Journal of Computers 2011年第8期6卷 1648-1653页

作者： Liu, Shuai Che, Xiangjiu Wang, Zhengxuan College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Escape time algorithm is a universal algorithm when to create fractal image. A class of algorithms based on escape time algorithm is wasting-calculation. In this essay, when combined with the feature of eventually periodic point of functions, we define a kind of points as no-escape point. To analyze the shortcomings of the classic algorithm, we improve the escape time algorithm base on the no-escape points. We analyze the algorithm and put forward the best application scope for it. By create lots of fractal figures, we find the figures created by the two algorithms are consistent with each other except a few escape points. We compare the complexity between the two algorithms and find the iteration times by the improved algorithm are less than escape time algorithm when creating the fractal images. We do several experiments and find the improved algorithm is universal and it reduces the time-consuming. © 2011 ACADEMY PUBLISHER.

关键词： Fractals

来源：评论

学校读者我要写书评

暂无评论

A loss assessment design method based on SOA for insurance informationization

A loss assessment design method based on SOA for insurance i...

引用

2011 2nd International Conference on Digital Manufacturing and Automation, ICDMA 2011

作者： Li, Niya Zhang, Jian Lv, Wei Jin, Chengye College of Computer Science and Technology Jilin University 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University 130012 China LeJin Electronics Co. Ltd. of Jilin Province China

ISBN: (纸本)9780769544557

The loss assessment is an important operation of claim process in insurance industry. On the growing tide of making the insurance information system the in-depth support to optimizing operation and serving insurant, a methodological framework for the loss assessment is given based on SOA technology, Under the framework, the operation process design, the cLient design, the service design and the database design are given. These design results have been vaLidated by an actual appLication system. © 2011 IEEE.

关键词： Informatization

来源：评论

学校读者我要写书评

暂无评论

Translation of SPARQL to SQL based on integrity constraint

引用

Journal of computational Information Systems 2011年第2期7卷 394-402页

作者： Cui, Xianji Ouyang, Dantong Ye, Yuxin Wang, Xiaolong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Computation and Knowledge Engineering Ministry of Education China

Most existing storages of the ontology use relational databases as a backend to manage RDF data. This motivates us to translate SPARQL queries, the proposed standard for RDF querying, into equivalent SQL queries. At the basis of giving the IC-based storage to store the ontology with integrity constraints, we present the corresponding translation of SPARQL to SQL called IC-based translation. With the different structure of the tables in the relational databases, the SPARQL query statements are divided into four types. For the different type of query statements, we give the corresponding translations. Copyright © 2011 Binary Information Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A combined collective classification method for sparse data

引用

Journal of Information and computational Science 2011年第15期8卷 3453-3461页

作者： Li, Lina Ouyang, Jihong Liu, Dayou Yang, Bo Huang, Yuxiao Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology JiLin University Changchun 130012 China

Collective classification in networked data has become an important and active research topic, it has a wide variety of real world applications, such as hyperlinked document classification, protein interaction and gene expression data classification, recommending system analysis. However, previous work has shown that the performance of collective classification can degrade when there are too few labels available. In this paper, we firstly present a novel mix collective classification framework that combines network structure features with label distribution of nodes to perform this task, then propose a new method to implement this framework. Through experiments on four real world datasets, we demonstrate that our method outperforms the other state-of-art approaches for this problem. © 2009 by Binary Information Press.

关键词： Information retrieval systems

来源：评论

学校读者我要写书评

暂无评论

A new tractable subclass of cardinal direction relations

引用

International Journal of Advancements in Computing Technology 2011年第8期3卷 238-244页

作者： Wang, Fang Liu, Dayou Dong, Yiqun College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China

In this paper, we introduce a new tractable subclass of cardinal direction relations we called strong saturated-convex rectangle cardinal direction relations. We prove that reasoning in this subclass is a polynomial t... 详细信息

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

A self-adaptive differential evolution algorithm for binary CSPs

A self-adaptive differential evolution algorithm for binary ...

引用

作者： Fu, Hongjie Ouyang, Dantong Xu, Jiaming Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Computer Science and Technology Jilin Teachers Institute of Engineering and Technology Changchun 130052 China China Internet Network Information Center Beijing 100000 China

A novel self-adaptive differential evolution (SADE) algorithm is proposed in this paper. SADE adjusts the mutation rate F and the crossover rate CR adaptively, taking account of the different distribution of population. In order to balance an individual's exploration and exploitation capability for different evolving phases, F and CR are equal to two different self-adjusted nonlinear functions. Attention is concentrated on varying F and CR dynamically with each generation evolution. SADE maintains the diversity of population and improves the global convergence ability. It also improves the efficiency and success rate and avoids the premature convergence. Simulation and comparisons based on test-sets of CSPs demonstrate the effectiveness, efficiency and robustness of the proposed algorithm. © 2011 Elsevier Ltd. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A heuristic genetic process mining algorithm

A heuristic genetic process mining algorithm

引用

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

作者： Li, Jiafei Ouyang, Jihong Liu, Jiafei Ouyeng, Jihong Feng, Mingyong Department of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Industry Applications Department Cattsoft Technology Co. Ltd. Beijing China

ISBN: (纸本)9780769545844

The current GPM algorithm needs many iterations to get good process models with high fitness which makes the GPM algorithm usually time-consuming and sometimes the result can not be accepted. To mine higher quality model in shorter time, a heuristic solution by adding log-replay based crossover operator and direct/indirect dependency relation based mutation operator is put forward. Experiment results on 25 benchmark logs show encouraging results. © 2011 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Image annotation refinement using dynamic weighted voting based on mutual information

Journal of Software

引用

Journal of Software 2011年第11 SPEC. ISSUE期6卷 2239-2246页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention recently. In this paper, a novel refinement algorithm using dynamic voting based on mutual information is proposed. Unlike the traditional refinement algorithm, the proposed algorithm adopts dynamic weighted voting to measure the dependence between the candidate annotations, which not only permits that the annotations with higher probabilities deny the annotations with lower probabilities, but also permits that the annotations with lower probabilities deny the annotations with higher probabilities. The proposed refinement algorithm adopts progressive method instead of iterative, which can significantly decrease the time cost of refining annotations. In order to further improve efficiency without sacrificing precision, we propose the block-based normalized cut algorithm to segment image. Experiments conducted on standard Washington Ground Truth Image Database demonstrate the effectiveness and efficiency of our proposed approach for refining image annotations. © 2011 ACADEMY PUBLISHER.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Operon Prediction by Markov Clustering

Operon Prediction by Markov Clustering

引用

2011·国际基因组学大会

作者： Wei Du Zhongbo Cao Yan Wang Enrico Blanzieri Chen Zhang Yanchun Liang College of Mathematics Jilin University Changchun 130012 China Department of Information and Communication Technology University of Trento Povo 38050 Italy College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：