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

The Discretization for a Special Class of Ideal Projectors

International Scholarly Research Notices 2012年第1期2012卷

作者： Zhe Li Shugong Zhang Tian Dong Department of Applied Mathematics School of Science Changchun University of Science and Technology Changchun 130022 *** Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) School of Mathematics Jilin University Changchun 130012 ***

We focus on a special class of ideal projectors, subspaces, which possesses two classes of D -invariant polynomial subspaces. The first is a classical type, while the second is a new class. With matrix computation, we...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ordering heuristic for solving algorithm based on the AC-4 algorithm

Ordering heuristic for solving algorithm based on the AC-4 a...

引用

2011 International Conference on Transportation, Mechanical, and Electrical engineering, TMEE 2011

作者： Wang, Tao Du, Hui-Ying Li, Zhan-Shan Xing, Shi-Mei School of Computer Science and Engineering Changchun University of Technology Changchun China School of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781457717017

We have studied the AC-4 algorithm and then present ordering heuristic forming the new solving algorithm based on the data structure used in the AC-4 algorithm. These algorithms take full advantage of the state information of the data structure or the information kept recorded in data structure after the process of arc consistency. According to the heuristic information, we sort the values of the variables' domain. So that, we can force the solving algorithm to give priority to extend the values of variables, which have more heuristic information. In this way, the efficiency of the solving algorithm can be improved a lot. The result of our experiments shows that the algorithm, which has been interleaved with ordering heuristic, has much more advantage over the other solving algorithms. © 2011 IEEE.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

A new feature selection method based on clustering

A new feature selection method based on clustering

引用

2011 8th International Conference on Fuzzy Systems and knowledge Discovery, FSKD 2011, Jointly with the 2011 7th International Conference on Natural Computation, ICNC'11

作者： Liu, Huawen Mo, Yuchang Wang, Jiyi Zhao, Jianmin Department of Computer Science Zhejiang Normal University Jinhua 321004 China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China School of Computer Science and Engineering Southeast University Nanjing 211189 China

ISBN: (纸本)9781612841816

Feature selection is an effective technique to put the high dimension of data down, which is prevailing in many application domains, such as text categorization and bio-informatics, and can bring many advantages, such as improving efficiency and avoiding over-fitting, to learning algorithms. Currently, many efforts have been attempted in this field and various feature selection methods have been developed and proved to be very competitive. Unlike other selection methods, in this paper we propose a new method to select important features using a manner of feature clustering. The main character of our method is that it works like data clustering in an agglomerative way. In this method, each feature is considered as a data point clustered with between-cluster and within-cluster distances. As a result, the selected feature subset has minimal redundancy among its members and maximal relevance with the class labels. Our performance evaluations on seven benchmark datasets show that the classification performance achieved by our proposed method is better than other feature selection methods. © 2011 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A novel method for RNA secondary structure prediction

A novel method for RNA secondary structure prediction

引用

2011 7th International Conference on Natural Computation, ICNC 2011

作者： Xing, Chong Ji, Zhaohua Wang, Gang Wang, Yao Shen, Wei Liang, Yanchun Key Laboratory for Symbol Computation and Knowledge Engineering of National Education MinistryCollege of Computer Science and TechnologyJilin University Changchun China College of Information Engineering Guanghua College of Changchun University Changchun China College of Communications Engineering Jilin University Changchun China

ISBN: (纸本)9781424499533

In this paper, we propose PSOfold, a particle swarm optimization for RNA secondary structure prediction. PSOfold is based on the recently published IPSO. We present two strategies to improve the performance of IPSO. Firstly, in order to boost the competence in searching an optimal solution, fuzzy logic control is used to adaptively adjust the parameters in PSO. Accordingly, three fuzzy logic controls are designed by which the inertia weight, learning factors and the number of ants are tuned respectively. Secondly, to further settle the stem permutation problem, we put forward a solution conversion strategy (SCS), which can transform discrete values of stems into an ordered stem combination, thereby supplying an enhanced solution to evaluation of objective function. An evaluation of the performance of PSOfold in terms of prediction accuracy is made via comparison with one dynamic programming algorithm mfold and four metaheuristics, IPSO, ACRNA, RnaPredict, SARNA-Predict and mfold for ten individual known structures. PSOfold is able to predict structures with higher prediction accuracy than the other metaheuristic based methods on certain sequences, and has comparable performance compared with mfold. © 2011 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Parallel Aggregation Queries over Star Schema: A Hierarchical Encoding Scheme and Efficient Percentile Computing as a Case

Parallel Aggregation Queries over Star Schema: A Hierarchica...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Xiongpai Qin Huiju Wang Xiaoyong Du Shan Wang Ministry of Education Key Laboratory of Data Engineering and Knowledge Engineering RUC Beijing China School of Information Renmin University of China Beijing China

Big data analysis is a main challenge we meet recently. Cloud computing is attracting more and more big data analysis applications, due to its well scalability and fault-tolerance. Some aggregation functions, like SUM, can be computed in parallel, because they satisfy distributive law of addition. Unfortunately, some of statistical functions are not naturally parallelizable. That means they do not satisfy distributive law of addition. In this paper, we focus on percentile computing problem. We proposed an iterative-style prediction-based parallel algorithm in a distributed system. Prediction is done through a sampling technique. Experiment results verify the efficiency of our algorithm.

关键词： Prediction algorithms Convergence Algorithm design and analysis Histograms Encoding Query processing Indexes

来源：评论

学校读者我要写书评

暂无评论

A software cascading faults model

引用

Science China(Information Sciences) 2011年第11期54卷 2454-2458页

作者： LIU YanHeng 1,2,LIU XueLian 3 & WANG Jian 1,2 1 key laboratory of Symbolic Computation and knowledge engineering of ministry of education,Jilin University,Changchun 130012,China 2 College of Computer Science and Technology,Jilin University,Changchun 130012,China 3 College of Software,Jilin University,Changchun 130012,China 1. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China2. College of Computer Science and Technology Jilin University Changchun 130012 China3. College of Software Jilin University Changchun 130012 China

Functions and call relations are extracted into nodes and edges,respectively,by which a novel topological model is *** directional edges and the corresponding weight values express the call relations and tightness *** introducing two concepts of function fault-tolerant capability and software fault intensity and by designing a allocation rule on fault-tolerant capability,a cascading fault model is built to explore fault propagation *** on practical software networks show that a weak fault intensity,a small number of initial faults,and a strong fault-tolerant capability can slow down the spreading *** functions with more call relations and more closer tightness contribute more to the stability of the whole system.

关键词： software fault tolerant cascading faults fault-tolerant capability fault intensity

来源：评论

学校读者我要写书评

暂无评论

Discovering Chinese Compound Term Using Termhood and Unithood Measures

Discovering Chinese Compound Term Using Termhood and Unithoo...

引用

ChinaGrid Annual Conference (ChinaGrid)

作者： Jingjing Kang Tao Liu He Hu Xiaoyong Du Key Laboratories of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China

Domain terms play a crucial role in many research areas, which has led to a rise in demand for automatic domain terms extraction. In this paper, we present a two-level evaluation approach based on term hood and unit hood to extract Chinese domain compound terms automatically, which takes the character-level and word-level information into account. To achieve this, we incorporate semantic features by using the word segmentation to recognize single word terms, then leverage the improved C-value and heuristic methods such as word formation pattern and word formation power to evaluate candidates at both levels. By validating our approach with several existing dictionaries, a significant improvement of compound terms detection is achieved. Experiments in legal corpus show our method is superior over other compared methods.

关键词： Compounds Semantics Arrays Feature extraction Filtering Dictionaries Pragmatics

来源：评论

学校读者我要写书评

暂无评论

Disassembling and Reconstructing Algorithms for Discrete Event Systems

Disassembling and Reconstructing Algorithms for Discrete Eve...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Xuena Geng Dantong Ouyang Jinsong Guo Xiaoyu Wang Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University Changchun China

This paper addresses the problem of failure diagnosis in component-based discrete event systems. In this paper we propose a method to obtain the set of components when dealing with diagnosis in large complex discrete event systems. In the new method, before disassembling the system into components, we need to identify whether insert communication events into the system or not. When analyzing the diagnosability, we treat the system containing communication events as a distributed discrete event system. Otherwise we treat the system as a decentralized discrete event system. For the components which are not diagnosable, we propose a method to reconstruct them by utilizing some other components sharing the same communication events with them. This algorithm provides more accurate information of the diagnosability of the system.

关键词： Discrete event systems Synchronization Refining Algorithm design and analysis Testing Merging Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

图形处理器加速的联机分析处理系统

图形处理器加速的联机分析处理系统

引用

第29届中国数据库学术会议

作者： Fang Yixuan 方艺璇刘虹 Liu Hong Chen Hong 陈红 Li Cuiping 李翠平 Zhang Yansong 张延松 Zhao Suyun 赵素云 Chen Jie 陈杰辛鑫 Xin Xin Zhang Ji 张吉 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Ministry 数据工程与知识工程教育部重点实验室(中国人民大学) 北京100872 中国人民大学信息学院北京100872 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Ministry 数据工程与知识工程教育部重点实验室(中国人民大学) 北京100872 中国人民大学中国调查与数据中心北京100872

基于现有联机分析处理系统(online analytical processing,OLAP)的不足和图形处理器(graphics processing unit,GPU)的发展,研制了GOOLAP(GPU oriented OLAP)系统.GOOLAP系统利用GPU的高并行性和高存储带宽,把计算密集型运算转移到GPU端执行,加运OLAP处理性能.GOOLAP系统主要由3部分组成：1)表示层,以Excel作为用户输入前端并展示结果,加强系统的易用性;2)OLAP服务器层,负责把多维表达式(multi-dimensional expression,MDX)语句解析成SQL语句并根据自定义启发式规则向GPU传递适合计算的SQL语句,最后再将GPU返回结果与CPU原始结果合并;3)存储层,提供GPU显存和关系数据库两种存储结构.

关键词：图形处理器联机分析处理系统优化设计功能模块

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：