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

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

来源：评论

学校读者我要写书评

暂无评论

Agents deliberating over action proposals using the ProCLAIM model

引用

5th International Central and Eastern European Conference on Multi-Agent Systems

作者： Tolchinsky, Pancho Atkinson, Katie McBurney, Peter Modgil, Sanjay Cortes, Ulises Knowledge Engineering and Machine Learning Group Technical University of Catalonia Spain Department of Computer Science University of Liverpool Liverpool United Kingdom Advanced Computation Lab. Cancer Research UK

ISBN: (纸本)9783540752530

In this paper we propose a dialogue game for agents to deliberate over a proposed action. The agents' dialogue moves are defined by a structured set of argument schemes and critical questions (CQs). Thus, a dialogue move is an instantiated scheme (i.e. an argument) or a CQ (i.e. a challenge on the argument instantiated in the scheme). The proposed dialogue game formalises the protocol based exchange of arguments defined in the ProCLAIM model. This model provides a setting for agents to deliberate over whether, given the arguments for and against, a proposed action is justified or not.

关键词： Software agents

来源：评论

学校读者我要写书评

暂无评论

Distributed optimal control of lighting based on stochastic hill climbing method with variable neighborhood

Distributed optimal control of lighting based on stochastic ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Mitsunori Miki Asuka Amamiya Tomoyuki Hiroyasu Department of Knowledge Engineering and Computer Science Doshisha University Kyotanabe Kyoto Japan School of Engineering Doshisha University Japan Department of Knowledge Engineering and Computer Doshisha University Japan

In this research, a smart lighting system based on a new autonomous distributed control method was developed to control lighting using illuminance sensors. By using infrared ray communication, one illuminance sensor sends a luminance control directive to several lighting fixtures located nearby. The luminance is made to change randomly within a fixed range to optimize the illuminance using the stochastic hill climbing method. The result of operational experiments using illuminance sensors that were preset to the target illuminance showed that the brightness at specified locations approached the target illuminance that the illuminance sensors were set to. The electrical power consumed by the lighting system was also minimized. Moreover, in comparison with lighting driven autonomous distributed controls of smart lighting systems, better results were obtained, indicating that the method is an effective new distributed control method.

关键词： Optimal control Stochastic processes Intelligent sensors Distributed control Lighting control Communication system control Infrared sensors Control systems Sensor systems Optical fiber communication

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards efficient computing consistent and partially consistent extensions of information systems

Towards efficient computing consistent and partially consist...

引用

作者： Suraj, Zbigniew Pancerz, Krzysztof Department of Computer Science University of Rzeszów Poland Department of Computer Science Foundations University of Information Technology and Management Rzeszów Poland Department of Computer Science and Knowledge Engineering College of Management and Public Administration Zamość Poland University of Rzeszów Rejtana Str. 16A 35-310 Rzeszów Poland

This paper provides new algorithms for computing consistent and partially consistent extensions of information systems. A maximal consistent extension of a given information system includes only objects corresponding to known attribute values which are consistent with all rules extracted from the original information system. A partially consistent extension of a given information system includes objects corresponding to known attribute values which are consistent to a certain degree with the knowledge represented by rules extracted from the original information system. This degree can be between 0 and 1, 0 for the full inconsistency and 1 for the full consistency. The algorithms presented here do not involve computing any rules true in a given information system. This property differentiates them from methods presented in the earlier papers which concerned extensions of information systems.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Principles for Designing Activity-based Personalized eLearning

Principles for Designing Activity-based Personalized eLearni...

引用

International Conference on Advanced Learning Technologies (ICALT)

作者： Owen Conlan Ian O'Keeffe Aoife Brady Vincent Wade Knowledge and Data Engineering Group Department of Computer Science Trinity College Dublin Ireland

Activity-based personalized eLearning involves delivering to a learner a learning experience that is tailored to their individual needs. Traditionally, these needs have been met through the personalized selection of content that fits the learner's preferences. However, by coupling this approach with the possibilities of interactive services a more engaging form of personalized education may be realized. This paper describes the design principles for producing activity-based personalized distance learning offerings.

关键词： Electronic learning Web services computer aided instruction Adaptive systems Artificial intelligence Data engineering computer science Educational institutions Navigation Automated highways

来源：评论

学校读者我要写书评

暂无评论

OntoMove: A knowledge Based Framework for Semantic Requirement Profiling and Resource Acquisition

OntoMove: A Knowledge Based Framework for Semantic Requireme...

引用

Australian Conference on Software engineering

作者： Mehul Bhatt Wenny Rahayu Sury Prakash Soni Carlo Wouters Data Engineering and Knowledge Management Group Department of Computer Science La Trobe University Australia

The use of formal knowledge representation structures, or ontologies, has found immense applicability for the interoperability of software systems, e.g., alignment of software and business process models. Toward the management of such knowledge structures, an important foundational problem is that of ontology reuse - it is uncommon for new applications or for different components within one application to use an already available ontology in its entirety. Depending on component specific requirements, typical re-usages are restricted to refined versions of an existing ontology, with the refinement taking the form of a contraction of the knowledge contained therein. Furthermore, when the ontology is used to ascribe meaning to independently existing 'resources' (e.g., documents collections, source code, software manuals, process template repositories) by way of meta-data, there exists a direct mapping between different views/re-uses of an ontology and their respective semantic scopes within an annotated resource repository thereby leading to the concept of view/reuse dependent resource retrieval. We implement a framework that supports ontology reuse by way of a requirement driven sub-ontology extraction methodology. Additionally, based on this concept of a sub-ontology, we implement the idea of a user/component 'requirement profile' consisting of semantic descriptions of the user's interest within a 'resource repository' that has been annotated with semantic types from the ontology under consideration. A generic framework that implements these ideas and its application in the domains of medical information retrieval systems and business process management systems (BPMS) is presented.

关键词： Ontologies Application software Information retrieval Software engineering knowledge management knowledge representation Data mining Resource management Software systems Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Collaboration and adaptation in scheduling

IFIP Advances in Information and Communication Technology

引用

IFIP Advances in Information and Communication Technology 2007年 243卷 611-618页

作者： Almeida, Ana Marreiros, Goreti Martins, Constantino Knowledge Engineering and Decision Support Research Group-GECAD Computer Science Department Institute of Engineering of Porto Porto Portugal

ISBN: (纸本)9781475705645

Scheduling is a multi-criteria decision problem in practice, where different schedulers may agree on key objectives but differ greatly on their relative importance in a particular situation. This kind of problems can be tackled with Collaborative approaches, which is the aim of" this work. Collaboration supports work being undertaken by dispersed entities allowing the sharing of" final results and also the process of" obtaining them. This involve a range of" activities such as information exchanging, knowledge sharing, argumentation, problem solving strategies, role playing, group mediation, individual training and conflict resolution, among other. Here, we propose a Collaborative framework with an Adaptive behaviour to be used in Manufacturing Scheduling Environments. © 2008, IFIP International Federation for Information Processing. All rights reserved.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

On transitive uncertainty mappings

引用

2nd International Conference on Rough Sets and knowledge Technology, RSKT 2007

作者： Baoqing, Jiang Keyun, Qin Zheng, Pei Institute of Data and Knowledge Engineering Henan University Kaifeng Henan 475001 China Department of Mathematics Southwest Jiaotong University Chengdu Sichuan 610031 China School of Mathematics and Computer Science Xihua University Chengdu Sichuan 610039 China

ISBN: (纸本)9783540724575

This paper is devoted to the discussion of transitive uncertainty mapping in general approximation space. It is proved that the best low-approximation mapping exist if the uncertainty mapping is transitive. Furthermore, the best low-approximation mapping is defined and its properties are discussed. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Efficient Hybrid Web Recommendations Based on Markov Clickstream Models and Implicit Search 07

Efficient Hybrid Web Recommendations Based on Markov Clickst...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Zhiyong Zhang Olfa Nasraoui Knowledge Discovery & Web Mining Lab Department of Computer Science and Engineering University of Louisville Louisville KY USA

ISBN: (纸本)9780769530260

In this paper, we present novel methods that combine (1) Markov models and (2) Web page content search techniques to generate Web navigation recommendations. For click-stream modeling, both first-order and second-order Markov models were studied and a compact storage format for Markov transition matrices was used. For content-based search, a search engine was used to obtain similar-content pages for recommendation to compensate for the sparsity of the Markov model and thus improve coverage. Experiments were conducted on real Web clickstream logs, and confirmed the efficiency of the proposed methods.

关键词： Predictive models Search engines Data mining Web pages Information filtering Information filters Accuracy Recommender systems Association rules Hybrid power systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：