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

International Conference on Estimation, Detection and information Fusion (ICEDIF)

作者： Qingzhen Wen Yan Zhou Lan Hu Jianxun Li Dongli Wang College of Information Engineering Xiangtan University Xiangtan China Key Laboratory of Intelligent Computing & Information Processing of MOE Xiangtan China Department of Automation Shanghai Jiao Tong University Shanghai China

Target tracking is one of the most important applications for wireless sensor networks (WSNs). It is usually assumed that the knowledge of the sensor nodes' position is known precisely. However, practically nodes are randomly deployed without prior knowledge about their own positions. In this situation, simultaneous localization and tracking (SLAT) is necessary and is receiving more and more research interest during the last few years. In this paper, several popular and practical filtering techniques are reviewed and compared for the problem of SLAT, including extended Kalman filtering (EKF), unscented Kalman filtering (UKF), and interactive multiple model (IMM). Simulation examples are included to demonstrate the superiority and shortcoming of each method. Results show that compared with other methods, IMM based on UKFs has better accuracy in both localization and tracking, as well as higher robustness.

关键词： Mathematical model Filtering Accuracy Noise Computational modeling Robustness Noise measurement

来源：评论

学校读者我要写书评

暂无评论

An improved entity similarity measurement method

引用

Telkomnika (Telecommunication computing Electronics and Control) 2014年第4期12卷 1017-1022页

作者： Lv, Gang Zheng, Cheng Chen, Sheng-Bing Key of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui China Key Laboratory of Network and Intelligent Information Processing Hefei University Hefei Anhui China

To facilitate the integration of learning resources categorized under different ontology representations, the techniques of ontology mapping can be applied. Though many algorithms and systems have been proposed for ontology mapping, they do not have an automatic weighting strategy on class features to automate the ontology mapping process. A novel method of computing the feature weights is proposed. By feature semantic analysis, the different entities similarity calculation model and weight calculation model were defined. The results show that it makes the ontology mapping process more automatic while retaining satisfying accuracy. Improve ontology mapping effectiveness.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Research on Integrated Utilization of Multi-resources Energy in intelligent Building DC Microgrid based on OpenADR

Research on Integrated Utilization of Multi-resources Energy...

引用

International Conference on Electric Utility Deregulation and Restructuring and Power Technologies

作者： Lingzhi Yi Minghui Fan Jijun Li Genping Wang Key Laboratory of Intelligent Computing & Information Processing Ministry of Education (Xiangtan University) Xiangtan Hunan China Department of Mechanical & Electricity Shenzhen Polytechnic Shenzhen Guangdong China

ISBN: (纸本)9781467371070

In distributed energy hybrid power system of intelligent building, Multi-input DC/DC converter has many advantages, simplifying the dynamic interface to the system for distributed power and playing voltage Boost or Buck more effectively in the system. Based on OpenADR communication protocol and according to electricity prices, the system load can be adjusted by the intelligent controller for the economic optimal goal Besides, an intelligent building DC Micro-grid simulation in which the Wind-PV-diesel battery hybrid power system also realized will be presented so as to increase accesses of distributed energy.

关键词： Open Auto-Dynamic Demand (OpenADR) intelligent Building DC Micro-grid Multi-inputs DC/DC Converter Mul-ti-resources Energy Smart Grid Interoperability

来源：评论

学校读者我要写书评

暂无评论

An improved performance metric for multiobjective evolutionary algorithms with user preferences

An improved performance metric for multiobjective evolutiona...

引用

Congress on Evolutionary Computation

作者： Guo Yu Jinhua Zheng Xiaodong Li School of Information Engineering Xiangtan University Hunan China School of Information Engineering Key Laboratory of Intelligent Computing Information Processing of Ministry of Education Hunan China School of Computer Science and IT RMIT University Melbourne Australia

ISBN: (纸本)9781479974931

This paper proposes an improved performance metric for multiobjective evolutionary algorithms with user preferences. This metric uses the idea of decomposition to transform the preference information into m+1 points on a constructed preference-based hyperplane, then calculates the Euclidean distances and the angles between the obtained solutions by algorithms and those obtained m+1 points, respectively. By means of these distances and angles, the proposed metric can evaluate effectively both the convergence and diversity of the obtained solution set, with consideration of the preference information. This makes easier and allows meaningful comparisons between different multiobjective evolutionary algorithms using preference information.

关键词： Measurement

来源：评论

学校读者我要写书评

暂无评论

An Improved Precoding of Approximative Matrix Inverse Computations Based on Norm Minimization Algorithm in Massive MIMO System

An Improved Precoding of Approximative Matrix Inverse Comput...

引用

2015 IEEE International Conference on Progress in Informatics and computing(PIC 2015)

作者： Hongliu Tu Yanjun Hu Yaohua Xu Fengrong Li Key laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information TechnologyChinese Academy of Sciences

In massive multiple-input multiple-output（MIMO） system, scaling up the antennas of base station（BS） has a clear benefit on sum rate and energy efficiency, but the signal processing complexity can be very high and many algorithms cannot be implemented in practice for high hardware cost. Approximati ve Matrix Inverse Computations（AMIC） algorithm is a kind of lowcomplexity precoding for large multiuser MIMO systems, but the Bite Error Rate（BER） performance is shown to be not better than the classical MMSE precoding. To improve the BER performance of AMIC algorithm, in this paper, we use norm minimization algorithm to change the coefficient of the precoding matrix to improve the BER performance of AMIC algorithm. It can verify that the proposed algorithm can achieve better BER performance than the AMIC algorithm by using only a limited number of Neumann series iterations, and keep lower complexity. The proposed scheme is a compromise solution between complexity and BER performance.

关键词： Massive MIMO linear precoding algorithm approximative matrix inverse norm minimization

来源：评论

学校读者我要写书评

暂无评论

Fixed-lag cubature Rauch-tung-striebel smoother

引用

Journal of Computational information Systems 2014年第16期10卷 6795-6805页

作者： Zou, Juan Pei, Tingrui Zhou, Yan Long, Jiachuan College of Information Engineering Xiangtan University Xiangtan China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan China

A new Rauch-tung-striebel form of the fixed-lag cubature Kalman smoother has been developed for nonlinear state-space models by adopting cubature transformation for optimal smoothing. This new smoother differs from the previously proposed fixed-interval cubature Kalman smoother, in which the current step's smoothing calculation is based on the current step's filtering estimate and the next step's smoothing estimate. In this research, we introduce a fixed-lag cubature Kalman smoother that uses all filtering estimates from step k-n to k to correct the estimate in step k-n by backward iteration, given that n is the lag, and k is the current step. Derived smoothing equations here are approximated to the formal Bayesian optimal smoothing equations. The effect of different n values on smoothing estimate is investigated and an example is used to demonstrate the new algorithm's performance. 1553-9105/Copyright © 2014 Binary information Press

关键词： State space methods

来源：评论

学校读者我要写书评

暂无评论

Corrections to “Cross-Modal Correlation Learning by Adaptive Hierarchical Semantic Aggregation” [Jun 16 1201-1216]

引用

IEEE Transactions on Multimedia 2016年第10期18卷 2127-2127页

作者： Yan Hua Shuhui Wang Siyuan Liu Anni Cai Qingming Huang School of Information Engineering Communication University of China Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Smeal College of Business Pennsylvania State University University Park PA USA Center of Cloud Computing Institute of Advanced Computing and Digital Engineering Shenzhen Institutes of Advanced Technology Shenzhen China Department of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China University of Chinese Academy of Sciences Beijing China Key Laboratory of Intellectual Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Presents corrections to the paper, "Cross-modal correlation learning by adaptive hierarchical semantic aggregation," (Hua, Y., et al) IEEE Trans. Multimedia, vol. 18, no. 6, pp. 1201-1216, Jun. 2016.

关键词： Semantics Learning (artificial intelligence) Ontologies Query processing

来源：评论

学校读者我要写书评

暂无评论

A sound and complete R-calculi with respect to contraction and minimal change

引用

Frontiers of Computer Science 2014年第2期8卷 184-191页

作者： Wei LI Yuefei SUI State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

AGM postulates are for belief revision （revision by a single belief）, and DP postulates are for iterated revision （revision by a finite sequence of beliefs）. R-calculus is given for R-configurations △｜Г, where △ is a set of atomic formulas or the negations of atomic formulas, and Г is a finite set of formulas. We shall give two R-calculi C and M （sets of de- duction rules） such that for any finite consistent sets Г, △of formulas in the propositional logic, there is a consistent set ⊙ Г C of formulas such that △IГ → △, ⊙ is provable and⊙ is a contraction of F by A or a minimal change of F by A; and prove that C and M are sound and complete with respect to the contraction and the minimal change, respectively.

关键词： belief revision R-calculus minimal change,contraction

来源：评论

学校读者我要写书评

暂无评论

Parallel knowledge acquisition algorithm for big data using MapReduce

Parallel knowledge acquisition algorithm for big data using ...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jin Qian Min Xia Ping Lv Jiangsu Key Laboratory of Big Data Analysis Technology/B-DAT Nanjing University of Information Science & Technology Nanjing China Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology Changzhou China

ISBN: (纸本)9781467372220

With the rapid growth of data volume, knowledge acquisition for big data has become a new challenge. To address this issue, the hierarchical decision table is defined and implemented in this work. The properties of different hierarchical decision tables are discussed under the different granularity of conditional attributes. A novel knowledge acquisition algorithm for big data using MapReduce is proposed. Experimental results demonstrate that the proposed algorithm is able to deal with big data and mine hierarchical decision rules under the different granularity.

关键词： Big Data Hierarchical Rough Set Knowledge Acquisition MapReduce big data information Extraction Decision tables

来源：评论

学校读者我要写书评

暂无评论

XGRouter: high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of Computer Science 2015年

作者： Liu, Genggeng Guo, Wenzhong Li, Rongrong Niu, Yuzhen Chen, Guolong College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

This paper presents a high-quality very large scale integration (VLSI) global router in X-architecture, called XGRouter, that heavily relies on integer linear programming (ILP) techniques, partition strategy and particle swarm optimization (PSO). A new ILP formulation, which can achieve more uniform routing solution than other formulations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing region is extended progressively from the most congested region. In the post-processing stage of XGRouter, maze routing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global routing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global routers, XGRouter has no overflow. © 2015 Higher Education Press and Springer-Verlag Berlin Heidelberg

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：