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

Evolutionary Self-learning Scheduling Approach for Wireless Sensor Network

Evolutionary Self-learning Scheduling Approach for Wireless ...

2010 International Conference on intelligent Computation technology and Automation(2010 智能计算技术与自动化国际会议 ICICTA 2010)

作者： Jianjun Niu 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 Beijing Special Engineering Design and Resear

Energy efficiency is very important for wireless sensor network (WSN). This paper presents an evolutionary self-learning scheduling approach (ESSA) to reduce energy consumption for WSN. The ESSA is based on a new proposed scheme - evolutionary Q-learning with continuousaction (EQC) approach, which combines an extension of Q-learning method with particle swarm optimization (PSO) algorithm. The action space of EQC is partitioned into lots of subintervals. And each endpoint of the subintervals is characterized by a discrete action value and a Q-value. The continuous action value is the weighted average of discrete actions according to their Q values. The PSO algorithm is combined to let an agent profit the experience of other agents. We valid the ESSA in a MAC protocol and simulation results show that the ESSA is an effective method and performs much better than SMAC protocol.

关键词： Wirless Sensor Network Scheduling Q-Learning Particle Swarm Optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-objective dynamic programming algorithm for aircraft arrival sequencing and runway scheduling

引用

Kongzhi Lilun Yu Yingyong/Control Theory and Applications 2010年第7期27卷 827-835页

作者： Ying, Sheng-Gang Sun, Fu-Chun Hu, Lai-Hong Liu, Hua-Ping Zhang, Xue-Jun State Key Laboratory of Intelligent Technology and Systems Tsinghua University Beijing 100084 China The Second Artillery Engineering College Xi'an Shaanxi 710025 China School of Instrumentation Science and Optoelectronics Engineering Beihang University Beijing 100191 China

Optimization of runway scheduling for aircraft landings plays an important role in modern air traffic control, by maximizing throughput of an airport and minimizing fuel cost of aircrafts. As a nondeterministic polynomialcomplete(NP-C) problem, the runway scheduling of a considerable number of aircrafts in a multirunway airport hasn't been effectively solved. Because of considerable computation required by the traditional dynamic programming algorithm under constrained position shifting(CPS), we can only sequence aircrafts and schedule the time of arrival in a single-runway airport. This paper presents a new dynamic programming algorithm by changing the way of recurrence and combining the traditional one with several other methods including a greedy algorithm. Our algorithm can solve the problem of multirunway scheduling with multi-object efficiently and effectively. A large number of experiments show that the complexity of the algorithm is almost linearly proportional to the number of aircrafts, and the algorithm can optimize both throughput and landing cost simultaneously in a short period of time.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Locally indistinguishable subspaces spanned by three-qubit unextendible product bases

引用

Physical Review A 2010年第3期81卷 032329-032329页

作者： Runyao Duan Yu Xin Mingsheng Ying Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia 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 100084 People's Republic of China Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Department of Physics Tsinghua University Beijing 100084 People's Republic of China

We study the local distinguishability of general multiqubit states and show that local projective measurements and classical communication are as powerful as the most general local measurements and classical communication. Remarkably, this indicates that the local distinguishability of multiqubit states can be decided efficiently. Another useful consequence is that a set of orthogonal n-qubit states is locally distinguishable only if the summation of their orthogonal Schmidt numbers is less than the total dimension 2n. Employing these results, we show that any orthonormal basis of a subspace spanned by arbitrary three-qubit orthogonal unextendible product bases (UPB) cannot be exactly distinguishable by local operations and classical communication. This not only reveals another intrinsic property of three-qubit orthogonal UPB but also provides a class of locally indistinguishable subspaces with dimension 4. We also explicitly construct locally indistinguishable subspaces with dimensions 3 and 5, respectively. Similar to the bipartite case, these results on multipartite locally indistinguishable subspaces can be used to estimate the one-shot environment-assisted classical capacity of a class of quantum broadcast channels.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Self-learning Scheduling Approach for Wireless Sensor Network

Self-learning Scheduling Approach for Wireless Sensor Networ...

引用

The 2010 2nd International Conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

ISBN: (纸本)9781424458219;9781424458240

Energy efficiency is one of key issues of wireless sensor network (VVSN). In this paper, we propose a self-learning scheduling approach (SSA) to reduce energy consumption for wireless sensor network (WSN). This approach integrates sleep scheduling together with packet transmission scheduling to reduce energy consumption. It enables nodes to learn continuous transmission parameters and sleep parameter through interacting with the WSN. The continuous value of transmission parameter is achieved by our extension of Q-learning method, and the value of sleep parameter can be calculated from the transmission parameter. We valid this approach in a MAC protocol and compare some network performances between the SSA and SMAC protocol. The simulation results show that our SSA performs much better than SMAC protocol in these QoS metrics.

关键词： Wireless sensor network scheduling reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE SPECTRAL DOPPLER ESTIMATION BASED ON RLS ALGORITHM

ADAPTIVE SPECTRAL DOPPLER ESTIMATION BASED ON RLS ALGORITHM

引用

2010 IEEE Youth Conference on Information,Computing and Telecommunications(2010 IEEE青年信息、计算和通信技术大会)

作者： Zhong Chen Mingchang Zhao State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Informat R&D Department Chison Medical Imaging Co. Ltd. Wuxi China 214028

In this paper, an adaptive spectral doppler estimation based on recursive least squares (RLS) algorithm is proposed for blood velocity distribution estimation. The purpose is to (i) minimize the observation window needed to estimate the spectral distribution and get better temporal resolution, (ii) adaptive estimate the spectral distribution using the current data. An optimization problem is built and solved by matrix gradient method and Matrix Inversion Lemma to get the optimal weighting *** and adaptive realization. Simulation results illustrate that the proposed scheme can *** realize the purpose.

关键词： Doppler estimation RLS FFT Windowed FFT Blood velocity distribution

来源：评论

学校读者我要写书评

暂无评论

An adaptive modeling approach based on ESN for robotic belt grinding

An adaptive modeling approach based on ESN for robotic belt ...

引用

International Conference on Information and Automation (ICIA)

作者： Hongbo Lv Yixu Song Peifa Jia Zhongxue Gan Lizhe Qi State Key Laboratory of Intelligent Technology and System Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China Inter Smart Robotic Systems Company Limited Langfang Hebei China

ISBN: (纸本)9781424457014

Robotic belt grinding system has good prospect to release hand-grinder from their dirty and noisy working environment. However, as a kind of non-rigid processing system, it is a challenge to model its processes precisely for free-form surface because its performance is unstable due to a variety of factors, such as belt wear and belt replacement. In order to adapt to the variability, an adaptive modeling approach based on echo state network (ESN) is presented, whose major idea is to exhaust information from new data by using sliding window technique to select training samples. With machine learning paradigm this approach is more flexible than traditional ones which often base on formula and experimental curves. Experimental results of grinding turbine blades demonstrate this approach is workable and effective.

关键词： Belts Service robots Computational geometry Robotics and automation intelligent robots Turbines Blades Mobile robots Working environment noise Grinding machines

来源：评论

学校读者我要写书评

暂无评论

Multipartite-to-bipartite entanglement transformations and polynomial identity testing

引用

Physical Review A 2010年第5期81卷 052310-052310页

作者： Eric Chitambar Runyao Duan Yaoyun Shi Physics Department University of Michigan 450 Church Street Ann Arbor Michigan 48109-1040 USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia and 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 100084 People’s Republic of China Department of Electrical Engineering and Computer Science University of Michigan 2260 Hayward Street Ann Arbor Michigan 48109-2121 USA

We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Robust semantic sketch based specific image retrieval

Robust semantic sketch based specific image retrieval

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Cailiang Liu Dong Wang Xiaobing Liu Changhu Wang Lei Zhang Bo Zhang State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory of Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China Hulu LLC Beijing China Web Search & Mining Group Microsoft Research Asia Beijing China

Specific images refer to images one has a certain episodic memory about, e.g. a picture one has ever seen before. Specific image retrieval is a frequent daily information need and the episodic memory is the key to find a specific image. In this paper, we propose a novel semantic sketch-based interface to incorporate the episodic memory for specific image retrieval. The interface allows a user to specify the semantic category and rough area/color of the objects in his memory. To bridge the semantic gap between the query sketch and database images, in the back end, a sampling method selects exemplars from a reference dataset which contains many object instances with user-provided tags and bounding boxes. After that, an exemplar matching algorithm ranks images to retrieve the target image to match the user's memory. In practice, we have observed that query sketches are usually error prone. That is, the position or the color of an object may not be accurate. Meanwhile, the annotations in the reference dataset are also noisy. Thus, the search algorithm has to handle two kinds of errors: 1) reference dataset label noise; 2) user sketch error such as position or scale. For the former, we propose a robust sampling method. For the latter, we derive an efficient spatial reranking algorithm to tolerate inaccurate user sketches. Detailed experimental results on the LabelMe dataset show that the proposed approach is robust to both kinds of errors.

关键词： Semantics Histograms Image color analysis Robustness Image retrieval Sampling methods Noise

来源：评论

学校读者我要写书评

暂无评论

Hybrid state space and echo state networks model of a miniature helicopter

Hybrid state space and echo state networks model of a miniat...

引用

作者： Tan, Li Song, Yixu Jia, Peifa State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9787894631046

To solve the problem of modeling the horizontal translational motion of a Raptor 30 based miniature helicopter near hovering, a black-box model is built based on echo state networks. Combined with a state space angular motion model, a four-degree-of-freedom hybrid model is created. System identification is done using the remote control experiment data. Model validation results demonstrate that the model can predict the motion of the miniature helicopter near hovering on the whole. The model can be used to optimize parameterized controller. Closed-loop simulation further validates the model.

关键词： Remote control

来源：评论

学校读者我要写书评

暂无评论

Universal Approximation of TS Fuzzy systems Constructed Dynamically-MISO Cases

Universal Approximation of TS Fuzzy Systems Constructed Dyna...

引用

American Control Conference

作者： ShiYu Yan ZengQi Sun Zhe Li State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 P.R. China Central University of Finance and Economics Beijing 100081 P.R. China

ISBN: (纸本)9781424474264

Study on approximation capabilities of fuzzy systems has been an important and hot issue for many years. Many existing studies on fuzzy systems based on standard affine TS fuzzy models suffer seriously from curse of dimensionality though such models are relatively simple to construct;whereas other investigations based on hierarchical fuzzy models have to face the difficulty of relatively more complexity. Through utilizing the dynamic partition along all dimensions, this paper proposes a novel dynamically constructive method in MISO cases to construct fuzzy systems based on standard affine TS fuzzy models, which have simple structures and also can ease the serious curse of dimensionality greatly. Correspondingly, new sufficient conditions for a affine TS fuzzy system as an universal approximator are obtained. The situation in 2ISO cases is derived first which is then extended to general MISO cases. Theoretical analyses comparing to some typical methods and several numerical examples all confirm that the dynamic method in this paper can reduce the fuzzy rules number dramatically and therefore can ease the serious curse of dimensionality to some extent. Some conclusions and discussions on further work are also given.

关键词： Fuzzy systems Curse of Dimensionality transport stream Fuzzy simple structures dynamic method Affine In-law

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：