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

4th International Conference on Network Communication and Information Security, ICNCIS 2024

作者： Liu, Zhijun Zhuang, Yi Nanjing University of Aeronautics and Astronautics Jiangsu Province Nanjing211100 China

ISBN: (数字)9781510688261

ISBN: (纸本)9781510688254

The transient faults caused by high-energy particles in the space radiation environment impact the reliability of routing algorithms in network communication mechanisms, where SDC (Silent Data Corruption) poses a significant threat to space-based network systems due to its insidious nature. Given that existing SDC fault tolerance methods do not incorporate the characteristics of space-based network communication mechanisms and require time-consuming fault injections, this paper proposes a method for strengthening the SDC vulnerability of network routing algorithms based on GCN (graph Convolutional Networks). First, the impact of transient faults on routing algorithms is analyzed, and a fault model of the routing algorithm is constructed. Next, the instruction features and instruction dependencies of the routing algorithm are extracted to construct an instruction dependency graph. Then, a GCN-based instruction SDC vulnerability prediction model is constructed and trained to predict the SDC vulnerability of the routing algorithm instructions. Finally, the routing algorithm is reinforced to enable self-detection and fault tolerance of SDC. Experimental results show that, compared to existing methods, the proposed method achieves higher accuracy in SDC vulnerability prediction and detection rates without requiring large-scale fault injection. © 2025 SPIE.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

algorithms for Optimally Shifting Intervals Under Intersection graph Models 18th

Algorithms for Optimally Shifting Intervals Under Intersect...

引用

18th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom, IJTCS-FAW 2024

作者： Honorato-Droguett, Nicolás Kurita, Kazuhiro Hanaka, Tesshu Ono, Hirotaka Nagoya University Nagoya Japan Kyushu University Fukuoka Japan

ISBN: (纸本)9789819777518

We propose a new model for graph editing problems on intersection graphs. In well-studied graph editing problems, adding and deleting vertices and edges are used as graph editing operations. As a graph editing operation on intersection graphs, we propose moving objects corresponding to vertices. In this paper, we focus on interval graphs as an intersection graph. We give a linear-time algorithm to find the total moving distance for transforming an interval graph into a complete graph. The concept of this algorithm can be applied for (i) transforming a unit square graph into a complete graph over L1 distance and (ii) attaining the existence of a k-clique on unit interval graphs. In addition, we provide LP-formulations to achieve several properties in the associated graph of unit intervals. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

RULE-BASED graph PROGRAMS MATCHING THE TIME COMPLEXITY OF IMPERATIVE algorithms

arXiv

引用

arXiv 2025年

作者： Alaoui, Ziad Ismaili Plump, Detlef University of Liverpool United Kingdom University of York United Kingdom

We report on a recent breakthrough in rule-based graph programming, which allows us to match the time complexity of some fundamental imperative graph algorithms. In general, achieving the complexity of graph algorithms in conventional languages using graph transformation rules is challenging due to the cost of graph matching. Previous work demonstrated that with rooted rules, certain algorithms can be implemented in the graph programming language GP 2 such that their runtime matches the time complexity of imperative implementations. However, this required input graphs to have a bounded node degree and (for some algorithms) to be connected. In this paper, we overcome these limitations by enhancing the graph data structure generated by the GP 2 compiler and exploiting the new structure in programs. We present three case studies: the first program checks whether input graphs are connected, the second program checks whether input graphs are acyclic, and the third program solves the single-source shortest-paths problem for graphs with integer edge-weights. The first two programs run in linear time on (possibly disconnected) input graphs with arbitrary node degrees. The third program runs in time O(mn) on arbitrary input graphs, matching the time complexity of imperative implementations of the Bellman-Ford algorithm. For each program, we formally prove its correctness and time complexity, and provide runtime experiments on various graph classes. © 2025, CC BY.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

graph-Property Relationships for Complex Chiral Nanodendrimers

引用

ACS NANO 2025年第6期19卷 6095-6106页

作者： Kuznetsova, Vera Kadar, Alain Gaenko, Anita Er, Engin Ma, Tao Whisnant, Kody G. Ma, Jessica Ni, Bing Mehta, Natasha Kim, Ji-Young Gun'ko, Yurii K. Kotov, Nicholas A. Univ Michigan Dept Chem Engn Ann Arbor MI 48109 USA Univ Michigan Biointerfaces Inst Ann Arbor MI 48109 USA Univ Michigan Ctr Complex Particle Syst COMPASS Ann Arbor MI 48109 USA Rensselae Poly Tech Inst Chem & Biol Engn Troy NY 12180 USA Trinity Coll Dublin Sch Chem Dublin D02PN40 Ireland Univ Michigan Biotechnol Inst Ctr Complex Particle Syst COMPASS Michigan ND 48109 USA Univ Michigan Dept Mat Sci Ann Arbor MI 48109 USA

Organic, polymeric, and inorganic nanomaterials with radially diverging dendritic segments are known for their optical, physical, chemical, and biological properties inaccessible for traditional spheroidal particles. However, a methodology to quantitatively link their complex architecture to measurable properties is difficult due to the characteristically large degree of disorder, which is essential for observed property sets. Here, we address this conceptual problem using dendrimer-shaped gold particles with distinct stochastic branching and intense chiroptical activity using graph theory (GT). Unlike typical molecular or nanostructured dendrites, gold nanodendrimers are two-dimensional, with branches radially spreading within one plane. They are also chiral, with mirror asymmetry propagating through multiple scales. We demonstrate that their complex architecture is quantitatively described by image-informed GT models accounting for both regular and disordered structural components of the nanodendrimers. Furthermore, descriptors integrating topological and geometrical characteristics of particle graphs provide physics-based analytical relations to the nontrivial dependence of optical asymmetry g-factor on the particle structure. The simplicity of the GT models capable of capturing the complexity of the particle organization and related light-matter interactions enables the rapid design of scalable nanostructures with multiple functions.

关键词： chiral nanostructures fractals, complexity nonrandomness biomimetics self-assembly graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Two-Dimensional Balanced Partitioning and Efficient Caching for Distributed graph Analysis

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2025年第2期36卷 133-149页

作者： Lin, Shuai Wang, Rui Li, Yongkun Xu, Yinlong Lui, John C. S. Univ Sci & Technol China Hefei 230026 Peoples R China Zhejiang Univ Hangzhou 310027 Peoples R China Univ Sci & Technol China AnHui Prov Key Lab High Performance Comp Hefei 230026 Peoples R China Chinese Univ Hong Kong Hong Kong Peoples R China

Distributed graph analysis usually partitions a large graph into multiple small-sized subgraphs and distributes them into a cluster of machines for computing. Therefore, graph partitioning plays a crucial role in distributed graph analysis. However, the widely used existing graph partitioning schemes balance only in one dimension (number of edges or vertices) or incur a large number of edge cuts, so they degrade the performance of distributed graph analysis. In this article, we propose a novel graph partition scheme BPart and two enhanced algorithms BPart-C and BPart-S to achieve a balanced partition for both vertices and edges, and also reduce the number of edge cuts. Besides, we also propose a neighbor-aware caching scheme to further reduce the number of edge cuts so as to improve the efficiency of distributed graph analysis. Our experimental results show that BPart-C and BPart-S can achieve a better balance in both dimensions (the number of vertices and edges), and meanwhile reducing the number of edge cuts, compared to multiple existing graph partitioning algorithms, i.e., Chunk-V, Chunk-E, Fennel, and Hash. We also integrate these partitioning algorithms into two popular distributed graph systems, KnightKing and Gemini, to validate their impact on graph analysis efficiency. Results show that both BPart-C and BPart-S can significantly reduce the total running time of various graph applications by up to 60% and 70%, respectively. In addition, the neighbor-aware caching scheme can further improve the performance by up to 24%.

关键词： Partitioning algorithms Computational modeling Synchronization Costs Analytical models Social networking (online) Reviews Load modeling Clustering algorithms Blogs Distributed graph systems graph partition graph algorithms graph processing

来源：评论

学校读者我要写书评

暂无评论

Enumerating graphlets with Amortized Time Complexity Independent of graph Size

引用

Algorithmica 2025年 1-27页

作者： Conte, Alessio Grossi, Roberto Kobayashi, Yasuaki Kurita, Kazuhiro Rucci, Davide Uno, Takeaki Wasa, Kunihiro Hokkaido University Sapporo Japan Hosei University Tokyo Japan Nagoya University Nagoya Japan National Institute of Informatics Tokyo Japan University of Pisa Pisa Italy ISTI-CNR Pisa Italy

graphlets of order k in a graph G are connected subgraphs induced by k nodes (called k-graphlets) or by k edges (called edge k-graphlets). They are among the interesting subgraphs in network analysis to get insights on both the local and global structure of a network. While several algorithms exist for discovering and enumerating graphlets, the amortized time complexity of such algorithms typically depends on the size of the graph G, or its maximum degree. In real networks, even the latter can be in the order of millions, whereas k is typically required to be a small value. In this paper we provide the first algorithm to list all graphlets of order k in a graph G=(V,E) with an amortized time complexity depending solely on the order k, contrarily to previous approaches where the cost depends also on the size of G or its maximum degree. Specifically, we show that it is possible to list k-graphlets in O(k2) time per solution, and to list edge k-graphlets in O(k) time per solution. Furthermore we show that, if the input graph has bounded degree, then the amortized time for listing k-graphlets is reduced to O(k). Whenever k=O(1), as it is often the case in practical settings, these algorithms are the first to achieve constant time per solution. © The Author(s) 2025.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Optimization Method of Landscape Architecture Planning and Design Based on Two-Dimensional Fractal graph Generation Algorithm

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第16期49卷 53-66页

作者： Chen, Sheng Shanxi Vocational University of Engineering and Technology School of Architectural Design Department of Cultural Heritage Conservation Engineering China

The development of modern mathematical theory, especially two-dimensional fractal graph algorithm, provides a possibility for large-scale landscape data processing. Landscape digital identification technology is an innovative technology based on digital landscape technology and computer identification of experimental data. It is an important artificial intelligence technology, which includes three steps: landscape acquisition, landscape processing and landscape identification. The characteristics of the scene in the landscape picture can be collected by special instruments, such as cameras, etc., and then the collected data can be processed by two-dimensional fractal graph algorithm, and finally realice the automatic identification of the landscape. For images with significant boundary characteristics, we can extract the boundary of the región quickly and accurately, so as to realice the segmentation of the region. However, when the edge features of the image are not good enough, there is little color difference between the background and the region, or there is some interference, the result will be very bad. In this paper, based on the two-dimensional fractal graph generation algorithm, a series of optimization of landscape architecture planning and design. The accuracy of landscape prime number can reflect whether specific types of landscape pictures can be correctly identified and divided. 200 Pictures are divided into six categories, namely Water scene, landscape scene, living scene, sky scene, architecture and transportation then exact ratios of two-dimensional fractal graph network -8s, two-dimensional fractal graph network - 16s, two-dimensional fractal graph network -32s and two-dimensional fractal graph network -32s. It reached the best level in pixel accuracy, average accuracy, average IU, etc., and the pixel accuracy has reached as high as 100%, average accuracy has reached 100%, average accuracy has reached 100%. When compared to the recommended algorith

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

A Study of Intuitionistic Fuzzy graph Using Morphological Operators and Its Application

A Study of Intuitionistic Fuzzy Graph Using Morphological Op...

引用

International Conference on Mathematics of Intelligent Computing and Data Science, ICMICDS 2022

作者： Jacob, Abraham Ramkumar, P.B. Kerala Ernakulam India Department of Mathematics Rajagiri School of Engineering & Technology Kerala Ernakulam India

ISBN: (纸本)9789819615049

The study focuses on some properties of mathematical morphological operators on intuitionistic fuzzy graphs(IFG). Morphological operators like dilation and erosion and its composition are useful in the application of intuitionistic fuzzy graph. It is extended to study the topological properties using the topological data analysis(TDA) with the help of bar codes and betti numbers obtained by constructing minimal spanning trees(MST) which extracts topological properties of intuitionistic fuzzy graph. Finally, an algorithm for analyzing spread of disease is presented in this study. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Protecting the Connectivity of a graph Under Non-Uniform Edge Failures 42

Protecting the Connectivity of a Graph Under Non-Uniform Edg...

引用

42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025

作者： Hommelsheim, Felix Liu, Zhenwei Megow, Nicole Zhang, Guochuan University of Bremen Germany Zhejiang University Hangzhou China

ISBN: (纸本)9783959773652

We study the problem of guaranteeing the connectivity of a given graph by protecting or strengthening edges. Herein, a protected edge is assumed to be robust and will not fail, which features a nonuniform failure model. We introduce the (p, q)-Steiner-Connectivity Preservation problem where we protect a minimum-cost set of edges such that the underlying graph maintains p-edge-connectivity between given terminal pairs against edge failures, assuming at most q unprotected edges can fail. We design polynomial-time exact algorithms for the cases where p and q are small and approximation algorithms for general values of p and q. Additionally, we show that when both p and q are part of the input, even deciding whether a given solution is feasible is NP-complete. This hardness also carries over to Flexible Network Design, a research direction that has gained significant attention. In particular, previous work focuses on problem settings where either p or q is constant, for which our new hardness result now provides justification. © Felix Hommelsheim, Zhenwei Liu, Nicole Megow, and Guochuan Zhang.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

ReeSPOT: Reeb graph Models Semantic Patterns of Normalcy in Human Trajectories 27th

ReeSPOT: Reeb Graph Models Semantic Patterns of Normalcy in ...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Bowen Shailja, S. Gudavalli, Chandrakanth Levenson, Connor Khan, Amil S. Manjunath, B. Electrical and Computer Engineering Department University of California Santa Barbara Santa Barbara United States

ISBN: (纸本)9783031781827

This paper introduces ReeSPOT, a novel Reeb graph-based method to model patterns of life in human trajectories (akin to a fingerprint). Human behavior typically follows a pattern of normalcy in day-to-day activities. This is marked by recurring activities within specific time periods. In this paper, we model this behavior using Reeb graphs where any deviation from usual day-to-day activities is encoded as nodes in the Reeb graph. The complexity of the proposed algorithm is linear with respect to the number of time points in a given trajectory. We demonstrate the usage of ReeSPOT and how it captures the critically significant spatial and temporal deviations using the nodes of the Reeb graph. Our case study presented in this paper includes realistic human movement scenarios: visiting uncommon locations, taking odd routes at infrequent times, uncommon time visits, and uncommon stay durations. We analyze the Reeb graph to interpret the topological structure of the GPS trajectories. Potential applications of ReeSPOT include urban planning, security surveillance, and behavioral research. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：