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

International Conference on Computer Science and Software engineering

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

ISBN: (纸本)9781424439027

The e-commerce information on the surface Web is supported by the Deep Web, which can not be accessed directly by the search engines or the Web crawlers. The only way to access the backend database is through query interface. Extracting valid attributes from the query forms and automatic translating the source query into a target query is a solvable way for addressing the current limitations in accessing Deep Web data sources. To generate a valid query, we have to reconcile the key attributes and their semantic relation. We present our framework to solve the problem. To enrich the set of attributes contained in the semantic form, we use the WordNet as kinds of ontology technique and we try to find the semantic relation of the attributes in the same query from and different forms. Extensive experiments over real-word domains show the utility of our query translation framework.

关键词： Ontologies Databases Computer science Educational institutions Search engines Data mining Laboratories knowledge engineering Computer science education Crawlers

来源：评论

学校读者我要写书评

暂无评论

Aggregation tree constructing algorithm based on energy consumption assessment

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2008年第1期45卷 104-109页

作者： Sun, Dayang Liu, Yanheng Wang, Aimin College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China College of Computer Science and Technology Harbin Engineering University Harbin 150001 China

This paper first gives an analysis of data aggregation and data compression based on energy consumption of sensor nodes, after which an approach is proposed to construct an aggregation tree in the case of non-perfect aggregation, since GIT considers only the case of perfect aggregation and it does not work well if the aggregation is non-perfect. An assessment scheme that can get the information of hops from the aggregation point to the sink and the hops from the aggregation point to the source node is used to construct such an aggregation tree. Moreover, the energy consumption of the aggregation is also considered. This scheme can be used when perfect aggregation cannot be performed. In this paper, an approach to reduce the cost of reinforcement is also proposed, in which the reinforcement work is done by the source nodes themselves, not by the sink node. Simulation result shows that this approach can save more energy than GIT when the aggregation ratio is small. This result also provides a theoretical limit of aggregation to tell when GIT will lose its superiority and thus gives a direction to choose among the aggregation algorithms. Another result shows that the further the sources are away from the sink, the less reinforcement messages are needed. Finally a guidance to tell when to use the EGA (energy consumption assessment) scheme is given.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Clustering Algorithm for Mining Communities in Signed Networks

引用

Journal of Computer Science & Technology 2007年第2期22卷 320-328页

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

Signed network is an important kind of complex network, which includes both positive relations and negative relations. Communities of a signed network are defined as the groups of vertices, within which positive relations are dense and between which negative relations are also dense. Being able to identify communities of signed networks is helpful for analysis of such networks. Hitherto many algorithms for detecting network communities have been developed. However, most of them are designed exclusively for the networks including only positive relations and are not suitable for signed networks. So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. In this paper, we propose a heuristic algorithm to address this issue. Compared with major existing methods, our approach has three distinct features. First, it is very fast with a roughly linear time with respect to network size. Second, it exhibits a good clustering capability and especially can work well with complex networks without well-defined community structures. Finally, it is insensitive to its built-in parameters and requires no prior knowledge.

关键词： complex network signed network community clustering graph theory

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm with local search for advanced planning and scheduling

Genetic algorithm with local search for advanced planning an...

引用

3rd International Conference on Natural Computation, ICNC 2007

作者： Pu, Yan Dayou, Liu Donghui, Yuan Ji, Yu Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)0769528759

In this paper, a genetic algorithm approach with a novel mutation operator based on perturbation and local search has been proposed to solve an advanced planning and scheduling (APS) model in manufacturing supply chain, in which each customer order has a due date, each operation could be performed on alternative machines. The objective is to minimize the makespan of each customer order while ensuring the due date constraints. Various sizes of numerical experiments were carried out to demonstrate the efficiency of the proposed GA and the results indicate that the presented algorithm performs much better than previous work especially in large size problems. © 2007 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Complex knowledge system modeling based on Hierarchical Fuzzy Petri Net

Complex knowledge system modeling based on Hierarchical Fuzz...

引用

2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007

作者： Hongjun, Pan Jigui, Sun Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0769530281

The difficulties of modeling complex knowledge system lie in a large quantity of knowledge rules and the difficulty in organizing rules and grasping their mutual logical relationships. This article proposed a concept of hierarchical fuzzy Petri nets (HFPN), which is more suitable for modeling complex knowledge system than other fuzzy Petri Net models. In addition, the concepts of abstract place and abstract transition in HFPN are allowed to describe and analyze the knowledge system at diverse abstract levels. Therefore, using HFPN, the iterative and incremental methods can be applied to modeling complex knowledge system. In addition, structured approach can be naturally applied to the process of modeling knowledge system. © 2007 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Flexible planning using fuzzy description logics

Flexible planning using fuzzy description logics

引用

2007 International Conference on Artificial Intelligence, ICAI 2007

作者： Shi, Lian Sun, Jigui Lu, Shuai Yin, Minghao College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China

ISBN: (纸本)9781601320254

Description Logics are formalisms for representing knowledge of various domains in a structured and formally well-understood way. Typically, DLs are limited to dealing with precise and well defined concepts. In this paper we first present a fuzzy extension of ALC and define its syntax and semantics. Then we devote to taking advantage of the expressive power and reasoning capabilities of fuzzy ALC by encoding flexible planning problems within the framework of fuzzy ALC. Both theory and experimental results have shown that our method is sound and efficient.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Combinative reasoning with RCC5 and cardinal direction relations

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： Juan, Chen Dayou, Liu Changhai, Zhang Qi, Xie College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9783540767183

It is inadequate considering only one aspect of spatial information in practical problems, where several aspects are usually involved together. Reasoning with multi-aspect spatial information has become the focus of qualitative spatial reasoning. Most previous works of combing topological and directional information center on the combination with MBR based direction model or single-tile directions. The directional description is too approximate to do precise reasoning. Different from above, cardinal direction relations and RCC5 are introduced to represent directional and topological information. We investigate the mutual dependencies between basic relations of two formalisms, discuss the heterogeneous composition and give the detail composing rules. Then point out that only checking the consistency of topological and directional constraints before and after entailing by the constraints of each other respectively will result mistakes. Based on this, an improved constraint propagation algorithm is presented to enforce path consistency. And the computation complexities of checking the consistency of the hybrid constraints over various subsets of RCC5 and cardinal direction relations are analyzed at the end. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Information analysis

来源：评论

学校读者我要写书评

暂无评论

A model for representing topological relations between simple concave regions

A model for representing topological relations between simpl...

引用

7th International Conference on Computational Science, ICCS 2007

作者： Jihong, OuYang Qian, Fu Dayou, Liu College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9783540725831

At present, qualitative spatial reasoning has become the hot issues in many research fields. The most popular models of spatial topological relations are Region Connection Calculus (RCC) and 9-intersection model. However, there are few contributions on topological relations of concave regions in which the representative model is Cohn's RCC23. There are some limitations of RCC23 especially in practical applications due to its less expressiveness. In order to construct a more expressive model of topological relations between concave regions, this paper completed the following works: 9-intersection matrix is extended to 16-intersection matrix, and RCC23 is refined to RCC62 based on 16-intersection matrix. More relations can be distinguished in RCC62, which is more expressive than RCC23. In order to further reason about relations in RCC62, the Conceptual Neighborhood Graph (CNG) and the Closest Topological Relation Graph (CTRG) of RCC62 are given. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Cardinal direction relations in 3D space

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： Juan, Chen Dayou, Liu Haiyang, Jia Changhai, Zhang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9783540767183

The existing 3D direction models approximate spatial objects either as a point or as a minimal bounding block, which decrease the descriptive capability and precision. Considering the influence of object's shape, this paper extends the planar cardinal direction (CD) into 3D space and obtains a new model called TCD (three-dimensional cardinal direction). Base on the smallest cubic TCD relations and original relations, explain the correlations between basic TCD relations and block algebra. Then according to the results in block algebra, two novel ways to compute the inverse and composition of basic TCD relations are proposed. And an O(n4) algorithm to check the consistency of a set of basic TCD constraints over simple blocks is given. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Fuzzy neural network structure identification based on soft competitive learning

引用

International Journal of Hybrid Intelligent Systems 2007年第4期4卷 231-242页

作者： Tian, Daxin Liu, Yanheng Wang, Jian College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University 130012 China

Fuzzy neural network combines the learning capacity of artificial neural networks with the interpretability of the fuzzy systems. A novel structure learning algorithm for fuzzy neural networks (SLNN) is presented in this paper. The neurons of SLNN are created and adapted as online learning proceeds. The learning rule of SLNN is based on Hebb as well as soft competitive learning. The soft competitive learning cannot only let SLNN be able to learn from new data but also prevent it from losing the knowledge that has been learned earlier. To obtain a concise fuzzy rule, a pruning algorithm is adopted in SLNN, which does not disobey the basic design philosophy of fuzzy system. Simulations are performed on the primary benchmarks: circle-in-the-square, two spirals apart, UCI machine learning archive's synthetic control chart time series, and KDDCUP'99 data set. Compared with fuzzy ARTMAP, BP and hierarchical neuro-fuzzy quadtree (HNFQ), the fuzzy neural network achieves higher performance.

关键词： Fuzzy neural network hebb rule competitive learning local learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：