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

Dynamic anti-windup design for anticipatory activation:enlargement of the domain of attraction

Science China(Information Sciences) 2014年第1期57卷 164-177页

作者： WU XiongJun LIN Zongli Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information ProcessingMinistry of Education of China The 802 Institute of Shanghai Academy of Space Flight Technology The Eighth Academy of China Aerospace Science and Technology Corporation Charles L. Brown Department of Electrical and Computer Engineering University of Virginia

Traditional anti-windup compensators are designed for activation immediately at the occurrence of actuator ***,anti-windup compensators were designed for actuation either after the saturation has reached a certain level or in anticipation of its *** the case of static anti-windup compensators,it has been shown that an anti-windup compensator designed for activation in anticipation of actuator saturation would lead to better performance than those designed for immediate or delayed activation could,both in terms of transient performance and the size of the domain of *** recently,it has been shown that a dynamic anti-windup compensator designed for anticipatory activation would also result in better transient performance than those designed for immediate or delayed activation *** this paper,we design dynamic anti-windup compensators for the enlargement of the domain of *** compensators are designed respectively for immediate,delayed and anticipatory *** will show by simulation that a dynamic anti-windup compensator designed for anticipatory activation would result in a larger domain of attraction than a dynamic anti-windup compensator designed for immediate or delayed activation could.

关键词： actuator saturation anti-windup anticipatory activation domain of attraction dynamic com-pensator

来源：评论

学校读者我要写书评

暂无评论

Effect of channel aging on the sum rate of uplink massive MIMO systems

Effect of channel aging on the sum rate of uplink massive MI...

引用

IEEE International Symposium on Information Theory

作者： Chuili Kong Caijun Zhong Anastasios K. Papazafeiropoulos Michail Matthaiou Zhaoyang Zhang Institute of Information and Communication Engineering Zhejiang University Hangzhou China National Mobile Communications Research Laboratory Southeast University Nanjing China Communications and Signal Processing Group Imperial College London London U.K Department of Signals and Systems Chalmers University of Technology Gothenburg Sweden Electrical Engineering and Computer Science Queen's University Belfast Belfast U.K

ISBN: (纸本)9781467377058

This paper investigates the achievable sum-rate of uplink massive multiple-input multiple-output (MIMO) systems considering a practical channel impairment, namely, aged channel state information (CSI). Taking into account both maximum ratio combining (MRC) and zero-forcing (ZF) receivers at the base station, we present tight closed-form lower bounds on the sum-rate for both receivers, which provide efficient means to evaluate the sum-rate of the system. More importantly, we characterize the impact of channel aging on the power scaling law. Specifically, we show that the transmit power of each user can be scaled down by 1/√(M), which indicates that aged CSI does not affect the power scaling law; instead, it causes only a reduction on the sum rate by reducing the effective signal-to-interference-and-noise ratio (SINR).

关键词： Aging MIMO Receivers Uplink Channel estimation Antennas Training

来源：评论

学校读者我要写书评

暂无评论

Exascale Storage Systems the SIRIUS Way

引用

Journal of Physics: Conference Series 2016年第1期759卷

作者： S A Klasky H Abbasi M Ainsworth J Choi M Curry T Kurc Q Liu J Lofstead C Maltzahn M Parashar N Podhorszki E Suchyta F Wang M Wolf C S Chang M Churchill S Ethier Oak Ridge National Laboratory Oak Ridge TN 37831 USA Department of Electrical Engineering & Computer Science The University of Tennessee Knoxville Knoxville Tennessee 37996 USA School of Computer Science Georgia Institute of Technology Atlanta GA 30332 USA Division of Applied Mathematics Brown University Providence RI 02912 USA Sandia National Laboratories Albuquerque NM 87185 USA Department of Biomedical Informatics Stony Brook University Stony Brook NY 11794 USA Computer Science Department University of California at Santa Cruz Santa Cruz CA 95064 USA Rutgers Discovery Informatics Institute Rutgers University Piscataway NJ 08854 USA Princeton Plasma Physics Laboratory Princeton NJ 08543 USA

As the exascale computing age emerges, data related issues are becoming critical factors that determine how and where we do computing. Popular approaches used by traditional I/O solution and storage libraries become increasingly bottlenecked due to their assumptions about data movement, re-organization, and storage. While, new technologies, such as 'burst buffers', can help address some of the short-term performance issues, it is essential that we reexamine the underlying storage and I/O infrastructure to effectively support requirements and challenges at exascale and beyond. In this paper we present a new approach to the exascale Storage System and I/O (SSIO), which is based on allowing users to inject application knowledge into the system and leverage this knowledge to better manage, store, and access large data volumes so as to minimize the time to scientific insights. Central to our approach is the distinction between the data, metadata, and the knowledge contained therein, transferred from the user to the system by describing 'utility' of data as it ages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Expectation propagation approach to joint channel estimation and decoding for OFDM systems

Expectation propagation approach to joint channel estimation...

引用

2014 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2014

作者： Wu, Sheng Kuang, Linling Ni, Zuyao Lu, Jianhua Huang, Defeng David Guo, Qinghua Department of Electronic Engineering Tsinghua University China Tsinghua Space Center Tsinghua University China Research Institute of Information Technology Tsinghua University China Shenzhen Key Laboratory of Wireless Broadband Communication and Signal Processing China School of Electrical Electronic and Computer Engineering University of Western Australia Australia School of Electrical Computer and Telecommunications Engineering University of Wollongong Australia

ISBN: (纸本)9781479928927

We propose a message-passing algorithm of joint channel estimation and decoding for OFDM systems, where expectation propagation is exploited to deal with channel estimation. Specially, the message updating is formulated into a recursive form. As a result, for system with K subcarriers and L channel taps, only O(K + L) messages need to be tracked, and meanwhile they can be efficiently calculated using FFT with complexity O(K-A- + K log2 K), where -A- denotes the constellation size. Numerical experiments show that our algorithm achieves BER performance within 0.5 dB of the known-channel bound. © 2014 IEEE.

关键词： Orthogonal frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

On YASS’s Non-monotonic Security Performance

引用

Circuits, Systems, and Signal processing 2014年第11期33卷 3527-3537页

作者： Yu, Lifang Zhao, Yao Ni, Rongrong Shi, Yun Qing Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Signal and Information Processing for High-end Printing Equipments Beijing Institute of Graphic Communication Beijing102600 China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States

Recently, researchers have discovered unexpected bumps in the detection rate curve of yet another steganographic scheme (YASS). We refer to this abnormal phenomenon as non-monotonic security performance. This paper first analyzes this abnormality and points out that it is caused by the non-uniformity in probability of coincidence of (Formula presented.) embedding blocks and (Formula presented.) JPEG blocks. Based on this observation, we propose that further randomizing data embedding positions can overcome the non-monotonic security performance. Experimental results have demonstrated a complete removal of bumps in the detection rate curve of YASS after further randomization. © 2014, Springer Science+Business Media New York.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

A cloaking-based approach to protect location privacy in location-based services 33

A cloaking-based approach to protect location privacy in loc...

引用

Proceedings of the 33rd Chinese Control Conference, CCC 2014

作者： Zheng, Jiangyu Tan, Xiaobin Zou, Cliff Niu, Yukun Zhu, Jin CAS Key Laboratory of Technology in Geo-spatial Information Processing and Application System University of Science and Technology of China Hefei230026 China Department of Automation University of Science and Technology of China Hefei230026 China Department of Electrical Engineering and Computer Science University of Central Florida OrlandoFL32816-2362 United States

ISBN: (纸本)9789881563842

With the widespread use of mobile devices, the location-based service (LBS) applications become increasingly popular, which introduces the new security challenge to protect user's location privacy. On one hand, a user expects to report his own location as far as possible away from his real location to protect his location privacy. On the other hand, in order to obtain high quality of service (QoS), users are required to report their locations as accurate as possible. To achieve the dedicated tradeoff between privacy requirement and QoS requirement, we propose a novel approach based on cloaking technique. We also discuss the disadvantage of the traditional general system model and propose an improved model. The basic idea of our approach is to select a sub-area from the generated cloaking area as user's reported location. The sub-area may not contain a user's real location, which prevents an adversary from performing attack with side information. Specifically, by defining an objective function with a novel location privacy metric and a QoS metric, we are able to convert the privacy issue to an optimization problem. Then, location privacy metric and QoS metric are given. To reduce the complexity of the optimization, a heuristic algorithm is proposed. Through privacy-preserving analysis and comparison with related work [8], we demonstrate the effectiveness and efficiency of our approach. © 2014 TCCT, CAA.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Expectation propagation based iterative group wise detection for large-scale multiuser MIMO-OFDM systems

Expectation propagation based iterative group wise detection...

引用

2014 IEEE Wireless Communications and Networking Conference, WCNC 2014

作者： Wu, Sheng Kuang, Linling Ni, Zuyao Lu, Jianhua Huang, Defeng David Guo, Qinghua Department of Electronic Engineering Tsinghua University Beijing China Tsinghua Space Center Tsinghua University Beijing China Research Institute of Information Technology Tsinghua University Beijing China Shenzhen Key Laboratory of Wireless Broadband Communication and Signal Processing Shenzhen China School of Electrical Electronic and Computer Engineering University of Western Australia Australia School of Electrical Computer and Telecommunications Engineering University of Wollongong Australia

ISBN: (纸本)9781479930838

For the spatially correlated multiuser MIMO-OFDM channels, the conventional iterative MMSE-SIC detection suffers from a considerable performance loss. In this paper, we use the factor graph framework to design robust detection algorithms by clustering a group of symbols to combat the spatial correlation and using the principle of expectation propagation to improve message passing. Furthermore, as the complexity of detection becomes one of the issues in the design of large-scale multiuser MIMO-OFDM systems, we propose a low-complexity approximate message-passing algorithm by opening the channel transition node, which eliminates the expensive matrix inversions involved in the MMSE-SIC based algorithms. Finally, numerical results are presented to verify the proposed algorithms. © 2014 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Speaker adaptation of hybrid NN/HMM model for speech recognition based on singular value decomposition

Speaker adaptation of hybrid NN/HMM model for speech recogni...

引用

International Symposium on Chinese Spoken Language processing

作者： Shaofei Xue Hui Jiang Lirong Dai National Engineering Laboratory of Speech and Language Information Processing University of Science and Technology of China Hefei Department of Electrical Engineering and Computer Science York University Toronto Canada

Recently several speaker adaptation methods have been proposed for deep neural network (DNN) in many large vocabulary continuous speech recognition (LVCSR) tasks. However, only a few methods rely on tuning the weight matrices in trained DNNs to optimize system performance since it is very prone to over-fitting especially when some class labels are missing in the adaptation data. In this paper, we propose a new speaker adaptation method for the hybrid NN/HMM speech recognition model based on singular value decomposition (SVD). We apply SVD on the weight matrices in trained DNNs, and then tune diagonal matrices with the adaptation data. This solves the over-fitting problem since we can change the weight matrices slightly by only modifying the singular values. We evaluate the proposed adaptation method in two standard speech recognition tasks, namely TIMIT phone recognition and large vocabulary speech recognition in the Switchboard task. Experimental results have shown that it is effective to adapt large DNN models using only a small amount of adaptation data. For example, the Switchboard results have shown that the proposed SVD-based adaptation method may achieve up to 3-6% relative error reduction using only a few dozens of adaptation utterances per speaker.

关键词： Hidden Markov models Adaptation models Speech recognition Neural networks Speech Matrix decomposition Signal processing

来源：评论

学校读者我要写书评

暂无评论

Publisher's Note: “Defect-induced bandgap narrowing in low-k dielectrics” [Appl. Phys. Lett. 107, 082903 (2015)]

引用

Applied Physics Letters 2015年第13期107卷

作者： X. Guo H. Zheng S. W. King V. V. Afanas'ev M. R. Baklanov J.-F. de Marneffe Y. Nishi J. L. Shohet 1Plasma Processing & Technology Laboratory and Department of Electrical and Computer Engineering University of Wisconsin-Madison Madison Wisconsin 53706 USA 2Logic Technology Development Intel Corporation Hillsboro Oregon 97124 USA 3Department of Physics University of Leuven B-3001 Leuven Belgium 4IMEC Kapeldreef 75 B-3001 Leuven Belgium 5Department of Electrical Engineering Stanford University Stanford California 94305 USA

This article was originally published online on 26 August 2015 with the space missing in the name of the sixth author. The name is correct as it appears above.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust bilinear matrix recovery by Tensor Low-Rank Representation

Robust bilinear matrix recovery by Tensor Low-Rank Represent...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zhao Zhang Shuicheng Yan Mingbo Zhao Fan-Zhang Li Provincial Key Laboratory for Computer Information Processing Technology Soochow University Department of Electrical and Computer Engineering National University of Singapore Singapore Department of Electronic Engineering City University of Hong Kong Kowloon Hong Kong SAR

ISBN: (纸本)9781479914821

For low-rank recovery and error correction, Low-Rank Representation (LRR) row-reconstructs given data matrix X by seeking a low-rank representation, while Inductive Robust Principal Component Analysis (IRPCA) aims to calculate a low-rank projection to column-reconstruct X. But either column or row information of Xis lost by LRR and IRPCA. In addition, the matrix X itself is chosen as the dictionary by LRR, but (grossly) corrupted entries may greatly depress its performance. To solve these issues, we propose a simultaneous low-rank representation and dictionary learning framework termed Tensor LRR (TLRR) for robust bilinear recovery. TLRR reconstructs given matrix X along both row and column directions by computing a pair of low-rank matrices alternately from a nuclear norm minimization problem for constructing a low-rank tensor subspace. As a result, TLRR in the optimizations can be regarded as enhanced IRPCA with noises removed by low-rank representation, and can also be considered as enhanced LRR with a clean informative dictionary using a low-rank projection. The comparison with other criteria shows that TLRR exhibits certain advantages, for instance strong generalization power and robustness enhancement to the missing values. Simulations verified the validity of TLRR for recovery.

关键词： Dictionaries Robustness Noise Face Error correction Tensile stress Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：