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

1st IFAC Conference on Modelling, Identification and Control of Nonlinear Systems, MICNON 2015

作者： Li, Yuanlong Lin, Zongli Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai200240 China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia CharlottesvilleVA229044743 United States

This paper revisits the problem of estimating the domain of attraction of a saturated system with an algebraic loop. A piecewise quadratic Lyapunov function of an augmented state vector composing of the system state and the saturated input has been proposed for use in estimating the domain of attraction for a saturated system. Considering the relationship between the system states and the saturation function, we propose in this paper a generalized piecewise quadratic Lyapunov function, which results from adding a term that characterizes the regional sector condition of the saturated input to the piecewise quadratic Lypunov function. The matrix associated with the generalized piecewise quadratic Lyapunov function is not required to be positive definite, and thus a set of less conservative stability conditions are established, from which a larger estimate of the domain of attraction can be obtained. Simulation results indicate that the effectiveness and superiority of the proposed method.

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

Robustness to additive noise of locally-normalized cepstral coefficients in speaker verification 16

Robustness to additive noise of locally-normalized cepstral ...

引用

16th Annual Conference of the International Speech Communication Association, INTERSPEECH 2015

作者： Fredes, Josué Novoa, José Poblete, Victor King, Simon Stern, Richard Yoma, Nestor Becerra Speech Processing and Transmission Laboratory Electrical Engineering Department University of Chile Santiago Chile Institute of Acoustics Universidad Austral de Chile Valdivia Chile Centre for Speech Technology Research University of Edinburgh Edinburgh United Kingdom Department of Electrical and Computer Engineering and Language Technologies Institute Carnegie Mellon University PittsburghPA15206 United States

In this paper the performance of a new feature set, Locally Normalized Cepstral Coefficients (LNCC) is evaluated for a speaker verification task with short testing utterances in additive noise. The results presented here show that LNCC outperforms baseline MFCC features when SNR is lower than 15 dB. The average relative reduction in EER achieved by LNCC is 33%. The use of LNCC in combination with spectral subtraction provides a reduction in EER averaging 18% when compared to MFCC features also with spectral subtraction. In addition, sub-band LNCC is proposed to improve the estimation of noise energy and hence the effectiveness of spectral subtraction. When compared with MFCC features, the use of sub-band LNCC led to greater reductions in EER than LNCC with non-stationary noise. Copyright © 2015 ISCA.

关键词： Additive noise

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional euler PCA for face recognition 21

Two-dimensional euler PCA for face recognition

引用

21st International Conference on MultiMedia Modeling, MMM 2015

作者： Tan, Huibin Zhang, Xiang Guan, Naiyang Tao, Dacheng Huang, Xuhui Luo, Zhigang Science and Technology on Parallel Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan410073 China Centre for Quantum Computation and Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia

ISBN: (纸本)9783319144412

Principal component analysis (PCA) projects data on the directions with maximal variances. Since PCA is quite effective in dimension reduction, it has been widely used in computer vision. However, conventional PCA suffers from following deficiencies: 1) it spends much computational costs to handle high-dimensional data, and 2) it cannot reveal the nonlinear relationship among different features of data. To overcome these deficiencies, this paper proposes an efficient two-dimensional Euler PCA (2D-ePCA) algorithm. Particularly, 2D-ePCA learns projection matrix on the 2D pixel matrix of each image without reshaping it into 1D long vector, and uncovers nonlinear relationships among features by mapping data onto complex representation. Since such 2D complex representation induces much smaller kernel matrix and principal subspaces, 2D-ePCA costs much less computational overheads than Euler PCA on large-scale dataset. Experimental results on popular face datasets show that 2D-ePCA outperforms the representative algorithms in terms of accuracy, computational overhead, and robustness. © Springer International Publishing Switzerland 2015.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Non-negative low-rank and group-sparse matrix factorization 21

Non-negative low-rank and group-sparse matrix factorization

引用

21st International Conference on MultiMedia Modeling, MMM 2015

作者： Wu, Shuyi Zhang, Xiang Guan, Naiyang Tao, Dacheng Huang, Xuhui Luo, Zhigang Science and Technology on Parallel Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan410073 China Centre for Quantum Computation & Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia

ISBN: (纸本)9783319144412

Non-negative matrix factorization (NMF) has been a popular data analysis tool and has been widely applied in computer vision. However, conventional NMF methods cannot adaptively learn grouping structure froma *** paper proposes a non-negative low-rank and group-sparse matrix factorization (NLRGS) method to overcome this deficiency. Particularly, NLRGS captures the relationships among examples by constraining rank of the coefficients meanwhile identifies the grouping structure via group sparsity regularization. By both constraints, NLRGS boosts NMF in both classification and clustering. However, NLRGS is difficult to be optimized because it needs to deal with the low-rank constraint. To relax such hard constraint, we approximate the low-rank constraint with the nuclear norm and then develop an optimization algorithm for NLRGS in the frame of augmented Lagrangian method(ALM). Experimental results of both face recognition and clustering on four popular face datasets demonstrate the effectiveness of NLRGS in quantities. © Springer International Publishing Switzerland 2015.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Completion time-a ware flow scheduling in heterogenous networks 1

引用

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： He, Shiming Xie, Kun Zhang, Dafang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook NY United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In China, the expressway isn’t free. When a vehicle exits, the exit toll station needs to calculate the toll according to the vehicle trajectory obtained by sending a trajectory query task to the trajectory center remotely. For the accurate of toll and keep the exit smoothly, transmitting the trajectory result reliably and in time is a key issue. There are three heterogenous networks in expressway, Fibernet, Telecommunications Network and 3G. We concurrently exploit three heterogenous networks by allocating the trajectory result into three sub-flows where each sub-flow is transmitted in one kind of networks. But existing multipath transfer solution(FMTCP) doesn’t consider the difference of completed time among all sub-flows and can’t make sure the completed time in time. Therefore, we formulate the sub-flows schedule as a integer programming problem, which is proved to be NP-hard problem, and propose a Completion time-aware Flow Scheduling scheme (CaFS) which calculates the size of sub-flows. For the reliably, it exploits generation-based network coding. For the transmission in time, CaFS allocates the size of sub-flow into suitable generation and scheduling the generations. The simulation results demonstrate that, comparing with the FMTCP, CaFS improves 31. 9% in completion time and 30% in task finished rate. © Springer International Publishing Switzerland 2015.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Memory Access Analysis of Many-core System with Abundant Bandwidth

Memory Access Analysis of Many-core System with Abundant Ban...

引用

IEEE International Symposium on Embedded Multicore Socs (MCSoC)

作者： Chuan Tang Dan Liu Zuocheng Xing Peng Yang Zhe Wang Jiang Xu Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong China

ISBN: (纸本)9781479986712

Many-core system is main architecture trend currently. One of the dominating challenges for on-chip manycore system is the memory wall. However traditional research primarily focus on the limited bandwidth. To solve this problem, many-core system is aided with large cache, and a lot of complex approaches about memory and cache are adopted aiming at relaxing the pressure of bandwidth and improving the efficiency of cache. All these methods generate much cost of area and power. In this paper, we are motivated by the feature of abundant bandwidth and low latency of optical interconnect. We analyze the characteristics of memory access on 64 cores system under the case of high bandwidth which can be assumed to benefit from optical interconnect, considering the sensibility with bandwidth and cache for different benchmarks. Finally, we discuss about promising basic frameworks suitable for manycore system with optical interconnect.

关键词： Bandwidth Benchmark testing Optical interconnections Random access memory Delays Hidden Markov models computers

来源：评论

学校读者我要写书评

暂无评论

A new logistic map based chaotic biogeography-based optimization approach for cluster analysis

A new logistic map based chaotic biogeography-based optimiza...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Shui-Hua Wang Hui-Min Lu Yu-Jie Li Yang Wang Zhi-Min Chen Yu-Min Wei Wen-Juan Jia Fang-Yuan Liu Yu-Dong Zhang Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Policy Academy Changsha Hunan China School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu China Department of Electrical Engineering CUNY New York NY USA Department of Mechanical and Control Engineering Kyushu Institute of Technology Fukuoka Prefecture Japan School of Information Engineering Yangzhou University Yangzhou Jiangsu China School of Physics and Electronic Engineering Taizhou University Taizhou Zhejiang China School of Electronic Information Shanghai Dianji University Shanghai China School of Energy and Mechanical Engineering Nanjing Normal University Nanjing Jiangsu China Key Laboratory of Intelligent Computing and Information Processing in Fujian Provincial University Quanzhou Normal University Quanzhou Fujian China

ISBN: (纸本)9781509034857

Cluster analysis is important in scientific and industrial fields. In this study, we proposed a novel chaotic biogeography-based optimization (CBBO) method, and applied it in centroid-based clustering methods. The results over three types of simulation data showed that this proposed CBBO method gave better performance than chaotic particle swarm optimization, genetic algorithm, firefly algorithm, and quantum-behaved particle swarm optimization. In all, our CBBO method is effective in centroid-based clustering.

关键词： Genetic algorithms Optimization Clustering algorithms Particle swarm optimization Algorithm design and analysis Logistics Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Face recognition under pose variation with active shape model to adjust Gabor filter kernels and to correct feature extraction location

Face recognition under pose variation with active shape mode...

引用

International Conference on Automatic Face and Gesture Recognition

作者： Leonardo A. Cament Francisco J. Galdames Kevin W. Bowyer Claudio A. Perez Department of Electrical Engineering and the Advanced Mining Technology Center Image Processing Laboratory Universidad de Chile Chile Department of Computer Science and Engineering University of Notre Dame IN USA

Gabor features have been used widely in face identification because of their good results and robustness. However, face identification is strongly affected when the test images are very different from those of the gallery, as is the case in varying face pose. In this paper, a new 2D Gabor-based method is proposed that modifies the grid from which the Gabor features are extracted using a mesh to model face deformations produced by varying pose. Also the Gabor filter kernels are modified by the deformation field computed using the active shape model adjusted to the face. Therefore, the position of the Gabor jets with respect to the face features (eyes, nose, mouth, etc.) is closer to the original position in the frontal face and the modified Gabor filter kernel adjusts to the varying pose. Our method incorporates blocks for illumination compensation by a Local Normalization method, and entropy-weighted Gabor features to emphasize those features that yield proper identification. The method was assessed on the FERET database including pose variations for ±60°, ±40°, ±25°, ±15°, and 0°. We compared our results to those previously published for 2D methods. Our proposed method achieved the highest classification accuracy on the FERET database.

关键词： Face Shape Databases Gabor filters Feature extraction Face recognition Robustness

来源：评论

学校读者我要写书评

暂无评论

High-energy-density electron beam from interaction of two successive laser pulses with subcritical-density plasma

引用

Physical Review Accelerators and Beams 2016年第2期19卷 021301-021301页

作者： J. W. Wang W. Yu M. Y. Yu H. Xu J. J. Ju S. X. Luan M. Murakami M. Zepf S. Rykovanov Helmholtz Institute Jena Jena 07743 Germany State Key Laboratory of High Field Laser Physics Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation and the Department of Physics Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Institute of Laser Engineering Osaka University Osaka 565-0871 Japan Centre for Plasma Physics School of Mathematics and Physics Queen’s University Belfast Belfast BT7 1NN United Kingdom

It is shown by particle-in-cell simulations that a narrow electron beam with high energy and charge density can be generated in a subcritical-density plasma by two consecutive laser pulses. Although the first laser pulse dissipates rapidly, the second pulse can propagate for a long distance in the thin wake channel created by the first pulse and can further accelerate the preaccelerated electrons therein. Given that the second pulse also self-focuses, the resulting electron beam has a narrow waist and high charge and energy densities. Such beams are useful for enhancing the target-back space-charge field in target normal sheath acceleration of ions and bremsstrahlung sources, among others.

关键词： Plasma acceleration & new acceleration techniques

来源：评论

学校读者我要写书评

暂无评论

Sum-Rate and Power Scaling of Massive MIMO Systems with Channel Aging

Sum-Rate and Power Scaling of Massive MIMO Systems with Chan...

引用

作者： Kong, Chuili Zhong, Caijun Papazafeiropoulos, Anastasios K. Matthaiou, Michail Zhang, Zhaoyang Institute of Information and Communication Engineering Zhejiang University Hangzhou310027 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Department of Communications and Signal Processing Group Imperial College London London United Kingdom School of Electronics Electrical Engineering and Computer Science Queen's University Belfast Belfast United Kingdom

This paper investigates the achievable sum-rate of massive multiple-input multiple-output (MIMO) systems in the presence of channel aging. For the uplink, by assuming that the base station (BS) deploys maximum ratio combining (MRC) or zero-forcing (ZF) receivers, we present tight closed-form lower bounds on the achievable sum-rate for both receivers with aged channel state information (CSI). In addition, the benefit of implementing channel prediction methods on the sum-rate is examined, and closed-form sum-rate lower bounds are derived. Moreover, the impact of channel aging and channel prediction on the power scaling law is characterized. Extension to the downlink scenario and multicell scenario is also considered. It is found that, for a system with/without channel prediction, the transmit power of each user can be scaled down at most by 1/√M (where M is the number of BS antennas), which indicates that aged CSI does not degrade the power scaling law, and channel prediction does not enhance the power scaling law;instead, these phenomena affect the achievable sum-rate by degrading or enhancing the effective signal to interference and noise ratio, respectively. © 2015 IEEE.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：