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

Recognizing the agent's goals incrementally:planning graph as a basis

中国高等学校学术文摘·计算机科学 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 problem of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the problem of acquisition and hand-coding a larger plan *** paper is aims to show that modern planning techniques can help build plan recognition systems without suffering such ***,we show that the planning graph,which is an important component of the classical planning system Graphplan,can be used as an implicit,dynamic planning library to represent actions,plans and *** also show that modern plan generating technology can be used to find valid plans in this *** this sense,this method can be regarded as a bridge that connects these two research *** and theoretical results also show that the method is efficient and scalable.

关键词： Graphplan plan recognition constraints automated planning

来源：评论

学校读者我要写书评

暂无评论

Inference and learning in hybrid probabilistic 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 hybrid probabilistic network,which is a good tradeoff between the model complexity and learnability in *** relaxes the conditional independence assumptions of Naive Bayes while still permitting efficient inference and *** studies on a set of natural domains prove its clear advantages with respect to the generalization ability.

关键词： hybrid probabilistic network conditional independence assumption Bayesian network probabilistic neural network

来源：评论

学校读者我要写书评

暂无评论

Learning hybrid Bayesian network based on divide and conquer strategy

引用

Journal of computational Information Systems 2007年第2期3卷 583-588页

作者： Wang, Limin Xu, Peijuan Li, Xiongfei Li, Xiaolin Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China

We augment Naive Bayes models by using divide and conquer strategy to address shortcomings of the standard Naive Bayes text classifier. The result is a generalized Bayes classifier which allows for local dependence among feature subset;a model we refer to as the Augmented Naive Bayes (ANB) classifier. ANB relaxes the independence assumptions of Naive Bayes while still permitting efficient inference and learning. Experimental studies on a set of natural domains show that ANB has clear advantages with respect to the generalization ability.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Geometric constraint solving using PACAO

引用

Journal of computational Information Systems 2007年第2期3卷 423-428页

作者： Yuan, Hua Li, Wenhui Yi, Rongqin Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China School of Computer Science and Engineering Changchun University of Technology Changchun 130012 China

Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical cubes according to a predefined threshold value, the tangent planes and normal vectors at each voxel are calculated and the normal vectors are orientated to the outside of surface based on wide first searching (WFS), and the 3D surface model is then obtained using marching cubes. Transfer function is used to specify the optical properties for volume rendering technology. We employ a 2D function. The end-user interacts with a set of direct manipulation widgets (triangles and rectangles). Each widget precisely corresponds to a different material and widgets are blended automatically to compute an overall transfer function. Compared to traditional techniques, the overall specification process takes a fraction of the time.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

Hilbert-huang transform-based local regions descriptors

Hilbert-huang transform-based local regions descriptors

引用

2007 18th British Machine Vision Conference, BMVC 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 based on Hilbert-Huang Transform. The neighborhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic mode functions (IMFs). Then the Hilbert 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-bin orientation histograms. The experiments show that the proposed descriptors are better than SIFT and other standard descriptors. Essentially, the Hilbert-Huang Transform based descriptors can belong to the class of phase-based descriptors. So it can provides a better way to overcome the illumination changes. Additionally, the Hilbert-Huang transform is a new tool for analyzing signals and the proposed descriptors is a new attempt to the Hilbert-Huang transform.

关键词： Hilbert-Huang transform

来源：评论

学校读者我要写书评

暂无评论

Prewavelets with finite decomposition and finite reconstruction

引用

Journal of Information and computational Science 2007年第1期4卷 35-41页

作者： Guan, Yujing Li, Ying Jiang, Zhengyi Institute of Mathematics Jilin University Changchun 130021 China State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing 100084 China College of Computer Science and Technology Jilin University Changchun 130021 China Key Laboratory of Symbol Computation and Knowledge Engineering Changchun 130021 China

The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} is shift-orthogonal if there exist prewavelets with finite decomposition and finite reconstruction, i.e., non-trivial prewavelets with finite decomposition and finite reconstruction does not exist. As an example, when r = 2 we construct a prewavelet with finite decomposition and finite reconstruction where the scale function is not shift-orthogonal, which demonstrate that there exist vector prewavelets with finite decomposition and finite reconstruction.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

An improved ant colony optimization algorithm based on route optimization and its applications in travelling salesman problem

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

引用

7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE

作者： 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, by 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 number of routing in the ACO but also surpasses existing algorithms in performance in solving large-scale TSP problems. In the second improvement, we introduce individual variation to ACO, by which the ants have different routing strategies. Simulation results show that the speed of convergence of ACO algorithm could be enhanced greatly. ©2007 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A new simplification method for terrain model using discrete particle swarm optimization 07

A new simplification method for terrain model using discrete...

引用

Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems

作者： Zhang, Huijie Sun, Jigui Liu, Jin Lv, Nan College of Computer Science and Technology Jilin University NorthEast Normal University Changchun China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering Changchun China College of Computer Science and Technology Jilin University Changchun China

ISBN: (纸本)9781595939142

In this paper, we put forward a fast simplification method for the terrain model by integrating the discrete particle swarm optimization with the hierarchical structure. In this method, each particle is represented as a hierarchical structure and corresponds to a candidate solution of the simplified terrain model. In order to acquire an optimal simplified model, we proposed a new model error evaluation function based on the terrain features. Thereby the terrain model yielded by this method has high self-adaptability and optimal simplification ratio. Furthermore, the velocity of the particle is redefined as the probability of the model being simplified superiorly. Therefore, the particles can converge to the optimal simplified model rapidly. The experimental results performed on benchmark terrain data show that the efficiency and the precision of our algorithm are improved greatly and the detailed features in the simplified model are preserved, compared with the others common simplification method. © 2007 ACM.

关键词： Landforms

来源：评论

学校读者我要写书评

暂无评论

A Method of Gene-Function Annotation Based on Variable Precision Rough Sets

引用

Journal of Bionic 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 bioinformatics to apply computer to perform the function annotation for new sequenced bio-sequences. Based on GO database and BLAST program, a novel method for the function annotation of new biological sequences is presented by using the variable-precision rough set theory. The proposed method is applied to the real data in GO database to examine its effectiveness. Numerical results show that the proposed method has better precision, recall-rate and harmonic mean value compared with existing methods.

关键词： gene function annotation variable precision rough set GO BLAST

来源：评论

学校读者我要写书评

暂无评论

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 Bioinformatics and Biomedical engineering, ICBBE

作者： Pei, Zhili Kong, Ying Shi, Xiaohu Lian, Zhichao Tang, Xuning Liu, Lisha Cao, Zhongbo 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 by 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 by analyzing SNP genotype frequency is effective. The accuracy of the adopted processing method is also shown by the simulation results. About the origination of modern human being, 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：