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

Mini-conflict repair based algorithm for solving dynamic constraint satisfaction problems

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2007年第12期44卷 2078-2084页

作者： Sun, Jigui Gao, Jian Zhang, Yonggang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Constraint satisfaction problems (CSPs) is an important research branch in artificial intelligence. Recently, dynamic CSP is proposed as a powerful tool for solving many real-world problems on dynamic environments. As a result, several algorithms to solve dynamic CSPs are presented. Among those algorithms, local change (LC) algorithm based on solution reuse strategy is a method for solving many kinds of dynamic CSPs and efficient for flexible planning. On the basis of LC algorithm which is widely used, the tabu search strategy is integrated and a mini-conflict repair based algorithm is proposed, which is called Tabu_LC. The improved algorithm considers all the conflict variables as a whole, and then solves the sub-problems with branch and bound algorithm to find the best neighbor assignment, which improves the efficiency markedly. Furthermore, the Tabu_LC algorithm is implemented in the framework of constraint solving system Ming-yue 1.0, and compared with the LC algorithm using large amount of random CSPs. The experiment indicates that the improved algorithm has overwhelmed the LC algorithm on both the efficiency and quality of solutions.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 subdivide 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 basis of the connotative hierarchy, we focus on resolving the crack problem 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 robust. Besides, the seamless simplified model has less number of triangles than the other common algorithm.

关键词： Multiresolution analysis Educational institutions Intelligent agent Computer science Surface cracks Filling Conferences Acceleration Robustness Sun

来源：评论

学校读者我要写书评

暂无评论

Force-Based Incremental Algorithm for Mining Community Structure in Dynamic Network

引用

Journal of Computer Science & Technology 2006年第3期21卷 393-400页

作者：杨博刘大有 College of Computer Science and Technology & Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P.R. China

Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman＇s algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.

关键词： incremental algorithm community structure dynamic network

来源：评论

学校读者我要写书评

暂无评论

Text Categorization Method Based 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 by statistical methods can be 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 based on a modified mutual information algorithm and evaluation algorithm of characteristic weights which improves both aspects. The proposed method is applied to the benchmark 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

来源：评论

学校读者我要写书评

暂无评论

Research of mobile IPv6 application based on diameter protocol

Research of mobile IPv6 application based on diameter protoc...

引用

First International Multi- Symposiums on Computer and computational Sciences, IMSCCS'06

作者： Da, Wei Yanheng, Liu Xuegang, Yu Xiaodong, Li Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education China

ISBN: (纸本)0769525814

The Diameter protocol is recommended by IETF as AAA (Authentication, Authorization and Accounting) protocol criterion for the next generation network, Because the IPv6 protocol will be widely applied in the intending all-IP network, mobile IPv6 application based on Diameter protocol will play more important role in authentication, authorization and accounting. In this paper, the implementation of mobile node's authentication and authorization is presented with PANA (Protocol for carrying Authentication for Network Access) protocol. It is based on Diameter protocol for the application expansion of mobile IPv6, which provides the supports to the basic AAA process of mobile IPv6 nodes and dynamic Home Agent distribution in the visited network and the secret key distribution. Finally, the correctness of this application expansion is testified with developing the design of protocol based on OpenDiameter. © 2006 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Experimental study of the three key issues of multi-auctioneer model in computer grid

Experimental study of the three key issues of multi-auctione...

引用

18th IASTED International Conference on Parallel and Distributed Computing and Systems

作者： Han, Xiao Fang, Zhiyi Wang, Wanyu Xu, Fengyuan Huang, Mengzhou School of Economics and Information Systems School of Computer Science and Technology Key Laboratory Symbolic Computation and Knowledge Engineering Education Ministry

ISBN: (纸本)9780889866386

By means of introducing multi-auctioneer model, resources in the computational economic grid can be managed and allocated like in the auction. We research and put forward the corresponding solve schemes of three key issues of auctioneer system: preventing auctioneer from cheating, selection of auctioneer, setting of trading prices, and use computational grid modeling and simulation tools GridSim to simulate computational grid environment in the experiment which uses multiauctioneer system to manage and schedule, then we analyze the results of experiment in different conditions, and validate the feasibility of a multi-auctioneer system in computational grid.

关键词： computational economic grid multi-auction system election of auctioneer

来源：评论

学校读者我要写书评

暂无评论

Design for network camera based on DSP

Design for network camera based on DSP

引用

2006 International Conference on Hybrid Information Technology, ICHIT 2006

作者： Zhezhou, Yu Yuchen, Xie Congying, Lv Chunguang, Zhou Faner, Meng Lei, Liu Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0769526748

The hardware design of the DSP-based network camera is described in this paper which includes the implementation of CCD camera, DSP, Flash, SDRAM, CPLD, and Ethernet. The program of JPEG2000has been tested on the designed board and the result turns out to be good. It'll be implemented as a network camera with real-time video compression and transmission which can be connected to the Ethernet. © 2006 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Extracting initial and reliable negative documents to enhance classification performance 1

引用

PAKDD 2006 International Workshop on knowledge Discovery in Life Science Literature, KDLL 2006

作者： Wang, Hui Zuo, Wanli Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (数字)9783540328100

ISBN: (纸本)3540328092

Most existing text classification work assumes that training data are completely labeled. In real life, some information retrieval problems can only be described as learning a binary classifier from a set of incompletely labeled examples, where a small set of labeled positive examples and a very large set of unlabeled ones are provided. In this case, all of the traditional text classification methods can't work properly. In this paper, we propose a method called Weighted Voting Classifier, which is an improved 1-DNF algorithm. Experimental results on the Reuters-21578 set show that our algorithm Weighting Voting Classifier outperforms PEBL and one-class SVM in terms of F measure. Weighting Voting Classifier can achieve high F score when comparing with PEBL and one-class SVM. Furthermore, the reduction of iterations is 2.26 when comparing the method of PEBL with ours. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：