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

2006 International Conference on Artificial Intelligence, ICAI'06

作者： Jiang, Li Liu, Da-You 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

ISBN: (纸本)9781932415988

Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection of coordination mechanisms, new coordination models using swarm intelligence, new methods using varied techniques like case based reasoning, reinforcement learning, distributed logic programming, game theory, etc.. In this paper, we survey these achievement as a general study of coordination, including, the nature of coordination, coordination mechanisms, coordination approaches, relationship among coordination mechanisms and approaches, coordination methodologies, conversational aspects of coordination and software architectures. And along with this survey, we give our view of future research direction of coordination.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Algorithm studies of rules generation in COROS

Algorithm studies of rules generation in COROS

引用

5th IEEE International Conference on Cognitive Informatics, ICCI 2006

作者： Sun, Chengmin Liu, Dayou Fu, Chunxiao Shuyang, Sun 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

In Containing Order Rough Set Methodology (CORS), ordered attribute 'criterion' is introduced. Criterion is related semantically with decision attributes, which results in producing more rational and significant rules utilizing dominance relations. In this paper, some terminologies and properties on rules or rules set, such as robust, minimal, complete are discussed, the state of art in algorithms on rules generation are analyzed, and algorithms GRs and IGRs are proposed. We compare these two algorithms by experiments in time complexity, rules count and accuracy. We find that GRs can generate all minimal rules, but time complexity is high and IGRs' efficiency is better, but quality of rules are inferior to that of GRs. We also discuss the completeness of rules set and present a viewpoint that there are three hierarchies for completeness. In accuracy calculation, three formulas for accuracy calculation and two approaches for experimental test are given. © 2006 IEEE.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

A new taxonomy of coordination models based on interaction types

A new taxonomy of coordination models based on interaction t...

引用

2006 International Conference on Artificial Intelligence, ICAI'06

ISBN: (纸本)9781932415988

Coordination models can be classified into several classes, such as data-driven vs. control-driven coordination models, dependent vs. emergent coordination models, and hybrid coordination models. All these classifications are based upon implementation details. However, interaction is the kernel aspect of coordination, and coordination is the outcome of interactions between agents, so here, we give another kind of taxonomy based on interaction types, which are coordination models based on direct interactions and indirect interactions. Using this taxonomy, all coordination models are classified into two classes with no intersection, in addition, coordination models with indirect interactions and emergent behaviors are the direction of future work.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Learning Hierarchical User Interest Models from Web Pages

引用

Wuhan University Journal of Natural Sciences 2006年第1期11卷 6-10页

作者： YANG Feng-qin SUN Tie-li SUN Ji-gui College of Computer Science and Technology Jilin University Changchun 130012 Jilin China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 120012 Jilin China Department of Computer Science Northeast Normal University Changchun 130024 Jilin China

We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.

关键词： personalization user interest model vector space model agglomerate clustering method

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Markov Model Based on EM Algorithm

A Hybrid Markov Model Based on EM Algorithm

引用

International Conference on Control, Automation, Robotics and Vision (ICARCV)

作者： Xue-gang Yu Yan-heng Liu Da Wei Ling-yin Lei Key laboratory of symbolic computation and knowledge Engineering of ministry of education Jilin University Beijing China

Order-k Markov model can be used in many fields such as natural language understanding, coding, mobile path prediction and so on to make prediction and then control. But the model has to face the problem of state space expansion. Taking the mobile path prediction as the research background, the paper firstly proposes a step-k Markov model and validates its feasibility. Secondly, a hybrid Markov predictor model is put forward based on the step-k Markov model. The complexity of the hybrid Markov model is O(N) while the order-k Markov model is O(N 2 ). And the memory demand of the hybrid Markov model is O(N 2 ) while order-k Markov model is O(N 3 ). Finally, it is proved that the hybrid Markov predictor can get close performance with order-k Markov predictor at much lower expense by conditional entropy analysis and user mobility data analysis. Also it can alleviate the zero probability problem in order-k Markov model to some extent. The hybrid Markov predictor is more practical than order-k Markov predictor under WLAN

关键词： Predictive models State-space methods Entropy Mobile computing Wireless LAN Natural languages Accuracy Wireless networks educational institutions Equations

来源：评论

学校读者我要写书评

暂无评论

Operational semantics of the seal calculus

Operational semantics of the seal calculus

引用

4th IFIP TCI2 International Conference on Intelligent Information Processing, IIP 2006

作者： Jing, Zhang Li-Cui, Zhang De-Gui, Guo College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education of China Jilin University Changchun 130012 China College of Communication Engineering Jilin University Changchun 130012 China

ISBN: (纸本)9780387446394

As a distributed process calculus with localities and mobility of computational entities, Seal calculus is playing an important role in expressing {1. features such as security and mobility of Internet programming directly. However, little implementation technique proposed for the calculus, partly due to the complication of inobile computation, which fusions three important techniques: concurrency, distribution and mobility at the same time. The abstract machine PSN for a distributed implementation of the Seal calculus is presented. In PSN the logical structure of a seal system and its physical distribution are separated which induces a more simple and clear implementation. Moreover, an operational semantics description of the Seal calculus based on PSN is given.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

SLNN: A Neural Network for Fuzzy Neural Network's Structure Learning

SLNN: A Neural Network for Fuzzy Neural Network's Structure ...

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

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

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 Hebbian learning and a kernel winner-take-all algorithm - KWTA. KWTA not only can let SLNN be able to learn from new data but also can prevent losing the knowledge which has been learned earlier. To obtain a concise fuzzy rule, a pruning algorithm is adopted in SLNN which doesn't disobey the basic design philosophy of fuzzy system. Simulations are performed on the primary benchmark: circle-in-the-square. Comparison with ARTMAP and BP neural network indicates that better performance is achieved

关键词： Neural networks Fuzzy neural networks Fuzzy systems Clustering algorithms Signal processing algorithms Computer networks Neurons Partitioning algorithms Learning Fuzzy control

来源：评论

学校读者我要写书评

暂无评论

Research of Mobile IPv6 Application Based On Diameter Protocol

Research of Mobile IPv6 Application Based On Diameter Protoc...

引用

International Multi-Symposiums on Computer and computational Sciences (IMSCCS)

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

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

关键词： Access protocols Authentication Cryptographic protocols Authorization Network servers Application software IP networks Peer to peer computing Transport protocols Computer science

来源：评论

学校读者我要写书评

暂无评论

COMPUTING AND RAY TRACING POINT-BASED GEOMETRY

COMPUTING AND RAY TRACING POINT-BASED GEOMETRY

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： YUN-JIE PANG BIN ZHOU YONG QUAN WEN-HUI LI Computer Graphics Laboratory College of Computer Science and Technology Jilin University Qianwei Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education

In this paper a new technique for computing and ray tracing point based geometry is presented. It uses a novel point primitive that is called "Spherical Patch Point" (SPP) to approximate the vicinity of a surface point. Due to property of curvature, SPP can achieve similar visual quality compared with previous methods with much fewer primitives for the cost of a few additional bytes per point and thus makes a significant reduction in rendering time. During pre-process,important attributes are added to each SPP for the purpose of ray tracing. During rendering, an intersection algorithm different from previous ones has been demonstrated to get satisfied results. The proposed technique makes it possible to render high quality ray traced images with global illumination using SPPs. It offers a higher ray tracing speed in comparison with previous methods.

关键词： Points Curvature Sphere Radius Ray tracing

来源：评论

学校读者我要写书评

暂无评论

A NEW POINT-BASED RENDERING METHOD FOR RAY TRACING

A NEW POINT-BASED RENDERING METHOD FOR RAY TRACING

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： GUO-LIANG ZHOU YUN-JIE PANG ZHEN-HUA ZHANG YONG QUAN WEN-HUI LI Computer Graphics Laboratory College of Computer Science and Technology Jilin University Qianwei Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education

In this paper a new point-based rendering method for ray tracing is presented. An oriented spherical patch that passes a surface point is used to approximate the vicinity of that *** this paper the spherical patch together with the surface point is called "Spherical Patch Point" (SPP). Due to property of curvature, SPP can achieve similar visual quality compared with previous methods with much fewer points. This paper defines new point attributes for the purpose of efficiently locating the intersection between incoming ray and ***, an algorithm of intersecting a ray with point geometry is proposed. The algorithm can achieve a higher rendering speed in comparison with previous methods. The presented technique deals well with shadow, reflection and refraction.

关键词： Point-based rendering Curvature Spherical patch Radius Ray tracing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：