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

An associative memory system for incremental learning and temporal sequence

An associative memory system for incremental learning and te...

2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 International Joint Conference on Neural Networks, IJCNN 2010

作者： Shen, Furao Yu, Hui Kasai, Wataru Hasegawa, Osamu State Key Laboratory for Novel Software Technology Jiangyin Information Technology Research Institute Nanjing University Nanjing 210093 China Department of Computer Intelligence and Systems Science Tokyo Institute of Technology Yokohama 226-8503 Japan Imaging Science and Engineering Lab. Tokyo Institute of Technology R2-52 4259 Nagatsuda Midori-ku Yokohama 226-8503 Japan

ISBN: (纸本)9781424469178

An associative memory (AM) system is proposed to realize incremental learning and temporal sequence learning. The proposed system is constructed with three layer networks: The input layer inputs key vectors, response vectors, and the associative relation between vectors. The memory layer stores input vectors incrementally to corresponding classes. The associative layer builds associative relations between classes. The proposed method can incrementally learn key vectors and response vectors;store and recall both static information and temporal sequence information;and recall information from incomplete or noise-polluted inputs. Experiments using binary data, real-value data, and temporal sequences show that the proposed method works well. © 2010 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

A comparative study on two large-scale hierarchical text classification tasks' solutions

A comparative study on two large-scale hierarchical text cla...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jian Zhang Hai Zhao Bao-Liang Lu Center of Brain-Like Computing and Machine Intelligence(ÇïêDepartment of Computer Science and Engineering Shanghai Jiaotong University Shanghai China MOE-Microsoft Key Laboratory of Intelligent Computing and Intelligent Systems Shanghai Jiaotong University Shanghai China

Patent classification is a large scale hierarchical text classification (LSHTC) task. Though comprehensive comparisons, either learning algorithms or feature selection strategies, have been fully made in the text categorization field, few work was done for a LSHTC task due to high computational cost and complicated structural label characteristics. For the first time, this paper compares two popular learning frameworks, namely hierarchical support vector machine (SVM) and k nearest neighbor (k-NN) that are applied to a LSHTC task. Experiment results show that the latter outperforms the former in this LSHTC task, which is quite different from the usual results for normal text categorization tasks. Then this paper does a comparative study on different similarity measures and ranking approaches in k-NN framework for LSHTC task. Conclusions can be drawn that k-NN is more appropriate for the LSHTC task than hierarchical SVM and for a specific LSHTC task. BM25 outperforms other similarity measures and List Weak gains a better performance than other ranking approaches. We also find an interesting phenomenon that using all the labels of the retrieved neighbors can remarkably improve classification performance over only using the first label of the retrieved neighbors.

关键词： Patents Support vector machines Text categorization Nearest neighbor searches Training Classification algorithms Taxonomy

来源：评论

学校读者我要写书评

暂无评论

A cost and space efficient method for unbalanced assignment problems

A cost and space efficient method for unbalanced assignment ...

引用

IEEE International Conference on Industrial engineering and engineering Management

作者： Anupong Iampang Veera Boonjing Pisit Chanvarasuth Software Systems Engineering Laboratory Department of Computer Science King Mongkut's Institute of Technology Ladkrabang Bangkok Thailand Sirindhorn International Institute of Technology Thammasat University Pathum Thani Thailand

ISBN: (纸本)9781424485017

In this paper, a new cost and space efficient solution to unbalanced assignment problems is presented. The new solution uses linear space complexity instead of polynomial complexity as used by the Hungarian method. Moreover, its optimal cost is lower than of the Kumar method - an existing linear space complexity solution to unbalanced assignment problems.

关键词： Complexity theory Simulation Space technology Electronic mail Polynomials Logistics

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2010 conference workshops

Reports of the AAAI 2010 conference workshops

引用

作者： Aha, David W. Boddy, Mark Bulitko, Vadim D'Avila Garcez, Artur S. Doshi, Prashant Edelkamp, Stefan Geib, Christopher Gmytrasiewicz, Piotr Goldman, Robert P. Halevy, Alon Hitzler, Pascal Isbell, Charles Josyula, Darsana Kaelbling, Leslie Pack Kersting, Kristian Kunda, Maithilee Lamb, Luis C. Marthi, Bhaskara McGreggor, Keith Mihalkova, Lilyana Nastase, Vivi Natarajan, Sriraam Provan, Gregory Raja, Anita Ram, Ashwin Riedl, Mark Russell, Stuart Sabharwal, Ashish Smaus, Jan-Georg Sukthankar, Gita Tuyls, Karl Van Der Meyden, Ron Adaptive Systems Section Naval Research Laboratory Washington DC United States Adventium Labs. Minneapolis MN United States Department of Computer Science University of Alberta Canada City University London United Kingdom University of Georgia United States University of Bremen Germany School of Informatics University of Edinburgh United Kingdom University of Illinois Chicago United States Smart Information Flow Technologies LLC Minneapolis MN United States Structured Data Group Google Research United States Department of Computer Science Wright State University Dayton OH United States School of Interactive Computing Georgia Institute of Technology Atlanta GA United States Department of Computer Science Bowie State University United States Department of Computer Science and Engineering Massachusetts Institute of Technology United States Statistical Relational Mining Group Fraunhofer IAIS Germany Department of Computer Science Federal University of Rio Grande Do sul Brazil Willow Garage Inc. CA United States Computer Science Department University of Maryland College Park United States Heidelberg Institute for Theoretical Studies Heidelberg Germany Department of Computer Science University of Wisconsin Madison United States University College Cork Ireland Cork Complex Systems Lab. Ireland Department of Software and Information Systems University of North Carolina Charlotte United States Department of Computer Science and Engineering University of California Berkeley United States Department of Computer Science Cornell University United States Institute for Computational Sustainability United States University of Freiburg Germany School of Electrical Engineering and Computer Science University of Central Florida United States Maastricht University Netherlands University of New South Wales NICTA Australia

The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. There were several presentations on particular formalisms for combining the levels of planning from the perspectives of classical planning, motion planning, POMDPs, search-based planning, and temporal logic-based constraints. Henry Lieberman from Massachusetts Institute of Technology Media laboratory presented work developing a platform for knowledge acquisition and usage from expert users, built upon experience with eliciting information from nonexperts in a collaborative manner. The objective of the AAAI Workshop on Goal-Directed Autonomy (GDA) was to encourage discussion and novel contributions on intelligent agents that can self-select their goals. Jeremy Baxter from QinetiQ focused on user interaction, while Nick Hawes described a goal-directed reasoning framework for controlling a mobile robot.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Visual Gaze Estimation by Joint Head and Eye Information

Visual Gaze Estimation by Joint Head and Eye Information

引用

International Conference on Pattern Recognition

作者： Roberto Valenti Adel Lablack Nicu Sebe Chabane Djeraba Theo Gevers Intelligent Systems Laboratory Amsterdam University of Amsterdam Netherlands Laboratoire d'Informatique Fondamentale de Lille University of Lille (USTL) France Department of Information Engineering and Computer Science University of Trento Italy

ISBN: (纸本)9781424475421

In this paper, we present an unconstrained visual gaze estimation system. The proposed method extracts the visual field of view of a person looking at a target scene in order to estimate the approximate location of interest (visual gaze). The novelty of the system is the joint use of head pose and eye location information to fine tune the visual gaze estimated by the head pose only, so that the system can be used in multiple scenarios. The improvements obtained by the proposed approach are validated using the Boston University head pose dataset, on which the standard deviation of the joint visual gaze estimation improved by 61:06% horizontally and 52:23% vertically with respect to the gaze estimation obtained by the head pose only. A user study shows the potential of the proposed system.

关键词： Visualization Estimation Magnetic heads Head Joints Monitoring Humans

来源：评论

学校读者我要写书评

暂无评论

Quantum State Reduction for Universal Measurement Based Computation

引用

Physical Review Letters 2010年第2期105卷 020502-020502页

作者： Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing University of Waterloo Waterloo Ontario Canada Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the past decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Multi-error-correcting amplitude damping codes

Multi-error-correcting amplitude damping codes

引用

IEEE International Symposium on Information Theory

作者： Runyao Duan Markus Grassl Zhengfeng Ji Bei Zeng State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Centre for Quantum Technologies National University of Singapore Singapore Perimeter Institute of Theoretical Physics Waterloo ONT Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences Beijing China Institute for Quantum Computing and the Department of Combinatorics and Optimization University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9781424478903

We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel. This allows us to use concatenated codes with quantum erasure-correcting codes as outer codes for correcting multiple amplitude damping errors. Our new codes are degenerate stabilizer codes and have parameters which are better than the amplitude damping codes obtained by any previously known construction.

关键词： Damping Quantum mechanics Quantum computing Error correction codes Noise level Laboratories Phase noise Physics computing intelligent systems computer science

来源：评论

学校读者我要写书评

暂无评论

Active fault-tolerant control design for T-S fuzzy systems with application to a near space vehicle

Active fault-tolerant control design for T-S fuzzy systems w...

引用

IEEE International Symposium on intelligent Control (ISIC)

作者： Zhifeng Gao Bin Jiang Youmin Zhang Fuchun Sun College of Automation Engineering Nanjing University of Aeronautics and Astronautics Nanjing China Department of Mechanical and Industrial Engineering Concordia University Montreal QUE Canada State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing China

Based on adaptive and ℋ ∞ control techniques, this paper deals with the problem of active fault-tolerant control for a class of T-S fuzzy systems with actuator faults. The presented approach is dependent on a fuzzy iterative learning observer (ILO), which produces a control input adjustment term in order to compensate for the effect of actuator faults. Based on Lyapunov theorem, a sufficient condition for the stability of error dynamic systems is derived. The active fault-tolerant control strategy proposed in the paper is finally demonstrated in simulation on the near space vehicle (NSV) reentry attitude dynamics to illustrate its effectiveness.

关键词： Fuzzy systems Actuators Vehicle dynamics Fault diagnosis Observers Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

RoboCup 2009: Robot Soccer World Cup XIII - Preface

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2010年 5949 LNAI卷

作者： Baltes, Jacky Lagoudakis, Michail G. Naruse, Tadashi Shiry, Saeed University of Manitoba Department of Computer Science Winnipeg MB R3T 2N2 Canada Technical University of Crete Intelligent Systems Laboratory Department of Electronic and Computer Engineering 73100 Chania Greece Aichi Prefectural University School of Information Science and Technology Nagakute-cho Aichi 480-1198 Japan Amirkabir University of Technology Computer Engineering and Information Technology Department Hafez Avenue Tehran 15914 Iran

来源：评论

学校读者我要写书评

暂无评论

Delay-dependent conditions for monotonic convergence of uncertain ILC systems: An LMI approach

Delay-dependent conditions for monotonic convergence of unce...

引用

IEEE Conference on Decision and Control

作者： Deyuan Meng Yingmin Jia Junping Du Fashan Yu Seventh Research Division the Department of Systems and Control Beihang University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing China School of Electrical Engineering and Automation Henan Polytechnic University Jiaozuo Henan China

ISBN: (纸本)9781424477456

This paper deals with the iterative learning control (ILC) problem for uncertain time-delay systems (TDS). In order to ensure monotonic convergence of the ILC process, a sufficient condition is developed using an H ∞ -based framework. It shows that under this framework, the convergence condition is enabled to be delay-dependent and have a formulation in terms of linear matrix inequalities (LMIs). Moreover, formulas for the updating law design can be derived by directly solving LMIs. A numerical example is provided to verify that the delay-dependent condition in LMI forms is effective in producing monotonically convergent ILC algorithms.

关键词： Convergence Symmetric matrices Robustness Delay Uncertainty Performance analysis Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：