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

Uncertain Knowledge Reasoning Based on the Fuzzy Multi Entity Bayesian Networks

Computers, Materials & Continua 2019年第7期61卷 301-321页

作者： Dun Li Hong Wu Jinzhu Gao Zhuoyun Liu Lun Li Zhiyun Zheng Zhengzhou University 100 Science AvenueZhengzhou450001China University of the Pacific 3601 Pacific AvenueStockton95211USA

With the rapid development of the semantic web and the ever-growing size of uncertain data,representing and reasoning uncertain information has become a great challenge for the semantic web application *** this paper,we present a novel reasoning framework based on the representation of fuzzy ***,the paper gives an overview of the previous research work on uncertainty knowledge representation and reasoning,incorporates Ontology into the fuzzy Multi Entity Bayesian Networks theory,and introduces fuzzy PR-OWL,an Ontology language based on *** PROWL describes fuzzy semantics and uncertain relations and gives grammatical definition and semantic ***,the paper explains the integration of the Fuzzy Probability theory and the belief propagation *** influencing factors of fuzzy rules are added to the belief that is propagated between the nodes to create a reasoning framework based on fuzzy *** that,the reasoning process,including the SSFBN structure algorithm,data fuzzification,reasoning of fuzzy rules,and fuzzy belief propagation,is ***,compared with the classical algorithm from the aspect of accuracy and time complexity,our uncertain data representation and reasoning method has higher accuracy without significantly increasing time complexity,which proves the feasibility and validity of our solution to represent and reason uncertain information.

关键词： Ontology language uncertainty representation uncertainty reasoning fuzzy multi entity Bayesian networks belief propagation algorithm fuzzy PR-OWL

来源：评论

学校读者我要写书评

暂无评论

Intensity Reflection Coefficient Based Min-Sum Decoding for Low Density Parity Check Codes

引用

FREQUENZ 2012年第7-8期66卷 229-238页

作者： Islam, Mohammad Rakibul Mahmood, Khandaker Sultan Oshim, Md Farhan Tasnim Farazi, Md Moshiur Rahman Islamic Univ Technol Dept Elect & Elect Engn Dhaka 1704 Bangladesh

Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon's limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction of a factor, intensity reflection coefficient (IRC), kappa in the check to bit node updating process. Simulation results demonstrate that the proposed algorithms are effective in imparting a better performance in terms of a lower bit error rate (BER) at low to medium signal to noise ratio (SNR) when compared to the traditional MS or belief propagation (BP) algorithm while adding a minimum amount of complexity. The proposed algorithm results in a reduced hardware complexity when implemented in VLSI.

关键词： Low-density parity-check codes min-sum algorithm belief propagation algorithm IRC bit error rate (BER) computational complexity

来源：评论

学校读者我要写书评

暂无评论

A modified weighted bit-flipping decoding of low-density parity-check codes

引用

IEEE COMMUNICATIONS LETTERS 2004年第3期8卷 165-167页

作者： Zhang, JT Fossorier, MPC Univ Hawaii Manoa Dept Elect Engn Honolulu HI 96822 USA

In this letter, a modified weighted bit-flipping decoding algorithm for low-density parity-check codes is proposed. Improvement in performance is observed by considering both the check constraint messages and the intr... 详细信息

关键词： belief propagation algorithm low-density parity-check (LDPC) codes weighted bit-flipping (WBF)

来源：评论

学校读者我要写书评

暂无评论

An Improved Decoding algorithm for Finite-Geometry LDPC Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2009年第2期57卷 302-306页

作者： Ngatched, Telex Magloire Nkouatchah Takawira, Fambirai Bossert, Martin Univ KwaZulu Natal Sch Elect Elect & Comp Engn ZA-4041 Durban South Africa Univ Ulm Dept Telecommun & Appl Informat Theory D-89081 Ulm Germany

In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.

关键词： belief propagation algorithm bit-flipping (BF) decoding algorithms low-density parity-check (LDPC) codes

来源：评论

学校读者我要写书评

暂无评论

Decentralized-Precoding Aided Rateless Codes for Wireless Sensor Networks

引用

IEEE COMMUNICATIONS LETTERS 2012年第4期16卷 506-509页

作者： Sugiura, Shinya Toyota Cent Res & Dev Labs Inc Nagakute Aichi 4801192 Japan

In this letter, we propose a novel decentralized-precoding aided rateless code, which is conceived for Wireless Sensor Networks (WSNs). More specifically, the proposed algorithm allows a collection of source nodes to precode their information symbols in an uncoordinated manner. The precoded symbols are then channel-encoded by a distributed rateless code at each sensor node. This architecture enables us to eliminate an error floor imposed on the conventional Luby Transform (LT)-code based WSNs, without requiring a central coordinator or any elaborate cooperations between the nodes. Our simulation results demonstrate that the proposed distributed rateless code is capable of attaining achievable BER performance comparable to that of a Raptor code coordinated by a central coordinator, while outperforming a distributed LT code.

关键词： Distributed storage fountain codes graphical codes network coding rateless codes sensor network belief propagation algorithm

来源：评论

学校读者我要写书评

暂无评论

Comparative study of LDPC coding schemes and FPGA implementation for inter-vehicle communications

引用

ELECTRONICS LETTERS 2015年第16期51卷 1255-1256页

作者： Kiokes, G. Zountouridou, E. Hellen Air Force Acad Dept Elect Elect Power & Telecommun Dekeleia Air Base Dekeleia Attica Greece Natl Tech Univ Athens Sch Elect & Comp Engn Zografos Greece

A novel comparative study of different low-density parity-check (LDPC) coding algorithms and implementation issues through field-programmable gate arrays (FPGAs) technology for wireless vehicular applications is presented. A key development in LDPC codes is the iterative decoding algorithm which uses the belief propagation algorithm. A comprehensive investigation of the performance of different coding schemes was carried out. Four different decoding techniques were tested by computer-based simulations of messages modulated under the binary phase-shift keying modulation scheme and transmitted through a vehicular channel model. Finally, the best performance ratio against complexity algorithm was chosen to be implemented on a Xilinx FPGA platform.

关键词： field programmable gate arrays iterative decoding parity check codes phase shift keying FPGA implementation LDPC coding schemes belief propagation algorithm field-programmable gate arrays inter-vehicle communications iterative decoding algorithm low-density parity-check coding algorithm phase-shift keying modulation scheme vehicular channel model

来源：评论

学校读者我要写书评

暂无评论

Decoding low-density parity-check codes with probabilistic scheduling

引用

IEEE COMMUNICATIONS LETTERS 2001年第10期5卷 414-416页

作者： Mao, YY Banihashemi, AH Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada Carleton Univ Broadband Commun & Wireless Syst Ctr Ottawa ON K1S 5B6 Canada

In this letter, we present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated "probabilistic schedule," takes into account the structure of the Tanner graph (TG) of the code. We show by simulation that the new schedule offers a much better performance/complexity trade-off. This work also suggests that scheduling plays an important role in iterative decoding and that a schedule that matches the structure of the TG is desirable.

关键词： belief propagation algorithm codes codes on graphs decoding iterative decoding iterative methods LDPC codes message-passing schedule sum-product algorithm

来源：评论

学校读者我要写书评

暂无评论

Two Bit-Flipping Decoding algorithms for Low-Density Parity-Check Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2009年第3期57卷 591-596页

作者： Ngatched, Telex Magloire Nkouatchah Bossert, Martin Fahrner, Achim Takawira, Fambirai Univ KwaZulu Natal Sch Elect Elect & Comp Engn ZA-4041 Durban South Africa Univ Ulm Dept Telecommun & Appl Informat Theory D-7900 Ulm Germany

In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.

关键词： belief propagation algorithm bit-flipping decoding hard-decision decoding low-density parity-check codes soft-decision decoding

来源：评论

学校读者我要写书评

暂无评论

Graphical inference for multiple intrusion detection

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2008年第3期3卷 370-380页

作者： Le, Tung Hadjicostis, Christoforos N. Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

In this paper, we consider vulnerabilities of networked systems and develop a multiple intrusion detection system (MIDS) which operates by running belief propagation on an appropriately constructed weighted bipartite graph. In this bipartite graph, one set of nodes represents the different types of intrusions that are possible, the other set of nodes represents the set of significant measures that are available, and the (weighted) connections represent the dependence of a certain measure on a particular type of intrusion. We assume that the effect of each active intrusion on a particular significant measure is superimposed on the normal operation of that measure;thus, we are able to obtain a complete representation of the overall bipartite graph model by superimposing the simpler graphs associated with each individual intrusion. The key ingredient of our MIDS is the development of a modified belief propagation max-product algorithm (MPA) that avoids the exponential complexity of the original MPA by limiting, during the iteration process, the number of active intrusions that are connected to a particular measure. Our simulation results indicate that the proposed MIDS performs well in detecting both single and multiple intrusions with a very low false alarm rate.

关键词： Bayesian network belief propagation algorithm intrusion detection multiple intrusion model naive Bayesian network model

来源：评论

学校读者我要写书评

暂无评论

Message passing detection for large-scale MIMO systems: damping factor analysis

引用

IET SIGNAL PROCESSING 2017年第8期11卷 923-935页

作者： Mussi, Alex Miyamoto Abrao, Taufik Fed Inst Parana Assis Chateaubriand Parana Brazil EPUSP Univ Sao Paulo Sao Paulo Brazil Univ Estadual Londrina Dept Elect Engn Londrina Parana Brazil

A message passing detector based on belief propagation (BP) algorithm for Markov random fields (MRF-BP) and factor graph (FG-BP) graphical models is analysed under different large-scale (LS) multiple-input multiple-output (MIMO) scenarios, including system parameters, such as damping factor (DF), number of users and number of antennas, from antennas. Specifically, the DF variation under different number of antennas configuration and signal-to-noise ratio (SNR) regions is extensively evaluated;bit error rate (BER) performance and computational complexity are assessed over different scenarios. Numerical results lead to a great performance gain with damped MRF-BP approach, overcoming FG-BP scheme in specific scenarios, with no extra computational complexity. Also, message damping (MD) method resulted in faster convergence of MRF-BP algorithm in LS scenarios, evidencing that, besides the performance gain, MD technique can lead to a computational complexity reduction. Specifically under low number of transmit antennas scenarios, the DF value needs to be carefully chosen. Furthermore, based on the proposed analysis, optimal value for the DF is determined considering wide LS antennas scenarios and SNR regions.

关键词： MIMO communication transmitting antennas error statistics Markov processes graph theory computational complexity convergence message passing telecommunication computing transmit antennas scenarios convergence MD technique FG-BP scheme performance gain computational complexity BER bit error rate performance DF variation antennas configuration SNR signal-to-noise ratio regions LS scenarios factor graph MRF Markov random fields belief propagation algorithm damping factor analysis large-scale MIMO systems message passing detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：