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

Journal of Information science and Engineering: Editorial notice

Journal of Information science and Engineering 2005年第5期21卷 i-ii页

作者： Lee, Der-Tsai Amato, Nancy M. Chang, Shih-Fu Chen, Homer H. Chen, Tsuhan Hsu, Tsan-Sheng Hwang, Jenq-Neng Kuo, Sy-Yen Kuo, Tei-Wei Li, Chung-Sheng Tokuyama, Takeshi Wing, Jeannette Wu, Tzong-Chen Yen, John Computer Science at Texas A and M University United States Parasol Laboratory United States IEEE Transactions on Parallel and Distributed Systems Computing Research Association's Committee on the Status of Women in Computing Research CRA-W's Distributed Mentor Program United States Department of Electrical Engineering Columbia University United States Lab. United States College of Electrical Engineering and Computer Science National Taiwan University Taiwan IEEE Transactions on Circuits and Systems for Video Technology IEEE Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States ACM ACM SIGACT IEEE Computer Society IICM Austria Research and Development of the Department Multimedia Signal Processing Technical Committee IEEE Signal Processing Society United States IEEE Transactions on Circuits and systems for Video Technology College of Electrical Engineering and Computer Science National Taiwan Ocean University Keelung Taiwan Department of Electrical Engineering National Taiwan University Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan IEEE Technical Committee on Real-Time Systems Computer Science Division IBM T.J. Watson Research Center United States IBM Research Division Graduate School of Information Sciences Tohoku University Japan ACM IPSJ Mathematical Society of Japan Japan Department of Computer Science Computer Science Department Carnegie Mellon University United States National Academies of Science's Computer Science and Telecommunications Board United States Microsoft's Trustworthy Academic Advisory Board Intel Research Pittsburgh's Advisory Board United States Dartmouth's Institute for Security Technology Studies Advisory Committee Canada Sloan Research Fellowships Program Committee United States ACM Taiwan China Information Sciences and Technology Pennsylvania State University United States Laboratory for Intelligent Agents Penn State's School of Info

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Communication for improving policy computation in distributed POMDPs

Communication for improving policy computation in distribute...

引用

Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent systems, AAMAS 2004

作者： Nair, Ranjit Tambe, Milind Roth, Maayan Yokoo, Makoto Computer Science Dept. Univ. of Southern California Robotics Institute Carnegie Mellon University Dept. of Intelligent Systems Kyushu University

ISBN: (纸本)1581138644

Distributed Partially Observable Marfcov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to jointly maximize a reward function. Since the problem of finding the optimal joint policy for a distributed POMDP has been shown to be NEXP-Complete if no assumptions are made about the domain conditions, several locally optimal approaches have emerged as a viable solution. However, the use of communicative actions as part of these locally optimal algorithms has been largely ignored or has been applied only under restrictive assumptions about the domain. In this paper, we show how communicative acts can be explicitly introduced in order to find locally optimal joint policies that allow agents to coordinate better through synchronization achieved via communication. Furthermore, the introduction of communication allows us to develop a novel compact policy representation that results in savings of both space and time which are verified empirically. Finally, through the imposition of constraints on communication such as not going without communicating for more than K steps, even greater space and time savings can be obtained.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Editorial message: Special track on data streams

Editorial message: Special track on data streams

引用

Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing

作者： Aguilar-Ruiz, Jesus S. Cohen, Paul R. Department of Computer Science University of Seville Spain Intelligent Systems Division USC Information Sciences Institute United States

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Knowledge Discovery by Reversing Inductive Knowledge Representation 9

Knowledge Discovery by Reversing Inductive Knowledge Represe...

引用

9th International Conference on Principles of Knowledge Representation and Reasoning, KR 2004

作者： Kern-Isberner, Gabriele Fisseler, Jens Department of Computer Science Fern Universitaet Hagen Hagen58084 Germany Institute for Robotics Cognitive Systems Universitaet Luebeck Luebeck23538 Germany

ISBN: (纸本)1577351991

In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we make this notion more precise and present a method how to extract structural information from statistical data. There are two key ideas underlying our approach: First, knowledge discovery is understood as a process which is inverse to inductive knowledge representation. So the relevance of discovered information is judged with respect to the chosen representation method. Second, the link between structural and numerical knowledge is established by an algebraic theory of conditionals, which considers conditionals as agents acting on possible worlds. By applying this theory, we develop an algorithm that computes sets of probabilistic rules from distributions. In particular, we show how sparse information can be dealt with appropriately in our framework. The inductive representation method used here is based on information theory, so that the discovered rules can be considered as being most informative in a strict, formal sense. Copyright © 2004, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Generating robust partial order schedules

引用

10th International Conference on Principles and Practice of Constraint Programming, CP 2004

作者： Policella, Nicola Oddi, Angelo Smith, Stephen F. Cesta, Amedeo Institute for Cognitive Science and Technology Italian National Research Council Rome Italy The Robotics Institute Carnegie Mellon University PittsburghPA United States Department of Computer and Systems Science University of Rome Italy

ISBN: (纸本)3540232419

This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. Whereas a fixed-times schedule is brittle in the face of unpredictable execution dynamics and can quickly become invalidated, aPOS retains temporal flexibility whenever problem constraints allow it and can often absorb unexpected deviation from predictive assumptions. We focus specifically on procedures for generating Chaining Form POSs, wherein activities competing for the same resources are linked into precedence chains. One interesting property of a Chaining Form POS is that it is "makespan preserving" with respect to its originating fixed-times schedule. Thus, issues of maximizing schedule quality and maximizing schedule robustness can be addressed sequentially in a two-step scheduling procedure. Using this approach, a simple chaining algorithm was recently shown to provide an effective basis for transforming good quality solutions into POSs with good robustness properties. Here, we investigate the possibility of producing POSs with better robustness and stability properties through more extended search in the space of Chaining Form POSs. We define two heuristics which make use of a structural property of chaining form POSs to bias chaining decisions. Experimental results on a resource-constrained project scheduling benchmark confirm the effectiveness of our approach. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Communications for improving policy computation in distributed POMDPs

Communications for improving policy computation in distribut...

引用

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent systems, AAMAS

作者： R. Nair M. Tambe M. Roth M. Yokoo Computer Science Department University of Southern California USA Robotics Institute Carnegie Mellon University USA Department of Intelligent Systems Kyushu University Japan

Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to jointly maximize a reward function. Since the problem of finding the optimal joint policy for a distributed POMDP has been shown to be NEXP-Complete if no assumptions are made about the domain conditions, several locally optimal approaches have emerged as a viable solution. However, the use of communicative actions as part of these locally optimal algorithms has been largely ignored or has been applied only under restrictive assumptions about the domain. In this paper, we show how communicative acts can be explicitly introduced in order to find locally optimal joint policies that allow agents to coordinate better through synchronization achieved via communication. Furthermore, the introduction of communication allows us to develop a novel compact policy representation that results in savings of both space and time which are verified empirically. Finally, through the imposition of constraints on communication such as not going without communicating for more than K steps, even greater space and time savings can be obtained.

关键词： Distributed computing Teamwork Uncertainty Observability Permission Multiagent systems Performance loss Humans

来源：评论

学校读者我要写书评

暂无评论

Integrating guidance into relational reinforcement learning

Integrating guidance into relational reinforcement learning

引用

作者： Driessens, Kurt Džeroski, Sašo Department of Computer Science Katholieke Universiteit Leuven Celestijnenlaan 200A B-3001 Heverlee Belgium Department of Intelligent Systems Jožef Stefan Institute Jamova 39 SI-1000 Ljubljana Slovenia

Reinforcement learning, and Q-learning in particular, encounter two major problems when dealing with large state spaces. First, learning the Q-function in tabular form may be infeasible because of the excessive amount of memory needed to store the table, and because the Q-function only converges after each state has been visited multiple times. Second, rewards in the state space may be so sparse that with random exploration they will only be discovered extremely slowly. The first problem is often solved by learning a generalization of the encountered examples (e.g., using a neural net or decision tree). Relational reinforcement learning (RRL) is such an approach;it makes Q-learning feasible in structural domains by incorporating a relational learner into Q-learning. The problem of sparse rewards has notbeen addressed for RRL. This paper presents a solution based on the use of "reasonable policies" to provide guidance. Different types of policies and different strategies to supply guidance through these policies are discussed and evaluated experimentally in several relational domains to show the merits of the approach.

关键词： Relational database systems

来源：评论

学校读者我要写书评

暂无评论

Toward multimodal human-robot cooperation and collaboration

Toward multimodal human-robot cooperation and collaboration

引用

Collection of Technical Papers - AIAA 1st intelligent systems Technical Conference

作者： Perzanowski, Dennis Brock, Derek Bugajska, Magdalena Thomas, Scott Sofge, Donald Adams, William Skubic, Marjorie Blisard, Sam Cassimatis, Nicholas Trafton, J. Gregory Schultz, Alan C. Naval Research Laboratory Washington DC 20375 University of Missouri Columbia MO 65211 Rensselaer Polytechnic Institute Troy NY 12180 Intelligent Multimodal/Multimedia Systems Code 5512 Interface Design and Evaluation Code 5513 Intelligent Systems Code 5515 Electrical and Computer Engineering Department Department of Cognitive Science

ISBN: (纸本)156347719X

Our multimodal interface integrates speech recognition, natural language understanding, spatial reasoning and human cognitive models for completing specific tasks and for perspective-taking in locative oriented tasks. With natural language and gestures, we believe human-robot interaction and communication is facilitated. Instead of concentrating on the various modalities of the interface, users can concentrate on the task at hand. Likewise, by incorporating human cognitive models for handling spatial information and perspective-taking, as well as for specific task completion, a better match with the expectations that humans acquire from their human-human interactions should be obtained, further facilitating cooperation and collaboration in human-robot interactions.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

Navigation for human-robot interaction tasks

Navigation for human-robot interaction tasks

引用

IEEE International Conference on robotics and Automation (ICRA)

作者： P. Althaus H. Ishiguro T. Kanda T. Miyashita H.I. Christensen Centre for Autonomous Systems Numerical Analysis and Computer Science Royal Institute of Technology Stockholm Sweden ATR Intelligent Robotics and Communication Laboratories Keihanna Science City Kyoto Japan

One major design goal in human-robot interaction is that the robots behave in an intelligent manner, preferably in a similar way as humans. This constraint must also be taken into consideration when the navigation system for the platform is developed. However, research in human-robot interaction is often restricted to other components of the system including gestures, manipulation, and speech. On the other hand, research for mobile robot navigation focuses primarily on the task of reaching a certain goal point in an environment. We believe that these two problems can not be treated separately for a personal robot that coexists with humans in the same surrounding. Persons move constantly while they are interacting with each other. Hence, also a robot should do that, which poses constraints on the navigation system. This type of navigation is the focus of this paper. Methods have been developed for a robot to join a group of people engaged in a conversation. Preliminary results show that the platform's moving patterns are very similar to the ones of the persons. Moreover, this dynamic interaction has been judged naturally by the test subjects, which greatly increases the perceived intelligence of the robot.

关键词： Navigation intelligent robots Human robot interaction Mobile robots Indoor environments Numerical analysis computer science Cities and towns Testing

来源：评论

学校读者我要写书评

暂无评论

Classification of atrial tachyarrhythmias in electrocardiograms using time frequency analysis

Classification of atrial tachyarrhythmias in electrocardiogr...

引用

computers in Cardiology 2004

作者： Tsipouras, M.G. Oikonomou, V.P. Fotiadis, D.I. Michails, L.K. Sideris, D. Unit of Medical Technology and Intelligent Information Systems Department of Computer Science University of Ioannina GR 45110 Ioannina Greece Biomedical Research Institute FORTH GR 45110 Ioannina Greece Michaelidion Cardiology Center GR 45110 Ioannina Greece Division of Cardiology Medical School GR 45110 Ioannina Greece Unit of Medical Technology and Intelligent Information Systems Dept. of Computer Science University of Ioannina Campus P.O. BOX 1186 GR 45110 Ioannina Greece

In this work a novel automated method, combining time-frequency analysis and expert's knowledge, for the classification of atrial tachyarrhythmias is presented. It is based on the analysis of small ECG segments and their classification into three categories of cardiac rhythm: (a) atrial fibrillation, (b) atrial flutter and (c) normal sinus rhythms. Time-frequency analysis is used to calculate the power spectrum density for each segment. Several spectral characteristics are extracted from the power spectrum density, representing the energy distribution on the time-frequency plane. These characteristics are used as input in an artificial neural network, which classifies each ECG segment into one of the three categories. The method is validated using the MIT-BIH arrhythmia database and the obtained average sensitivity and specificity are 93.4% and 96.5%, respectively. © 2004 IEEE.

关键词： Electrocardiography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：