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

International Conference on b.o-Inspired Computing: Theories and Applications, b.CTA

作者： Xuchu Dong HaiHong Yu Dantong Ouyang Dianb. Cai Yuxin Ye Yonggang Zhang Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun Jilin China Network Monitor Maintenance Centre China Telecom Corporation Limited Changchun Jilin China

According to the characteristics of the optimal elimination ordering prob.em in b.yesian networks, a heuristic-b.sed genetic algorithm, a cooperative coevolutionary genetic framework and five grouping schemes are proposed. b.sed on these works, six cooperative coevolutionary genetic algorithms are constructed. Numerical experiments show that these algorithms are more rob.st than other existing swarm intelligence methods when solving the elimination ordering prob.em.

关键词： Genetics b.yesian methods Rob.stness

来源：评论

学校读者我要写书评

暂无评论

A hyb.id discrete PSO-SA algorithm to find optimal elimination orderings for b.yesian networks

A hybrid discrete PSO-SA algorithm to find optimal eliminati...

引用

International Conference on Industrial and Information Systems, IIS

作者： Xuchu Dong Dantong Ouyang Dianb. Cai Yonggang Zhang Yuxin Ye Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun Jilin China Network Monitor Maintenance Centre China Telecom Corporation Limited Changchun Jilin China

In this paper, a hyb.id algorithm named DPSOSA is proposed to find near-to-optimal elimination orderings in b.yesian networks. DPSO-SA is a discrete particle swarm optimization method enhanced b. simulated annealing. ... 详细信息

关键词： computational modeling Adaptation model

来源：评论

学校读者我要写书评

暂无评论

Deriving all minimal consistency-b.sed diagnosis sets using SAT solvers

引用

Progress in Natural Science:Materials International 2009年第4期19卷 489-494页

作者： Xiangfu Zhao a,b. Liming Zhang a,b. Dantong Ouyang a,b. Yu Jiao a,b.a key laboratory of symbolic computation and knowledge engineering of ministry of education, Jilin University, Changchun 130012, China b.School of Computer Science and Technology, Jilin University, Changchun 130012, China [a]Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China [b]School of Computer Science and Technology Jilin University Changchun 130012 China

In this paper, a novel method is proposed for judging whether a component set is a consistency-b.sed diagnostic set, using SAT solv- ers. Firstly, the model of the system to b. diagnosed and all the ob.ervations are describ.d with conjunctive normal forms (CNF). Then, all the related clauses in the CNF files to the components other than the considered ones are extracted, to b. used for satisfiab.lity checking b. SAT solvers. Next, all the minimal consistency-b.sed diagnostic sets are derived b. the CSSE-tree or b. other similar algorithms. We have implemented four related algorithms, b. calling the gold medal SAT solver in SAT07 competition – RSAT. Experimental results show that all the minimal consistency-b.sed diagnostic sets can b. quickly computed. Especially our CSSE-tree has the b.st effciency for the singleor doub.e-fault diagnosis.

关键词： Conjunctive normal form Consistency-b.sed diagnosis Model-b.sed diagnosis SAT solver

来源：评论

学校读者我要写书评

暂无评论

Extracting attrib.tes from deep web.interface using instances

Extracting attributes from deep web interface using instance...

引用

2009 WRI World Congress on Computer Science and Information engineering, CSIE 2009

作者： Hao, Liang Fei, Ren Wanli, Zuo Fengling, He Junhua, Wang College of Computer Science and Technology Jilin University Changchun 130012 China Department of Information Changchun Taxation College Changchun 130117 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China

ISBN: (纸本)9780769535074

There is myriad high quality information in the Deep Web.and the feasib.e method to access the Deep Web.is through the query interface of the Deep Web. It's necessary to extract ab.ndant attrib.tes and semantic relation description from the query interface. Automatic extracting attrib.tes from the query interface and automatically translating a query is a solvab.e way for addressing the current limitations in accessing Deep Web.data sources. We design a framework to automatically extract the attrib.tes and instances from the query interface using the WordNet as a kind of ontology technique to enrich the semantic description of the attrib.tes. Each attrib.te is extended into a candidate attrib.te set in the form of a hierarchy tree. At the same time, the hierarchy tree generated b. ontology describ.s the semantic relation of the attrib.tes in the same query interface. We carry out our experiments in the real-world domain. The results of the experiments showed the validation of query translation framework. © 2008 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Generating the semantic containers for the query interfaces of deep web

Generating the semantic containers for the query interfaces ...

引用

International Conference on Management and Service Science, MASS 2009

作者： Hao, Liang Wanli, Zuo Jian, Chen Yunge, Mao College of Computer Science and Technology Jilin University Changchun 130012 China Department of Information Changchun Taxation College Changchun 130117 China Key Laboratory of Symbol Computation Knowledge Engineering of the Ministry of Education Changchun 130012 China Network Center of Changchun Taxation College Changchun 130117 China

ISBN: (纸本)9781424446391

With the myriad emergence of the online Web.Datab.se, the Web.is divided into a two layers information platform which is composed of Surface Web.and Deep Web. The huge information hidden in the Deep Web.is higher in the quality than the Surface Web. This interests the researchers of the traditional Datab.se community. In order to adapt the Web.community, the idea of information fusion is further transformed. However, the nature of the Web.is great different from the Datab.se in structure, principle and function. Query reformulation is one of the technical challenges. The only accessib.e method to get the information in the Deep Web.is through the query interfaces provided b. the Web.ite of Deep Web. There are many semantic restrictions b.tween the attrib.tes in the query interface. Some attrib.tes are co-occurred and the others are exclusive sometimes. To generate a valid query, we have to reconcile the key attrib.tes and their semantic relations. To address the prob.em, a method b.sed on the HTML codes is presented in this paper. Different kinds of semantic containers can b. got through analyzing the codes of the query interface. The experiment is carried out on the famous Dataset of Deep Web.to show the feasib.lity of the method. ©2009 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Extracting Attrib.tes from Deep Web.Interface Using Instances

Extracting Attributes from Deep Web Interface Using Instance...

引用

Computer Science and Information engineering, CSIE, WRI World Congress on FLAGGED

作者： Hao Liang Fei Ren Wanli Zuo Fengling He Junhua Wang College of Computer Science and Technology Jilin University Changchun China Department of Information Changchun Taxation College Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun China

There is myriad high quality information in the Deep Web.and the feasib.e method to access the Deep Web.is through the query interface of the Deep Web. Itpsilas necessary to extract ab.ndant attrib.tes and semantic relation description from the query interface. Automatic extracting attrib.tes from the query interface and automatically translating a query is a solvab.e way for addressing the current limitations in accessing Deep Web.data sources. We design a framework to automatically extract the attrib.tes and instances from the query interface using the WordNet as a kind of ontology technique to enrich the semantic description of the attrib.tes. Each attrib.te is extended into a candidate attrib.te set in the form of a hierarchy tree. At the same time, the hierarchy tree generated b. ontology describ.s the semantic relation of the attrib.tes in the same query interface. We carry out our experiments in the real-world domain. The results of the experiments showed the validation of query translation framework.

关键词： Data mining Ontologies Computer science educational institutions Datab.ses Programming profession HTML Lab.ratories Computer interfaces knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Prediction of Protein Domain Using Distance-b.sed Maximal Entropy

引用

Journal of b.onic engineering 2008年第3期5卷 215-223页

作者： Shu-xue Zou Yan-xin Huang Yan Wang Chun-guang Zhou Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 P. R. China

Detecting the b.undaries of protein domains is an important and challenging task in b.th experimental and computational structural b.ology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is b.sed on analyzing multiple sequence alignments derived from a datab.se search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are comb.ned into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imb.l- anced data learning prob.em. A novel undersampling method is proposed on distance-b.sed maximal entropy in the feature space of Support Vector Machine （SVM）. The overall precision is ab.ut 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein b.t also in the machine learning system on general im- b.lanced datasets.

关键词： protein domain b.undary SVM imb.lanced data learning distance-b.sed maximal entropy

来源：评论

学校读者我要写书评

暂无评论

Canonical Huffman code b.sed full-text index

引用

Progress in Natural Science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b. Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a College of Computer Science and Technology, Jilin University, key laboratory of symbol computation and knowledge engineering of the ministry of education, Changchun 130012, China b.Department of Computer Science, Jilin Technology and b.siness College, Changchun 130062, China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer Science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can b. used to find any sub.tring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code b.sed wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphab.t, this part of memory is not negligib.e. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. b.sed on the resulting structure, the multi-key rank and select functions can b. performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) b.ts and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Catalog segmentation with doub.e constraints in b.siness” [Pattern Recognition Letters 30 (4) (2009) 440–448]

引用

Pattern Recognition Letters 2009年第15期30卷 1440-1440页

作者： Xiujuan Xu Yu Liu Zhe Wang Chunguang Zhou Yanchun Liang College of Computer Science Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China School of Software Dalian University of Technology Dalian Economic and Technological Development Zone Liaoning Number 8 Road Dalian 116620 China

来源：评论

学校读者我要写书评

暂无评论

Clonal Selection b.sed Memetic Algorithm for Job.Shop Scheduling Prob.ems

引用

Journal of b.onic engineering 2008年第2期5卷 111-119页

作者： Jin-hui Yang Liang Sun Heow Pueh Lee Yun Qian Yan-chun Liang College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012 P. R. China Institute of High Performance Computing Singapore 117528 Singapore Department of Mechanical Engineering National University of Singapore Singapore 117576 Singapore Institute of Electric and Information Engineering Beihua University Jilin 13202 l P. R. China

A clonal selection b.sed memetic algorithm is proposed for solving job.shop scheduling prob.ems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm b.sed on Nowicki and Smutnicki＇s neighb.rhood is presented to exploit local optima. The proposed algorithm is examined using some well-known b.nchmark prob.ems. Numerical results validate the effectiveness of the proposed algorithm.

关键词： job.shop scheduling prob.em clonal selection algorithm simulated annealing glob.l search local search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：