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

Optimization Decomposition of Resistive Power Networks With Energy Storage

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2014年第7期32卷 1371-1385页

作者： Lou, Xin Tan, Chee Wei City Univ Hong Kong Coll Sci & Engn Kowloon Hong Kong Peoples R China

A fundamental challenge of a smart grid is: to what extent can moving energy through space and time be optimized to benefit the power network with large-scale energy storage integration? With energy storage, there is a possibility to generate more energy when the demand is low and store it for later use. In this paper, we study a dynamic optimal power flow (OPF) problem with energy storage dynamics in purely resistive power networks. By exploiting the recently discovered zero duality gap property in the OPF problem, we apply optimization decomposition techniques to decouple the coupling energy storage constraints and obtain the global optimal solution using distributed message passing algorithms. The decomposition methods offer new interesting insights on the equilibrium load profile smoothing feature over space and time through the relationship between the optimal dual solution in the OPF and the energy storage dynamics. We evaluate the performance of the distributed algorithms in several IEEE benchmark systems and show that they converge fast to the global optimal solution by numerical simulations.

关键词： Optimal power flow energy storage decomposition method distributed optimization smart grid message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

Sybil Node Detection in Peer-to-Peer Networks using Indirect Validation 11

Sybil Node Detection in Peer-to-Peer Networks using Indirect...

引用

11th Annual IEEE India Conference (INDICON)

作者： Banerjee, Chayan Saxena, Shubhra Brainware Grp Inst Dept Elect & Commun SDET Barasat India SRM Univ Dept Elect & Commun Chennai Tamil Nadu India

ISBN: (纸本)9781479953646

Peer-to-peer networks are used extensively today. Due to this wide use P2P networks is a target of malicious attacks. The most mentionable of them is the Sybil attack. Existing approaches for detection and mitigation of Sybil nodes are either computationally costly or are dependent on belief models found in social networks. It has been found that these belief models are themselves vulnerable to other attacks. In this paper, we propose a new type of indirect validation where we have a two stage validation in place to check that if a suspected node is Sybil or not. We crosscheck belief data from local monitor nodes and community detection data from randomly selected global monitor nodes, and then validate a suspected node. The proposed approach is found to be with less computation overheads and less vulnerable to malicious attacks.

关键词： Belief model Community detection Indirect validation message passing algorithm Sybil detection

来源：评论

学校读者我要写书评

暂无评论

Iterative detection and decoding for SCMA systems with LDPC codes

Iterative detection and decoding for SCMA systems with LDPC ...

引用

International Conference on Wireless Communications and Signal Processing

作者： Baicen Xiao Kexin Xiao Shutian Zhang Zhiyong Chen Bin Xia Hui Liu Dept. of Electron. Eng. Shanghai Jiao Tong Univ. Shanghai China

ISBN: (纸本)9781467376884

Sparse code multiple access (SCMA) is a promising multiplexing approach to achieve high system capacity. In this paper, we develop a novel iterative detection and decoding scheme for SCMA systems combined with Low-density Parity-check (LDPC) decoding. In particular, we decompose the output of the message passing algorithm (MPA) based SCMA multiuser detection into intrinsic part and prior part. Then we design a joint detection and decoding scheme which iteratively exchanges the intrinsic information between the detector and the decoder, yielding a satisfied performance gain. Moreover, the proposed scheme has almost the same complexity compared with the traditional receiver for LDPC-coded SCMA systems. As numerical results demonstrate, the proposed scheme has a substantial gain over the traditional SCMA receiver on AWGN channels and Rayleigh fading channels.

关键词： AWGN channels Rayleigh channels fading channels iterative decoding parity check codes subcarrier multiplexing LDPC codes LDPC decoding Rayleigh fading channels SCMA multiuser detection SCMA systems intrinsic information iterative decoding scheme iterative detection iterative detection scheme low-density parity-check message passing algorithm multiplexing approach sparse code multiple access Complexity theory Decoding Detectors Iterative decoding Multiuser detection Receivers AWGN channels Raleigh fading channels low density parity check codes Iterative decoding DECODING Multiuser detection parity check codes subcarrier multiplexing Complexity theory Receivers Fading channels decoding scheme message passing detector

来源：评论

学校读者我要写书评

暂无评论

Simplified Multiuser Detection for SCMA with Sum-Product algorithm

Simplified Multiuser Detection for SCMA with Sum-Product Alg...

引用

International Conference on Wireless Communications and Signal Processing

作者： Kexin Xiao Baicen Xiao Shutian Zhang Zhiyong Chen Bin Xia Dept. of Electron. Eng. Shanghai Jiao Tong Univ. Shanghai China

ISBN: (纸本)9781467376884

Sparse code multiple access (SCMA) is a novel non-orthogonal multiple access technique, which fully exploits the shaping gain of multi-dimensional codewords. However, the lack of simplified multiuser detection algorithm prevents further implementation due to the inherently high computation complexity. In this paper, general SCMA detector algorithms based on Sum-product algorithm are elaborated. Then two improved algorithms are proposed, which simplify the detection structure and curtail exponent operations quantitatively in logarithm domain. Furthermore, to analyze these detection algorithms fairly, we derive theoretical expression of the average mutual information (AMI) of SCMA (SCMA-AMI), and employ a statistical method to calculate SCMA-AMI associated with specific detection algorithms. Simulation results show that the performance is almost as well as the based message passing algorithm in terms of both BER and AMI while the complexity is significantly decreased, compared to the traditional Max-Log approximation method.

关键词： communication complexity error statistics message passing multi-access systems multiuser detection statistical analysis AMI Max-Log approximation method SCMA detector algorithm average mutual information computational complexity message passing algorithm multidimensional codeword non-orthogonal multiple access technique simplified multiuser detection algorithm sparse code multiple access technique statistical method sum-product algorithm Approximation algorithms Complexity theory Detectors Least squares approximations message passing Multiuser detection Sum product algorithm Multiuser detection message passing Sum-product algorithm Statistical methods Multi access systems least squares approximations communication complexity Complexity theory Approximation algorithms complexity classes Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Simultaneous identification of robust synergistic subnetwork markers for effective cancer prognosis 14

Simultaneous identification of robust synergistic subnetwork...

引用

Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics

作者： Navadon Khunlertgit Byung-Jun Yoon Texas A&M University TX

ISBN: (纸本)9781450328944

Accurate prediction of cancer prognosis based on gene expression data is generally difficult, and identifying robust prognostic markers for cancer remains a challenging problem. Recent studies have shown that modular markers, such as pathway markers and subnetwork markers, can provide better snapshots of the underlying biological mechanisms by incorporating additional biological information, thereby leading to more accurate cancer *** this paper, we propose a novel method for simultaneously identifying robust synergistic subnetwork markers that can accurately predict cancer prognosis. The proposed method utilizes an efficient message-passing algorithm called affinity propagation, based on which we identify groups -- or subnetworks -- of discriminative and synergistic genes, whose protein products are closely located in the protein-protein interaction (PPI) network. Unlike other existing subnetwork marker identification methods, our proposed method can simultaneously identify multiple nonoverlapping subnetwork markers that can synergistically predict cancer *** results based on multiple breast cancer datasets demonstrate that the proposed message-passing approach can identify robust subnetwork markers in the human PPI network, which have higher discriminative power and better reproducibility compared to those identified by previous methods. The identified subnetwork makers can lead to better cancer classifiers with improved overall performance and consistency across independent cancer datasets.

关键词： protein-protein interaction network message passing algorithm subnetwork marker identification cancer classification

来源：评论

学校读者我要写书评

暂无评论

Factor graph aided multiple hypothesis tracking

引用

Science China(Information Sciences) 2013年第10期56卷 284-289页

作者： WANG Huan SUN JinPing LU SongTao WEI ShaoMing School of Electronic and Information Engineering Beihang University Department of Electrical and Computer Engineering Iowa State University

Since closely moving targets exist extensively in the ground moving target tracking,the uncertainty of data association greatly increases making the measurement-to-track association more ***,traditional multiple hypothesis tracking(MHT)has high false tracking rate and track *** paper frst investigates the measurement based factor graph in data association,and gives the corresponding message passing ***,a factor graph aided multiple hypothesis tracking(FGA-MHT)method is proposed,which introduces factor graph based m-best hypothesis producing technique and exploits factor graph based probability refnement algorithm to reduce the uncertainty of measurement-to-track *** results demonstrate that FGA-MHT reduces times of track swap and increases the correct data association rate in closely moving target tracking.

关键词： multiple hypothesis tracking(MHT) data association factor graph message passing algorithm sum-product algorithm factor graph aided multiple hypothesis tracking(FGA-MHT

来源：评论

学校读者我要写书评

暂无评论

An Analytical Approach to The Performance of Low Density Parity Check Codes

An Analytical Approach to The Performance of Low Density Par...

引用

International Conference on Advanced Computing and Communication Systems (ICACCS)

作者： Lakshmi, R. Tony, Tilty Raju, Abin Johns Jyothi Engn Coll Dept Elect & Commun Engn Trichur Kerala India

ISBN: (纸本)9781479935062

Low Density Parity Check Codes (LDPC) is a class of linear block codes best suited for forward error control in communication systems. When compared with other codes, LDPC codes have significant performance gain, which can be turned to an increase of the coverage range or a reduction of transmission power. Hence a convenient and practical receiver is obtained. The analysis done in this paper is based on the Bit Error Rate of the decoded output. The factors considered for the analysis are multiple code rate, different number of iterations and various decoding schemes. For lower code rate, soft decision decoding and increased number of iterations LDPC codes yields a better performance.

关键词： Low density parity check codes Parity check matrix message passing algorithm Iterative decoding Sum product decoding

来源：评论

学校读者我要写书评

暂无评论

The performance analysis of rapid PN code acquisition using iterative message passing algorithm

The performance analysis of rapid PN code acquisition using ...

引用

IEEE International Conference on Mechatronics and Automation

作者： Xu, Dingjie Zhao, Guoqing Yu, Zhuoqi Harbin Engn Univ Dept Automat Harbin Heilongjiang Peoples R China

ISBN: (纸本)9781424408276

Exact synchronization of PN code is the precondition of the excellences of spread spectrum communicating system, and how to rapidly and effectively make the PN code to exact synchronization becomes the key of the excellent performance of spread spectrum communicating system. After the analysis of simple serial acquisition and hybrid acquisition, this paper introduces a new acquisition method called rapid PN code acquisition using iterative message passing algorithm (IMPA). According to the channel message, rapid PN code acquisition using IMPA can obtain the local sequence directly which is roughly synchronous with the received sequence via iterative computations of the message above factor graph. The method changes generating mode of local sequence in traditional PN code acquisition algorithm. The paper shows the principle and the process of realization of the new approach, and carries out the simulation of performance of rapid PN code acquisition using IMPA, simple serial acquisition and hybrid acquisition. Simulation results show that the mean acquisition time of rapid PN code acquisition using IMPA is much shorter than both serial and hybrid search strategies. The detection probability of proposed algorithm is equivalent to the detection probability of simple serial acquisition.

关键词： PN code acquisition message passing algorithm factor graph

来源：评论

学校读者我要写书评

暂无评论

Distributed Cognitive Radio Network Management via algorithms in Probabilistic Graphical Models

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2011年第2期29卷 338-348页

作者： Liang, Yingbin Lai, Lifeng Halloran, John Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA Univ Arkansas Dept Syst Engn Little Rock AR 72204 USA Univ Washington Dept Elect Engn Seattle WA 98195 USA

In this paper, cognitive radio wireless networks are investigated, in which a number of primary users (PUs) transmit in orthogonal frequency bands, and a number of secondary users (SUs) monitor the transmission status of the PUs and search for transmission opportunities in these frequency bands by collaborative detection. A network management problem is formulated to find the configuration of SUs (assignment of SUs) to detect PUs so that the best overall network performance is achieved. Two performance metrics are considered, both of which characterize the probability of errors for detecting transmission status of all PUs. For both metrics, a graphical representation of the problem is provided, which facilitates to connect the problems under study to the sum-product inference problem studied in probabilistic graphical models. Based on the elimination algorithm that solves the sum-product problem, a message passing algorithm is proposed to solve the problem under study in a computationally efficient manner and in a distributed fashion. The complexity of the algorithm is shown to be significantly lower than that of the exhaustive search approach. Moreover, a clique-tree algorithm is applied to efficiently compute the impacts of each SU's choice on the overall system performance. Finally, simulation results are provided to demonstrate the considerable performance enhancement achieved by implementing an optimal assignment of SUs.

关键词： Cognitive radio collaborative detection distributed algorithm message passing algorithm probabilistic graphical model

来源：评论

学校读者我要写书评

暂无评论

A Factor-Graph Approach to Lagrangian and Hamiltonian Dynamics

A Factor-Graph Approach to Lagrangian and Hamiltonian Dynami...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Vontobel, Pascal O. Hewlett Packard Labs Palo Alto CA 94304 USA

ISBN: (纸本)9781457705953

Factor graphs are graphical models with origins in coding theory. The sum-product, the max-product, and the min-sum algorithms, which operate by message passing on a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. This paper aims at extending the field of possible applications of factor graphs to Lagrangian and Hamiltonian dynamics. The starting point is the principle of least action (more precisely, the principle of stationary action). The resulting factor graphs require a new message-passing algorithm that we call the stationary-sum algorithm. As it turns out, some of the properties of this algorithm are equivalent to Liouville's theorem. Moreover, duality results for factor graphs allow to easily derive Noether's theorem. We also discuss connections and differences to Kalman filtering.

关键词： Equations Hamiltonian dynamics Heuristic algorithms Kalman filtering Kalman filters Kalman filters Lagrangian dynamics Lagrangian functions Liouville theorem Mathematical model Trajectory Transforms coding theory factor graph approach graph theory least action principle message passing message passing algorithm signal processing stationary action principle stationary sum algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：