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

Priority-Aware Scheduling for High-Dense Healthcare IoT (H-IoT) Networks Using message-passing algorithm

IEEE INTERNET OF THINGS JOURNAL 2024年第12期11卷 21604-21619页

作者： Dewa, Gilang Raka Rayuda Park, Cheolsoo Sohn, Illsoo Seoul Natl Univ Sci & Technol Dept Comp Sci & Engn Seoul 01811 South Korea Kwangwoon Univ Dept Comp Engn Seoul 01897 South Korea

Healthcare Internet of Things (H-IoT) has been rigorously extending its applications to hospitals to deliver important medical data remotely and continuously with various types of smart medical sensors. Medical data of patients should be treated with different urgency levels. Specifically, critical medical data, such as data pertaining, to heart failure or fall risk must be transmitted first with the highest priority. Thus, priority-aware scheduling for H-IoT networks is required to improve the quality of medical services. However, due to the high-dense nature of H-IoT networks, interference and packet collisions can make finding the optimal priority-aware scheduling very challenging. To tackle these practical issues, we develop a priority-aware scheduling algorithm based on a message-passing framework. With a message-passing procedure that relies on a max-product rule, the proposed algorithm simultaneously maximizes the priority metric and throughput of the network. In addition, the proposed algorithm efficiently finds the best scheduling configuration without a central coordinator by enabling low complexity and autonomous decisions of each network node. Our simulation results verify that the proposed algorithm outperforms conventional schemes in terms of priority awareness, throughput performance, and network scalability.

关键词： Healthcare Internet of Things (H-IoT) medical data delivery message-passing algorithm priority-aware scheduling

来源：评论

学校读者我要写书评

暂无评论

Improved message-passing algorithm For Counting Short Cycles in Bipartite Graphs

Improved Message-Passing Algorithm For Counting Short Cycles...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Li, Juane Lin, Shu Abdel-Ghaffar, Khaled Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781467377041

Recently, Karimi and Banihashemi proposed an algorithm based on message-passing to count cycles in a graph of lengths less than double its girth. The algorithm uses only integer additions and subtractions to compute messages at the nodes of the graph that are passed to adjacent nodes. The complexity of the algorithm, when applied to a bipartite graph of girth g that has E edges, is O(gE(2)). The algorithm is superior to many other existing algorithms in the literature. In this paper, an improvement of this algorithm is presented that cuts both the complexity and the computing time by a factor of two. The improved algorithm is also applied to Tanner graphs of quasi-cyclic codes and, in this case, the complexity can be further cut by a factor of p, where p is the size of the circulants in the parity-check matrix of the quasi-cyclic code.

关键词： Bipartite graph Counting cycles LDPC code message-passing algorithm Tanner graph

来源：评论

学校读者我要写书评

暂无评论

Iterative message passing algorithm for Vertex-Disjoint Shortest Paths

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第6期68卷 3870-3878页

作者： Dai, Guowei Guo, Longkun Gutin, Gregory Zhang, Xiaoyan Zhang, Zan-Bo Nanjing Normal Univ Sch Math Sci Nanjing 210023 Peoples R China Nanjing Normal Univ Inst Math Nanjing 210023 Peoples R China Qilu Univ Technol Dept Comp Sci Jinan 250353 Peoples R China Fuzhou Univ Ctr Discrete Math & Theoret Comp Sci Fuzhou 350116 Peoples R China Royal Holloway Univ London Dept Comp Sci Egham TW20 0EY Surrey England Guangdong Univ Finance & Econ Sch Stat & Math Guangzhou 510320 Peoples R China Guangdong Univ Finance & Econ Inst Artificial Intelligence & Deep Learning Guangzhou 510320 Peoples R China

As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest k-path problem (k-VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph G of order n, BP algorithm converges to the unique optimal solution of k -VDSP on G within O(n(2) w(max)) iterations, provided that the weight we is nonnegative integral for each arc e is an element of E(G), where w(max) = max{w(e) : e is an element of E(G)}. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of k-VDSP to the case of multiple sources or sinks.

关键词： Belief propagation message-passing algorithm iterative algorithms vertex-disjoint shortest path

来源：评论

学校读者我要写书评

暂无评论

A novel patent technology characterization method based on heterogeneous network message passing algorithm and patent classification system

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 256卷

作者： Chang, Zhi-Xing Guo, Wei Wang, Lei Fu, Zhong-Lin Ma, Jian Zhang, Guan-Wei Wang, Zi-Liang Tianjin Univ Key Lab Mech Theory & Equipment Design Minist Educ Tianjin Peoples R China Tianjin Renai Coll Tianjin Peoples R China

Patents are widely recognized as important data for generating innovation. Accurate and rational characterizing patent technology content is a prerequisite for applying innovation generation algorithms. Existing research widely employs classification codes that annotate the technology content of patents to represent patents. However, the oversight of technology similarity information within patent classification systems results in deficiencies in the accuracy and effectiveness of their representations. To fill this research gap, we analyze the hierarchical structure of patent classification systems to extract the technology similarity information embedded within them. Then, we propose a novel patent technology characterization method based on the heterogeneous network message passing algorithm, which integrates the technology similarity information in the classification code co-occurrence information and the patent classification system to obtain a more accurate patent characterization. Subsequently, several evaluation experiments were conducted to compare our method with typical existing methods. The results demonstrate that our method outperforms these methods in accuracy and effectiveness. Finally, we conducted a case study to validate the reliability and practicality of our approach. In summary, our method exhibited superior performance, thereby providing robust support for innovation generation methods based on patent characterization, with high application value and extension prospects.

关键词： Heterogeneous network message-passing algorithm Technology topic Clustering algorithm Patent characterization

来源：评论

学校读者我要写书评

暂无评论

message-passing algorithms for Coordinated Spectrum Sensing in Cognitive Radio Networks

引用

IEEE COMMUNICATIONS LETTERS 2013年第4期17卷 812-815页

作者： Lee, Sang Hyun Shamaiah, Manohar Vikalo, Haris Vishwanath, Sriram Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

This letter presents distributed algorithms that enable efficient spectrum sensing in cognitive radio networks. In the proposed setting, each node in the system detects different channels in a cooperative fashion in order to improve access to the spectral resources available to the cognitive radio network. The developed scheme utilizes a message-passing framework for efficient channel assignment. Simulation results establish that this class of algorithms outperform existing techniques and improves the overall sensing performance of the system.

关键词： Coordinated spectrum sensing message-passing algorithm cognitive radios

来源：评论

学校读者我要写书评

暂无评论

Design of Nonbinary LDPC Codes Based on message-passing algorithms

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2018年第11期66卷 5028-5040页

作者： Cho, Sunghye Cheun, Kyungwhoon Yang, Kyeongcheol Pohang Univ Sci & Technol Dept Elect Engn Pohang 37673 South Korea Samsung Elect Co Ltd DRAM Design Team Memory Business Suwon 16677 South Korea Samsung Elect Co Ltd Networks Business Res & Dev Team Suwon 16677 South Korea

Short cycles in a nonbinary low-density parity-check (NB-LDPC) code may he even more harmful to its performance if they do not satisfy the so-called full rank condition (FRC). This is because they may induce low-weight codewords or absorbing sets in that case. Thus, it is important to count the number of short cycles not satisfying the FRC as well as the number of short cycles for analyzing the performance of an NB-LDPC code. In this paper, we first develop a novel message-passing algorithm and identify how it is related to the FRC. We then propose a low-complexity algorithm for counting the number of short cycles not satisfying the FRC in an NB-LDPC code, as well as the number of short cycles. Finally, we propose a low-complexity algorithm for designing an NB-LDPC code with low error floor. Depending on the modulation scheme, the codes constructed by the proposed design algorithm have similar or slightly worse performance, compared with those constructed via the method by Poulliat et al. However, the proposed design algorithm does not require a cycle enumeration algorithm with high complexity, and therefore is feasible even in the case of large code length, say >= 5000.

关键词： Nonbinary low-density parity-check codes full rank condition message-passing algorithm counting cycles error floor design method

来源：评论

学校读者我要写书评

暂无评论

Feedback arcs and node hierarchy in directed networks

引用

Chinese Physics B 2017年第7期26卷 480-494页

作者：赵金华周海军 Key Laboratory of Theoretical Physics Institute of Theoretical Physics Chinese Academy of Sciences Department of Applied Science and Technology Politecnico di Torino School of Physical Sciences University of Chinese Academy of Sciences

Directed networks such as gene regulation networks and neural networks are connected by arcs（directed links）. The nodes in a directed network are often strongly interwound by a huge number of directed cycles, which leads to complex information-processing dynamics in the network and makes it highly challenging to infer the intrinsic direction of information flow. In this theoretical paper, based on the principle of minimum-feedback, we explore the node hierarchy of directed networks and distinguish feedforward and feedback arcs. Nearly optimal node hierarchy solutions, which minimize the number of feedback arcs from lower-level nodes to higher-level nodes, are constructed by belief-propagation and simulated-annealing methods. For real-world networks, we quantify the extent of feedback scarcity by comparison with the ensemble of direction-randomized networks and identify the most important feedback arcs. Our methods are also useful for visualizing directed networks.

关键词： directed graph feedback arc hierarchy message-passing algorithm

来源：评论

学校读者我要写书评

暂无评论

Gaussian Multiple Description Coding with Low-Density Generator Matrix Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2012年第3期60卷 676-687页

作者： Chen, Jun Zhang, Ying Dumitrescu, Sorina McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

It is shown that the coding problem for an arbitrary point on the dominant face of an L-description El Gamal-Cover (EGC) region can be converted to that for a vertex of a K-description EGC region for some K <= 2L - 1, where the latter problem can be solved via successive coding. A practical scheme is proposed for the quadratic Gaussian case by reducing each step in successive coding to a Gaussian quantization operation and implementing such an operation using low-density generator matrix codes. The effectiveness of this scheme is verified through extensive simulation experiments.

关键词： Lossy source coding low-density generator matrix message-passing algorithm multiple description coding quantization splitting

来源：评论

学校读者我要写书评

暂无评论

Affinity Propagation for Energy-Efficient BS Operations in Green Cellular Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2015年第8期14卷 4534-4545页

作者： Lee, Sang Hyun Sohn, Illsoo Sejong Univ Dept Informat & Commun Engn Seoul 143747 South Korea Gachon Univ Dept Elect Engn Songnam 461701 South Korea

This paper develops a distributed strategy to identify an energy-efficient base station (BS) network configuration for green cellular networks. During off-peak periods where traffic demands are only a fraction of the peak-time traffic demands, a subset of BSs is switched off to minimize operational energy consumption without affecting service to any of network users. To this end, we formulate a combinatorial optimization of jointly determining BS switching and user association. This formulation, however, requires a computationally demanding task as the population of the network grows. To resolve these challenges, we introduce a graphical-model approach to the optimization formulation and derive a distributed algorithm based on affinity propagation, which is a message-passing algorithm developed for data clustering in data-mining techniques. The proposed algorithm operates via simple local information exchanges among users and BSs and provides a very efficient solution for energy-saving management with low computational costs. We also present a green protocol that transforms commercial cellular networks into green radio networks using the proposed algorithm. Simulation results verify that the developed solution significantly improves the energy savings and resource utilization in the network.

关键词： Green cellular networks energy-efficient operation message-passing algorithm base station switching user association affinity propagation

来源：评论

学校读者我要写书评

暂无评论

Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第9期59卷 6018-6048页

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

We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of this function. We achieve this combinatorial characterization by counting valid configurations in finite graph covers of the factor graph. Analogously, we give a combinatorial characterization of the Bethe partition function, whose original definition was also of an analytical nature. As we point out, our approach has similarities to the replica method, but also stark differences. The above findings are a natural backdrop for introducing a decoder for graph-based codes that we will call symbolwise graph-cover decoding, a decoder that extends our earlier work on blockwise graph-cover decoding. Both graph-cover decoders are theoretical tools that help toward a better understanding of message-passing iterative decoding, namely blockwise graph-cover decoding links max-product (min-sum) algorithm decoding with linear programming decoding, and symbolwise graph-cover decoding links sum-product algorithm decoding with Bethe free energy function minimization at temperature one. In contrast to the Gibbs entropy function, which is a concave function, the Bethe entropy function is in general not concave everywhere. In particular, we show that every code picked from an ensemble of regular low-density parity-check codes with minimum Hamming distance growing (with high probability) linearly with the block length has a Bethe entropy function that is convex in certain regions of its domain.

关键词： Bethe approximation Bethe entropy Bethe partition function graph cover graph-cover decoding linear programming decoding message-passing algorithm method of types pseudomarginal vector sum-product algorithm (SPA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：