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

IEEE International Conference on Networking, Sensing and Control

作者： Bingxiong Shi Junan Lu Jinhu Lu Xinghuo Yu College of Mathematics and Statistics and State Key Laboratory of Software Engineering Wuhan University of China Wuhan China School of Electrical and Computer Engineering RMIT University Melbourne Australia Key Laboratory of Systems and Control Institute of Systems Science Chinese Academy and Sciences Beijing China School of Electrical and Computer Engineering RMIT University Melbourne VIC Australia

ISBN: (纸本)9781424464500;9781424464531

Recently, cluster synchronization has attracted an increasing interest in various disciplines, including mathematics, physics, and engineering sciences. This paper further investigates the cluster synchronization of a complex dynamical network by using adaptive and impulsive control techniques, respectively. Based on a complex dynamical network with two different clusters, several adaptive and impulsive cluster synchronization criteria are then proposed. It should be especially pointed out that the dynamics and its dimensions of the individual dynamical systems are different in the two different clusters. Also, some numerical simulations are given to verify the effectiveness of the above theoretical results.

关键词： Complex networks mathematics Numerical simulation Physics Adaptive systems Programmable control Adaptive control Biology History Technological innovation

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

An associative memory system for incremental learning and temporal sequence

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

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Furao Shen Hui Yu Wataru Kasai Osamu Hasegawa State Key Laboratory for Novel Software Technology Jiangyin Information Technology Research Institute Nanjing University Nanjing China Department of Computer Intelligence and Systems Science Tokyo Institute of Technology Yokohama Japan Imaging Science and Engineering Laboratory Tokyo Institute of Technology Yokohama Japan

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.

关键词： Associative memory Training Context Indexes Prototypes Humans Topology

来源：评论

学校读者我要写书评

暂无评论

Performance Tuning Towards a KVM-Based Low Latency Virtualization System

Performance Tuning Towards a KVM-Based Low Latency Virtualiz...

引用

International Conference on Information engineering and computer science (ICIECS)

作者： Baojing Zuo Kai Chen Alei Liang Haibing Guan Jun Zhang Ruhui Ma Hongbo Yang School of Software Shanghai Jiaotong University Shanghai China School of Information Security Engineering Shanghai Jiaotong University Shanghai China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

Utilizing virtualization technology to combine real-time operating system(RTOS)and off-the-shelf time-sharing general purpose operating system (GPOS)is attracting much more interest *** combination has the potential to provide a large application base,and to guarantee timely deterministic response to real-time applications,yet there is no convincible experimental result about its real-time *** this paper,we analyze the interrupt latency of RTOS running on Linux KVM based on some preliminary tunings,and find out System Management Interrupt (SMI) is the main factor which makes the maximum latency unideal, so we propose a method to limit the worst-case interrupt latency in an acceptable ***,we also find out that boosting priority may result in wastes of CPU resources when RTOS is not executing real-time tasks,so we design a co-scheduling mechanism to improve the CPU throughput of the GPOS system.

关键词： Linux Real time systems Kernel Tuning Throughput Hardware

来源：评论

学校读者我要写书评

暂无评论

A Translation Framework for Virtual Execution Environment on CPU/GPU Architecture

A Translation Framework for Virtual Execution Environment on...

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Guoxing Dong Kai Chen Erzhou Zhu Yichao Zhang Zhengwei Qi Haibing Guan School of Software Shanghai Jiaotong University Shanghai China School of Information Security Engineering Shanghai Jiaotong University Shanghai China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

GPUs are many-core processors with tremendous computational power. However, as automatic parallelization has not been realized yet, developing high-performance parallel code for GPUs is still very challenging. The paper presents a novel translation framework designed for virtual execution environment based on CPU/GPU architecture. It addresses two major challenges of taking advantage of general purpose computation on graphics processing units (GPGPU) to improve performance: no rewriting the existing source code and resolving binary compatibility issues between different GPUs. The translation framework uses semi-automatic parallelization technology to port existing code to explicitly parallel programming models. It not only offers a mapping strategy from X86 platform to CUDA programming model, but also synchronizes the execution between the CPU and the GPUs. The input to our translation framework is parallelizable part of the program within binary code. With an additional information related to the parallelizable part, the translation framework transforms the sequential code into PTX code and execute it on GPUs. Experimental results on several programs from CUDA SDK Code Samples and Parboil Benchmark Suite show that our translation framework could achieve very high performance, even up to several tens of times speedup over the X86 native version.

关键词： Graphics processing unit Registers Kernel Instruction sets Driver circuits Programming computer architecture

来源：评论

学校读者我要写书评

暂无评论

A New Secret Sharing Scheme Based on Commutative Encrypted Function

A New Secret Sharing Scheme Based on Commutative Encrypted F...

引用

International Forum on Information Technology and Applications, IFITA

作者： Jun He Ximei Li Lijuan Li Chunming Tang Computer and Information Engineering Department HuaiHua Vocational and Technical College Huaihua Hunan China School of Computer and Communication Hunan University Changsha Hunan China School of Mathematics and Information Science Guangzhou University Guangzhou Guangdong China State Key Laboratory of Information Security Institute of Software Science Chinese Academy and Sciences Beijing China

With the characteristic that the commutativity of modular exponential function makes the specific order of secret distribution process less important and on basis of the abstruseness of discrete logarithm, this paper proposed a new secret sharing scheme. In the scheme, the participants themselves select the private keys, which can avoid the distributor's fraud and reduce the distribution's burden as well as ensure the scheme's reuse. The credible participants can join in or leave the participants collection at any time without restarting the scheme procedures.

关键词： Encryption computers Performance analysis Presses Data mining

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A New Forward-Secure Proxy Signature Scheme

A New Forward-Secure Proxy Signature Scheme

引用

International Forum on Information Technology and Applications, IFITA

作者： Jun He Ximei Li Lijuan Li Chunming Tang Computer and Information Engineering Department HuaiHua Vocational and Technical College Huaihua Hunan China School of Computer and Communication Hunan University Changsha Hunan China State Key Laboratory of Information Security CAS State Key Laboratory of Information Security Hunan China CAS Institute of Software Science Beijing China School of Mathematics and Information Science Guangzhou University Guangzhou Guangdong China

Based on the shortcomings of WCF scheme, this paper proposed an improved forward-secure proxy signature scheme. The new scheme does not evolve the authorized keys, but the proxy signer's private key, making it have the forward security. Even if the proxy signer's signature key at a certain time segment is given away, the attacker could not get the proxy signer's signature key in the previous time segment. Under these assumptions of strong RSA problem, computational Diffie-Hellman problem being hard, and discrete logarithm problem being hard in a finite field, the scheme has favorable security.

关键词： Digital signatures Public key Mathematical model Equations Authorization computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：