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

Kalman Filtering with Unknown Sensor Measurement Losses

IFAC-PapersOnLine 2016年第22期49卷 315-320页

作者： Zhang, Jiaqi You, Keyou Department of Automation and Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing100084 China

This work studies the state estimation problem of a networked linear system where a sensor and an estimator are connected via a lossy network. If the measurement loss is known to the estimator, the minimum variance estimate is easily computed by the intermittent Kalman filter (IKF). However, this does not hold for the case of unknown measurement losses, and we have to address the non-Gaussianity/non-linearity of the networked system. By exploiting the measurement loss process and the IKF, we design three recursive suboptimal filters for state estimation, i.e., BKF-I, BKF-II and RBPF. The BKF-I is based on the MAP estimator of the loss process and the BKF-II is derived by an estimate of the conditional loss probability. The RBPF is an effective sequential importance sampling algorithm by marginalizing out the loss process. A target tracking example is included to illustrate their effectiveness and shows the tradeoff between computation complexity and estimation accuracy of the proposed filters. © 2016

关键词： Kalman filters Importance sampling Linear systems State estimation Target tracking computation complexity Conditional loss probability Estimation problem Networked systems Particle filter Sensor measurements Sequential importance sampling Suboptimal filter

来源：评论

学校读者我要写书评

暂无评论

Improved Semi-supervised Clustering Algorithm Based on Affinity Propagation

引用

Journal of Donghua University(English Edition) 2015年第1期32卷 125-131页

作者：金冉刘瑞娟李晔锋寇春海 College of Information Science and Technology Donghua University College of Computer Science and Technology Zhejiang Wanli University College of Science Donghua University

A clustering algorithm for semi-supervised affinity propagation based on layered combination is proposed in this paper in light of existing flaws. To improve accuracy of the algorithm,it introduces the idea of layered combination, divides an affinity propagation clustering( APC) process into several hierarchies evenly,draws samples from data of each hierarchy according to weight,and executes semi-supervised learning through construction of pairwise constraints and use of submanifold label mapping,weighting and combining clustering results of all hierarchies by combined promotion. It is shown by theoretical analysis and experimental result that clustering accuracy and computation complexity of the semi-supervised affinity propagation clustering algorithm based on layered combination( SAP-LC algorithm) have been greatly improved.

关键词： semi-supervised clustering affinity propagation(AP) layered combination computation complexity combined promotion

来源：评论

学校读者我要写书评

暂无评论

A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n:F system

引用

IEEE TRANSACTIONS ON RELIABILITY 1998年第4期47卷 472-474页

作者： Chang, JC Chen, RJ Hwang, FK Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan Natl Chiao Tung Univ Dept Appl Math Hsinchu 30050 Taiwan

An O(Tn) algorithm is presented for the circular consecutive-weighted-k-out-of-n:F system, where T less than or equal to min[n, [(k - w(max))/w(min)] + 1];w(max), w(min) are the maximum, minimum weights of all components. This algorithm is simpler and more efficient than the Wu & Chen O(min[n,k] . n) algorithm. When all weights are unity, this algorithm is simpler than other O(k . n) published algorithms.

关键词： consecutive-k-out-of-n : F system consecutive weighted-k-out-of-n : F system computation complexity

来源：评论

学校读者我要写书评

暂无评论

AN APPROACH TO THE PROBLEMS OF ROUTING OPTIMIZATION IN THE REGIONS OF INTRICATE SHAPE

引用

INFORMATION PROCESSING LETTERS 1981年第1期13卷 39-43页

作者： STOYAN, YG SMELYAKOV, SV Institute of Machine-Building Problems Ukrainian Academy of Sciences Olminskogo 14 310024 Kharkov-24 U.S.S.R.

来源：评论

学校读者我要写书评

暂无评论

Hybrid Context Aware Recommendation System for E-Health Care by merkle hash tree from cloud using evolutionary algorithm

引用

SOFT COMPUTING 2020年第10期24卷 7149-7161页

作者： Deepa, N. Pandiaraja, P. M Kumarasamy Coll Engn Dept Comp Sci & Engn Karur 639113 Tamil Nadu India

Privacy preservation permits doctors to outsource the huge encrypted reports to the cloud and permits the authenticated patients to have a safe search over the reports without leaking the private information. The doctors in our proposed have used the merkle hash tree for storing the reports of all the patients in the hospital. The existing schemes have used many types of trees like binary tree, red-black tree, spanning tree, B+ tree, etc., for the index generation purpose. Since the security is less and the searching time is high for the above said trees, we have proposed the index generation phase based on the merkle hash tree based on the evolutionary algorithm and it takes less time for searching and highly secure for storing the patient reports. The evolutionary algorithm is used for breeding the new data's through crossover as well as mutation operations to give confinement to new children. When the patient submits the search request for specialized doctor, based on the patient disease our protocol will recommend the specialized doctors and send the recommended doctors information to the patients who have the highest rating in the online social networks. After receiving the recommended results, the patient can have the treatment via online booking appointment, video call or in person based on the appointment booked. After completely cured, the patients can rate the doctors based on the medicine satisfaction, doctors' fees and doctor's response over the call. In this mechanism, we have used the hybrid context aware recommendation system collaborative filtering for rating the doctors based on their performance. After rating the doctors, our protocol has measured the accuracy based on the predicted rating and the true rating. This kind of accuracy metrics is used for ranking the good doctors in the top rank for the patient use. Our proposed work Hybrid Context Aware Recommendation System for E-Health Care (HCARS-EHC) is implemented, and the implementation results

关键词： Privacy Recommendation system Collaborative filtering Communication complexity computation complexity

来源：评论

学校读者我要写书评

暂无评论

Enforcing bounded realness of S parameter through trace parameterization

Enforcing bounded realness of S parameter through trace para...

引用

12th Topical Meeting on Electrical Performance of Electronic Packaging

作者： Chen, HB Fang, JY Univ Calif Santa Cruz Dept Elect Engn Santa Cruz CA 95064 USA

ISBN: (纸本)0780381289

A new method of enforcing the bounded realness of S parameter macro-model is proposed in this paper. With a given stable rational function obtained from fitting the original data, its closest bounded real rational function is solved through semidefinite programming. This optimization problem is formulated through trace parameterization and uses minimal number of variables.

关键词： S-parameters multiport networks state-space methods circuit optimisation circuit simulation rational functions circuit complexity transient analysis bounded realness S parameter trace parameterization macromodel stable rational function bounded real rational function semidefinite programming optimization problem minimal number of variables transient analysis multiport parameter computation complexity state-space realization

来源：评论

学校读者我要写书评

暂无评论

Fast Intra Mode Prediction for HEVC Based on Distortion Variance

Fast Intra Mode Prediction for HEVC Based on Distortion Vari...

引用

IEEE International Conference on Circuit, Power and Computing Technologies (ICCPCT)

作者： Balaji, L. Raj, V. Logesh Raghavendran, R. Raj, S. Mathan Akash, G. Velammal Inst Technol Dept ECE Madras Tamil Nadu India

ISBN: (纸本)9781509012770

High Efficiency Video Coding (HEVC) is an ongoing standard, which is an extension of H.264/AVC which is the latest coding standard. In HEVC encoder an exhaustive search method is employed to select the best mode for each macro block which consumes more encoding time. Rate and Distortion tradeoff attained for encoding each macroblock introduces more computation complexity. Although, HEVC has better coding efficiency, in regard to AVC it has more number of macroblock modes to identify the best mode. In this paper, a fast mode intra prediction algorithm to predict the best mode for each macro block based on distortion variance is proposed. The distortion variance finds the integer pixel difference between the current macroblock and the reference macroblock. The experimental result shows that the proposed algorithm achieves better encoding time when compared with HM reference model without a drastic increment in bit rate and PSNR or degradation.

关键词： H.265 fast mode decision computation complexity PSNR Time distortion variance

来源：评论

学校读者我要写书评

暂无评论

EDCA: Efficient Diffusion Cipher and Authentication Scheme for Wireless Sensor Networks

EDCA: Efficient Diffusion Cipher and Authentication Scheme f...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Noura, Hassan Martin, Steven Al Agha, Khaldoun Univ Paris Sud CNRS Lab Rech Informat Paris France

ISBN: (纸本)9781479930838

The security of Wireless Sensor Networks (WSN) is essential for effective deployment in various areas and applications such as military and business. The existing security solutions of WSN are based on multi-round function, which requires high computing complexity and energy consumption. WSN have, however, limited resources that prevent their efficient deployment for a long period. In this paper, a new kind of security system based on a cipher and authentication algorithm called EDCA is presented to ensure the necessary security requirements with low computation complexity. Furthermore, the proposed cipher is based on a dynamic binary diffusion layer. The contents of packets is divided into many blocks, which are mixed together to produce the cipher blocks. Likewise, an enhanced version of cipher is presented to attain a better statistical properties. Additionally, EDCA is evaluated by comparing it with AES, which is considered reliable and robust in several standards of sensor networks. The results show that the proposed algorithm has a reduced computation complexity, and is robust and could be adopted for different types of wireless or mobile networks.

关键词： computational complexity cryptography data privacy statistical analysis telecommunication network reliability telecommunication security wireless sensor networks AES EDCA scheme WSN advanced encryption standard business application computation complexity dynamic binary diffusion layer efficient diffusion cipher and authentication scheme energy consumption military application mobile network multiround function security system statistical property wireless sensor network Authentication Ciphers complexity theory Encryption Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Timing Synchronization Method for OFDM Based Power Line Communication 9

A Timing Synchronization Method for OFDM Based Power Line Co...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Xiaosheng Liu Jiasheng Liu He Sun Hao Liu Xuanpu Gu School of Electrical Engineering and Automation Harbin Institute of Technology

ISBN: (纸本)9781509038237;9781509038220

Orthogonal frequency division multiplexing(OFDM) is one important technologies of power line communication(PLC). This paper presents a new timing synchronization method for OFDM system which can be used in PLC. The proposed timing method is performed by calculating the correlation between the received signal and a local training sequence which is the same as the training sequence of OFDM signal. Compared to Park's method, the proposed method achieves higher accuracy of timing synchronization in both AWGN channel and PLC channel. In addition, it has less computation. Finally, the feasibility of the proposed method is verified by experiments which are operated on 220 V AC PLC in the laboratory environment.

关键词： OFDM timing synchronization computation complexity power line communication

来源：评论

学校读者我要写书评

暂无评论

Fast Mode Decision Algorithm for H. 264/SVC 3

Fast Mode Decision Algorithm for H. 264/SVC

引用

3rd International Conference on Frontiers in Intelligent Computing - Theory and Applications (FICTA)

作者： Balaji, L. Thyagharajan, K. K. Anna Univ Fac Informat & Commun Chennai 600025 Tamil Nadu India Velammal Inst Technol Chennai 601204 Tamil Nadu India RMD Engn Coll Chennai 601206 Tamil Nadu India

ISBN: (纸本)9783319120126;9783319120119

H.264/AVC extension is H.264/SVC which is applicable for environment that demands video streaming. This paper presents an algorithm to reduce computation complexity and maintain coding efficiency by determining the mode quickly. Our algorithm terminates mode search by a probability model for both intra-mode and inter-mode of lower level and higher level layers in a Macro Block (MB). The estimated of Rate Distortion Cost (RDC) for modes among layers is used to determine best mode of each MB. This algorithm achieves about 26.9% of the encoding time when compared with JSVM reference software with minimal degradation in PSNR.

关键词： Scalable Video Coding H. 264 Fast Mode Decision computation complexity Macro Block

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：