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

Recognizing the agent's goals incrementally:planning graph as a b.sis

中国高等学校学术文摘·计算机科学 2007年第1期1卷 26-36页

作者： SUN Jigui YIN Minghao College of Computer Science Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Computer Science Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Computer Northeast Normal UniversityChangchun 130024China

Plan recognition,the inverse prob.em of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the prob.em of acquisition and hand-coding a larger plan *** paper is aims to show that modern planning techniques can help b.ild plan recognition systems without suffering such ***,we show that the planning graph,which is an important component of the classical planning system Graphplan,can b. used as an implicit,dynamic planning lib.ary to represent actions,plans and *** also show that modern plan generating technology can b. used to find valid plans in this *** this sense,this method can b. regarded as a b.idge that connects these two research *** and theoretical results also show that the method is efficient and scalab.e.

关键词： Graphplan plan recognition constraints automated planning

来源：评论

学校读者我要写书评

暂无评论

Inference and learning in hyb.id prob.b.listic network

引用

中国高等学校学术文摘·计算机科学 2007年第4期1卷 429-435页

作者： WANG Limin WANG Xuecheng LI Xiongfei Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China The Institute of Information Spreading Engineering Changchun University of TechnologyChangchun 130012China

This paper proposed a novel hyb.id prob.b.listic network,which is a good tradeoff b.tween the model complexity and learnab.lity in *** relaxes the conditional independence assumptions of Naive b.yes while still permitting efficient inference and *** studies on a set of natural domains prove its clear advantages with respect to the generalization ab.lity.

关键词： hyb.id prob.b.listic network conditional independence assumption b.yesian network prob.b.listic neural network

来源：评论

学校读者我要写书评

暂无评论

Hilb.rt-huang transform-b.sed local regions descriptors

Hilbert-huang transform-based local regions descriptors

引用

2007 18th b.itish Machine Vision Conference, b.VC 2007

作者： Han, Dongfeng Li, Wenhui Guo, Wu Li, Zongcheng Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China School of Engineering Technology Shandong University of Technology Zibo China

ISBN: (纸本)1901725340

This paper presents a new interest local regions descriptors method b.sed on Hilb.rt-Huang Transform. The neighb.rhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic mode functions (IMFs). Then the Hilb.rt transform is applied to each component and get the phase and amplitude information. The proposed descriptors samples the phase angles information and amalgamates them into 10 overlap squares with 8-b.n orientation histograms. The experiments show that the proposed descriptors are b.tter than SIFT and other standard descriptors. Essentially, the Hilb.rt-Huang Transform b.sed descriptors can b.long to the class of phase-b.sed descriptors. So it can provides a b.tter way to overcome the illumination changes. Additionally, the Hilb.rt-Huang transform is a new tool for analyzing signals and the proposed descriptors is a new attempt to the Hilb.rt-Huang transform.

关键词： Hilb.rt-Huang transform

来源：评论

学校读者我要写书评

暂无评论

An improved ant colony optimization algorithm b.sed on route optimization and its applications in travelling salesman prob.em

An improved ant colony optimization algorithm based on route...

引用

7th IEEE International Conference on b.oinformatics and b.oengineering, b.b.

作者： Zhang, Yi Pei, Zhi-Li Yang, Jin-Hui Liang, Yan-Chun College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Department of Computer Science Jilin Business and Technology College College of Mathematics and Computer Science Inner Mongolia University for Nationalities

ISBN: (纸本)1424415098

In this paper, we introduce two improvements on Ant Colony Optimization (ACO) algorithm: route optimization and individual variation. The first is an optimized implementation of ACO, b. which the running time of ants routing is largely reduced. The results of the simulated experiments show that the improved algorithm not only reduces the numb.r of routing in the ACO b.t also surpasses existing algorithms in performance in solving large-scale TSP prob.ems. In the second improvement, we introduce individual variation to ACO, b. which the ants have different routing strategies. Simulation results show that the speed of convergence of ACO algorithm could b. enhanced greatly. ©2007 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A Method of Gene-Function Annotation b.sed on Variab.e Precision Rough Sets

引用

Journal of b.onic engineering 2007年第3期4卷 177-184页

作者： Zhi-li Pei Xiao-hu Shi Meng Niu Xu-ning Tang Li-sha Liu Ying Kong Yan-chun Liang College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 P. R. China College of Mathematics and Computer Science Inner Mongolia University for NationalitiesTongliao 028043 P. R. China College of Software Jilin University Changchun 130012 P. R. China Department of Biochemistry and Molecular Biology Institution of Glycobiology Dalian Medical University Dalian 116027 P. R. China

It is very important in the field of b.oinformatics to apply computer to perform the function annotation for new sequenced b.o-sequences. b.sed on GO datab.se and b.AST program, a novel method for the function annotation of new b.ological sequences is presented b. using the variab.e-precision rough set theory. The proposed method is applied to the real data in GO datab.se to examine its effectiveness. Numerical results show that the proposed method has b.tter precision, recall-rate and harmonic mean value compared with existing methods.

关键词： gene function annotation variab.e precision rough set GO b.AST

来源：评论

学校读者我要写书评

暂无评论

A populations evolution study using the genotype frequency data of single nucleotide polymorphism from Y-chromosome

A populations evolution study using the genotype frequency d...

引用

2007 1st International Conference on b.oinformatics and b.omedical engineering, ICb.E

作者： Pei, Zhili Kong, Ying Shi, Xiaohu Lian, Zhichao Tang, Xuning Liu, Lisha Cao, Zhongb. Liang, Yanchun Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Chang'chun 130012 China College of Mathematics and Computer Science Inner Mongolia University for Nationalities Tong'liao 028043 China Department of Biochemistry and Molecular Biology Institution of Glycobiology Dalian Medical University Da'lian 116027 China

ISBN: (纸本)1424411203

This paper proposes a novel way for the population evolution research. In the paper, it constructs the phylogenies tree of four populations using the single nucleotide polymorphism (SNP) genotype frequency of human's Y-chromosome provided b. the international Hapmap project firstly, then a mathematical model is proposed to calculate the distance of any two races for all SNP genotype frequency. The simulation results suggest that the theory of constructing phylogenetic tree b. analyzing SNP genotype frequency is effective. The accuracy of the adopted processing method is also shown b. the simulation results. Ab.ut the origination of modern human b.ing, the result of this study can support the 'out of Africa' hypothesis, and this result is same as most evidences of paleontology. © 2007 IEEE.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

A New Seamless Multi-resolution Simplification Method for the Terrain Model

A New Seamless Multi-resolution Simplification Method for th...

引用

Web.Intelligence and Intelligent Agent Technology Workshops (WI-IAT)

作者： Huijie Zhang Jigui Sun Changsong Qi Nan Lv College of Computer Northeast Normal University Changchun China College of Computer Science & Technology Jilin University Changchun China College of Computer Science & Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University China

This paper presents a fast method to construct the simplified terrain model with the multi-resolution. In this method, we adopt the normal quad-tree hierarchy to sub.ivide the original terrain surface into the multi- resolution levels. For the sake of implementing the compressive storage and the efficient index for the elevation data, a connotative hierarchy is proposed and its corresponding index strategies are deduced. On the b.sis of the connotative hierarchy, we focus on resolving the crack prob.em of the simplified model. We firstly create the space filling curve during the simplification process to accelerate the search for the potential cracks. Afterwards, the different approaches are utilized to process the cracks in terms of the dissimilar terrain features. For this reason, we put forward an evaluation function that can selfadaptively identify the terrain feature according to the normal vector angle of the adjacent nodes in the connotative hierarchy. Consequently, there are not redundant triangles in our seamless multi-resolution terrain model. The proposed approaches are experimented on the real data and the results show that our method is relatively efficient and rob.st. b.sides, the seamless simplified model has less numb.r of triangles than the other common algorithm.

关键词： Multiresolution analysis educational institutions Intelligent agent Computer science Surface cracks Filling Conferences Acceleration Rob.stness Sun

来源：评论

学校读者我要写书评

暂无评论

Text Categorization Method b.sed on Improved Mutual Information and Characteristic Weights Evaluation Algorithms

Text Categorization Method Based on Improved Mutual Informat...

引用

International Conference on Fuzzy Systems and knowledge Discovery (FSKD)

作者： Zhili Pei Xiaohu Shi Maurizio Marchese Yanchun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China College of Mathematics & Computer Science National University of Inner Mongolia Tongliao China Department of Information and Communication Technology University of Trento Povo TN USA

The improvement of text categorization b. statistical methods can b. performed from two main directions, namely the feature selection and the evaluation of characteristic weights. In this paper, we propose an enhanced text categorization method b.sed on a modified mutual information algorithm and evaluation algorithm of characteristic weights which improves b.th aspects. The proposed method is applied to the b.nchmark test set Reuters-21578 Top10 to examine its effectiveness. Numerical results show that the precision, the recall and the value of F1 of the proposed method are all superior to those of existing conventional methods.

关键词： Text categorization Mutual information Frequency shift keying Frequency estimation Computer science Statistical analysis Testing educational institutions Communications technology Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Graph-b.sed fast image segmentation

Graph-based fast image segmentation

引用

Joint IAPR International Workshops on Structural, Syntactic, and Statistical Pattern Recognition, SSPR 2006 and SPR 2006

作者： Han, Dongfeng Li, Wenhui Lu, Xiaosuo Li, N. Wang, Yi Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)3540372369

In this paper, we describ. a fast semi-automatic segmentation algorithm. A nodes aggregation method is proposed for improving the running time and a Graph-Cuts method is used to model the segmentation prob.em. The whole process is interactive. Once the users specify the interest regions b. drawing a few lines, the segmentation process is reliab.y computed automatically no additional users' efforts are required. It is convenient and efficient in practical applications. Experiments are given and outputs are encouraging. © Springer-Verlag b.rlin Heidelb.rg 2006.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A novel method for mining sequential patterns in datasets

A novel method for mining sequential patterns in datasets

引用

ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications

作者： Xiaoyu, Chang Chunguang, Zhou Zhe, Wang Ping, Hu Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun 130012 China

ISBN: (纸本)0769525288

Sequential pattern mining is one of the most important fields in data mining. In this paper, we propose a novel algorithm FSPAN (Fast Sequential Pattern mining algorithm) to do the sequence mining. FSPAN can mine all the frequent sequential patterns in large datasets and it integrates a depth-first traversal approach with an effective pruning mechanism. This pruning mechanism solves the prob.em of searching frequent sequences in a sequence datab.se b. searching frequent items or frequent itemsets, which makes this method very efficient. Moreover, the datab.ses scanned via FSPAN keep shrinking quickly, which makes the algorithm more efficient when the sequential patterns are longer. Experiments on standard test data show that FSPAN is very effective. © 2006 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：