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

IEEE Conference on Robotics, Automation and Mechatronics

作者： Xiangfu Zhao Dantong Ouyang School of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China

Hierarchy is a remedy way to reduce the demanding complexity of model-based diagnosis. In this paper, an approach to diagnosis of discrete-event systems in a hierarchical way is proposed, inspired by the concept "D-holon" and the concept "Silent Closure" presented in the literatures recently. Each extended silent closure can be seen as a special type of D-holons, called SCL-D-holon. Every hierarchical level is an SCL-D-holon built off line. When on line diagnosing a discrete-event system, only related SCL-D-holons will be called instead of all the SCL-D-holons generally, thus the space complexity is reduced. In comparison to on line creating silent closures, the efficiency is improved as well.

关键词： Discrete event systems Fault diagnosis Computer science Educational technology Laboratories knowledge engineering Computer science education Systems engineering education Automata Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Application of Aggregated knowledge Concept in Automatic knowledge Acquisition from Chinese Web Pages

Application of Aggregated Knowledge Concept in Automatic Kno...

引用

International Symposiums on Information Processing (ISIP)

作者： Haiyan Che Jigui Sun Xi Bai Lian Shi Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China Jilin University Changchun Jilin CN

ISBN: (纸本)9781424430536;9780769531519

Proper ontology definition is the prerequisite for efficient knowledge acquisition. For the complex knowledge that could not be described by simple binary relation, we advocated a methodology for aggregated knowledge acquisition, describing how to define the ontology for such aggregated knowledge concept and how to acquire knowledge basing on such definition. Experiment shows that this methodology is effective in automatic knowledge acquisition from Chinese free text.

关键词： knowledge acquisition Web pages Ontologies Natural languages Semantic Web Information processing Application software Sun Educational institutions Computer science

来源：评论

学校读者我要写书评

暂无评论

Detecting DNA-binding Domain From Sequence and Secondary Structure Information Using Kernel-based Technique

Detecting DNA-binding Domain From Sequence and Secondary Str...

引用

2008 3rd International Conference on Intelligent System and knowledge engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)

作者： Wang Fei Chen Lusheng Shanghai key laboratory of Intelligent Information Processing Fudan UniversityPRC Department of Computer Science and EngineeringFudan UniversityPRC Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin Universi

DNA-binding proteins play an important role invarious intra-and extra-cellular *** key in theprotein is DNA-binding region also called DNA-bindingdomain(DBD).However,it is hard to search the DBDsby means of homology search or hidden Markov modelsbecause of a wide variety of the *** this work,we develop a kernel-based machine learning method bycombination of multiple "l-vs-l" binary classifiers forDNA binding domain *** result shows that93.73％ accuracy is achieved for multicategory classifierand no less than 90％ accuracy for each binary *** comparison,our classifier performs better than othermachine learning methods.

关键词： Support vector machines Sequences Hidden Markov models Learning systems DNA knowledge engineering Partial response channels Protein engineering Support vector machine classification Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Translating Query for Deep Web Using Ontology

Translating Query for Deep Web Using Ontology

引用

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

来源：评论

学校读者我要写书评

暂无评论

Object Localization Based on Global Structure Constraint Model and Optimal Algorithm

Object Localization Based on Global Structure Constraint Mod...

引用

International Conference on Innovative Computing, Information and Control (ICICIC)

作者： Miao Liu Dongwei Guo Jie Ma Xiaohua Liu Dan Li Chunguang Zhou College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781424431977;9780769531618

We present a novel object localization approach based on the global structure constraint model (GSC) and optimal algorithm. In GSC, Objects are described as constellations of points satisfied with their specific global structure constraints. The spatial relations among all the patches having stable color information and their representative color information around patches are encoded. Then, the searching algorithm, i.e. genetic algorithm, is used to locate target objects in images by finding out the exactly matched position. In the experiment, we tested the approach on a collection of human face images and the results demonstrated the approach is simple, effective and efficient.

关键词： computational modeling Image color analysis Face Shape Computer vision Artificial neural networks Image resolution

来源：评论

学校读者我要写书评

暂无评论

AN ATTRIBUTE DISCRETIZATION ALGORITHM BASED ON ROUGH SET AND INFORMATION ENTROPY

AN ATTRIBUTE DISCRETIZATION ALGORITHM BASED ON ROUGH SET AND...

引用

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

作者： HE LIU DA-YOU LIU XIAO-HU SHI YING GAO College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China

Attribute discretization is one of the key issues for the Rough Set theory. First, a method is proposed to compute an initial cut points set. The indistinguishable relation of decision tables did not change, and the number of elements in the initial cut points set was reduced. Then, the cut point information entropy was defined to measure the importance of a cut point. Finally, an attribute discretization algorithm based on the Rough Set and information entropy was proposed. The consistence of decision tables did not change, and the mixed decision table was considered, which contains continuous and discrete attributes. The experimental results show that this algorithm is effective and is competent for processing the large-scale datasets.

关键词： Attribute Discretization Rough Set Information Entropy Cut Point

来源：评论

学校读者我要写书评

暂无评论

Dynamic Policy Updating Based on One-Point Coverage Random Sets Theory

Dynamic Policy Updating Based on One-Point Coverage Random S...

引用

International Workshop on knowledge Discovery and Data Mining (WKDD)

作者： Wei Da Yan-heng Liu Lian-deng Li Xue-jie Liu Hai-yan Hu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China College of Computer Science and Technology Jilin University Changchun Jilin China

Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by one-point coverage random sets theory and also the unified framework of fuzzy information. On the basis of which, according to the feature of policy based network management, a model used to update the predicted information using present known information, experience, and knowledge is designed. At the same time, this thesis put forward that, take the semblance of policy as constant probability in product space conditional event algebra, so as to execute information fusion of multiple sets of related policy. In the end, compared with the policy based inference system and then analyze the result.

关键词： Set theory Resource management Fuzzy set theory Technology management Fuzzy sets knowledge management Algebra Environmental management Probability Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Notice of Retraction: Experimental Research on a New Authentication Protocol for Wireless Communication Network Based on WiMAX

Notice of Retraction: Experimental Research on a New Authent...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Ruixue Li Zhiyi Fang Peng Xu Wei Xiao Wei Wang College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Computer Northeast Normal University Changchun China

This article has been retracted by the publisher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Hiberarchy Trusted Network Based on the Grade Division

Research on Hiberarchy Trusted Network Based on the Grade Di...

引用

2008 3rd International Conference on Intelligent System and knowledge engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)

作者： Jian Wang Yanheng Liu Jing Zhang Jianqi Zhu Tianzhe Dong College of Computer Science and Technology Jilin UniversityChangchunJilin130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunJilin130012China

A framework of hiberarchy trusted network basedon the grade division was put forward,and thepartition rules of trusted attributes as well as themethods of grade division were explained in ***,the potential applications of this frameworkin trusted network were discussed,and the accessprocedure of terminals in hiberarchy trusted networkwas given based on the existing research *** show that by the proposed framework,notonly the safety and reliability of network can beensured,but also the flexibility of ways to accessnetwork is strengthened,and that the framework canprovide supports for interoperability of differentequipment suppliers.

关键词： knowledge engineering Information security Intelligent systems Intelligent networks Network servers Communication system security Data security Access protocols Routing Transport protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：