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

Planning-oriented optimization strategy for visualizing power distribution networks:from global to local

International Journal of Digital Earth 2021年第12期14卷 1775-1797页

作者： Rui Li Bingzhen Chen Guangsheng Dong Huayi Wu State Key Laboratory of Information Engineering in Surveying Mapping and Remote SensingWuhan UniversityWuhanHubeiPeople’s Republic of China

The spatial distribution of power facilities is uneven,thereby making the topology of geographical wiring diagrams(GWDs)based on the actual coordinates unclear.A single-line diagram has the advantage of a clear topology but it lacks spatial locations.A GWD has the advantage of accurate spatial locations but it lacks a clear *** distribution networks for planning requires both *** proposed a new planning-oriented method for optimizing the visualization of distribution *** the global perspective,we proposed an improved force-directed(FD)algorithm by introducing a space restriction strategy and node–edge repulsion strategy to promote the expansion of the distance between distribution facilities within a limited *** then constructed the constrained Delaunay triangulation to identify the compact districts(CDs)and used a genetic algorithm to optimize the parameters for the improved FD algorithm.A novel visualization evaluation indicator was also proposed for quantitatively assessing the *** a local perspective,the fisheye algorithm was used to optimize the CDs to further improve the visualization of the distribution *** verified the proposed methods with real-world *** used limited spatial displacement in exchange for maximum topology clarity to balance the accurate spatial location and topology clarity.

关键词： Visualization optimization geographical wiring diagrams force-directed algorithm fisheye algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved force-directed algorithm Based on Emergence for Visualizing Complex Network

引用

Chinese Intelligent Automation Conference (CIAC)

作者： Li, Hongbo Geng, Wenjing Wu, Yu Wang, Xian Chongqing Univ Posts & Telecommun Inst Web Intelligence 2 Chongwen Rd Chongqing Peoples R China

ISBN: (纸本)9783642384660;9783642384653

Visualization of complex network is one of the most important and difficult issues in complexity science. Most current visualization algorithms are based on drawing aesthetically and it's difficult for them to find the structure information of complex network. To solve this problem, the Fruchterman-Reingold (FR) algorithm based on the force-directed layout is studied in this paper, which is most suitable for the visualization of complex network. From the emergent characteristic of complex network, an improved adaptive FR algorithm is proposed to reduce dependence on parameters in the FR algorithm. In the improved algorithm, the impact of the clustering coefficient on the attraction-repulsion between vertices is considered, and the clustering coefficient is thought to be a determinative indicator for emergence. Then, with the attraction-repulsion the topological characteristic of complex network is visualized. Experiments show that the improved algorithm makes the observation of the structure of complex network much easier. In addition, the improved algorithm displays superior stability and adaptability during experiments.

关键词： Emergence force-directed algorithm Complex network Clustering coefficient Visualization technology

来源：评论

学校读者我要写书评

暂无评论

An Improved force-directed algorithm Based on Emergence for Visualizing Complex Network

An Improved Force-Directed Algorithm Based on Emergence for ...

引用

2013年中国智能自动化学术会议

作者： Hongbo Li Wenjing Geng Yu Wu Xian Wang Institute of Web Intelligence Chongqing University of Posts and Telecommunications

Visualization of complex network is one of the most important and difficult issues in complexity *** current visualization algorithms are based on drawing aesthetically and it's difficult for them to find the structure information of complex *** solve this problem,the Fruchterman-Reingold (FR) algorithm based on the force-directed layout is studied in this paper, which is most suitable for the visualization of complex *** the emergent characteristic of complex network,an improved adaptive FR algorithm is proposed to reduce dependence on parameters in the FR *** the improved algorithm,the impact of the clustering coefficient on the attractionrepulsion between vertices is considered,and the clustering coefficient is thought to be a determinative indicator for ***,with the attraction-repulsion the topological characteristic of complex network is *** show that the improved algorithm makes the observation of the structure of complex network much *** addition,the improved algorithm displays superior stability and adaptability during experiments.

关键词： Emergence force-directed algorithm Complex network Clustering coefficient Visualization technology

来源：评论

学校读者我要写书评

暂无评论

Singlow: Simulator for General Network Flow Problems

Singlow: Simulator for General Network Flow Problems

引用

International Conference on Innovative Trends in Information Technology (ICITIIT)

作者： Raghavan, S. Bhagtya, Paras Chandrasekaran, K. Natl Inst Technol Dept Comp Sci & Engn Surathkal Karnataka India

ISBN: (数字)9781728142104

ISBN: (纸本)9781728142104

Simulation is an important process and an inevitable part of engineering. There are several applications of simulation with one of the important being visualization of complex methods and processes. This paper aims at creating a simulator for general network flow optimization problems. This work uses a modular approach for creating a simulator. A simulator in this area is necessary for several reasons. The main reason for requirement is its usefulness in explaining the problems to the people/students who might use these kinds of network optimization methods to solve several variety of problems. This simulator can simulate standard problems namely transportation problems with various methods, network flow problem and some popular problems in that area. This simulator will be helpful for educational institutions to teach the students about the standard problems on network flow optimization. Here this paper proposes a framework i.e. Singlow for the above mentioned purpose. This paper explains the framework with the flow of execution by keeping in mind a general simulation software. The Simulator has been designed and implemented using Processing 3.4, a software which facilitates designing graphical user interfaces.

关键词： Simulation Network Flow Optimization Vogels Approximation Method Singlow force-directed algorithm

来源：评论

学校读者我要写书评

暂无评论

CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks

引用

JOURNAL OF SUPERCOMPUTING 2018年第10期74卷 5558-5577页

作者： Cheong, Se-Hang Si, Yain-Whar Univ Macau Dept Comp & Informat Sci Ave Univ Taipa Macau Peoples R China

Efficient message forwarding in mobile ad hoc network in disaster scenarios is challenging because location information on the boundary and interior nodes is often unavailable. Information related to boundary nodes can be used to design efficient routing protocols as well as to prolong the battery power of devices along the boundary of an ad hoc network. In this article, we developed an algorithm, CWBound, which discovers boundary nodes in a complex non-convex mobile ad hoc (CNCAH) networks. Experiments show that the CWBound algorithm is at least three times faster than other state-of-the-art algorithms, and up to 400 times faster than classical force-directed algorithms. The experiments also confirmed that the CWBound algorithm achieved the highest accuracy (above 97% for 3 out of the 4 types of CNCAH networks) and sensitivity (90%) among the algorithms evaluated.

关键词： Mobile ad hoc network force-directed algorithm Boundary node detection Complex non-convex ad hoc network

来源：评论

学校读者我要写书评

暂无评论

Boundary Node Detection and Unfolding of Complex Non-Convex Ad Hoc Networks

引用

ACM TRANSACTIONS ON SENSOR NETWORKS 2018年第1期14卷 1-1页

作者： Cheong, Se-Hang Si, Yain-Whar Univ Macau Fac Sci & Technol Dept Comp & Informat Sci Ave Univ Taipa Macau Peoples R China

Complex non-convex ad hoc networks (CNCAH) contain intersecting polygons and edges. In many instances, the layouts of these networks are not entirely convex in shape. In this article, we propose a Kamada-Kawai-based algorithm called W-KK-MS for boundary node detection problems, which is capable of aligning node positions while achieving high sensitivity, specificity, and accuracy in producing a visual drawing from the input network topology. The algorithm put forward in this article selects and assigns weights to top-k nodes in each iteration to speed up the updating process of nodes. We also propose a novel approach to detect and unfold stacked regions in CNCAH networks. Experimental results show that the proposed algorithms can achieve fast convergence on boundary node detection in CNCAH networks and are able to successfully unfold stacked regions. The design and implementation of a prototype system called ELnet for analyzing CNCAH networks is also described in this article. The ELnet system is capable of generating synthetic networks for testing, integrating with force-directed algorithms, and visualizing and analyzing algorithms' outcomes.

关键词： Kamada-Kawai boundary detection force-directed algorithm mobile ad hoc network

来源：评论

学校读者我要写书评

暂无评论

Interactive Network Clustering Layout Method Based on Implicit Connection 2

Interactive Network Clustering Layout Method Based on Implic...

引用

2nd IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Hu, Huaquan Wu, Lingda Yu, Ronghuan Equipment Acad Sci & Technol Complex Elect Syst Simulat Lab Beijing Peoples R China

ISBN: (纸本)9781538616000

force-directed algorithms are devoted to creating network visualization that better meet aesthetic standards but rarely consider interactive requirements, making it difficult to place certain nodes with semantic clustering features together through interactive operations. To solve this problem, we realize the interactive semantic clustering visualization through implicit connection. The key steps include: First, to layout the network to equilibrium state using traditional algorithm;then, to establish implicit connections interactively, so adjusting the repulsion and attraction forces to break the balanced state and generate semantic clustering. Experiments show that our algorithm has the same quality as the traditional algorithms. The advantage of our algorithm is that it can meet the user's interaction needs, so our results are more able to meet the user's expectations.

关键词： force-directed algorithm interactive layout implicit connection network visualization clustering layout

来源：评论

学校读者我要写书评

暂无评论

Accelerating the Kamada-Kawai algorithm for Boundary Detection in a Mobile Ad Hoc Network

引用

ACM TRANSACTIONS ON SENSOR NETWORKS 2017年第1期13卷 3-3页

作者： Cheong, Se -Hang Si, Yain-Whar Univ Macau Dept Comp & Informat Sci Fac Sci & Technol Ave Univ Taipa Macau Peoples R China

force-directed algorithms such as the Kamada-Kawai algorithm have shown promising results for solving the boundary detection problem in a mobile ad hoc network. However, the classical Kamada-Kawai algorithm does not scale well when it is used in networks with large numbers of nodes. It also produces poor results in non-convex networks. To address these problems, this article proposes an improved version of the Kamada-Kawai algorithm. The proposed extension includes novel heuristics and algorithms that achieve a faster energy level reduction. Our experimental results show that the improved algorithm can significantly shorten the processing time and detect boundary nodes with an acceptable level of accuracy.

关键词： Kamada-kawai boundary detection force-directed algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast layout computation of clustered networks: algorithmic advances and experimental analysis

引用

INFORMATION SCIENCES 2014年 260卷 185-199页

作者： Didimo, Walter Montecchiani, Fabrizio Univ Perugia Dipartimento Ingn Elettron & Informaz I-06100 Perugia Italy

The visual analysis of large and complex relational data sets is a growing need in many application domains, such as social sciences, biology, computer networks, and software engineering. In this respect, the capability of quickly computing two-dimensional layouts of hierarchically clustered networks plays an important role and should be a major requirement of many graph visualization systems. We present algorithmic and experimental advances on the subject, namely: (i) we propose a new drawing algorithm that combines space-filling and fast force-directed methods;it runs in O(n log n + m) time, where n and m are the number of vertices and edges of the network, respectively. This running time does not depend on the number of clusters, thus the algorithm guarantees good time performance independently of the structure of the cluster hierarchy. As a further advantage, the algorithm can be easily parallelized. (ii) We discuss the results of an experimental analysis aimed at understanding which clustering algorithms can be used in combination with our visualization technique to generate better quality drawings for small-world and scale-free networks of medium and large size. As far as we know, no previous similar experiments have been done to this aim. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Graph drawing Network visualization Hierarchical clustering Multi-scale algorithm force-directed algorithm Treemap algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast successive over-relaxation algorithm for force-directed network graph drawing

引用

Science China(Information Sciences) 2012年第3期55卷 677-688页

作者： WANG YongXian & WANG ZhengHua National Key Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha 410073, China 1. National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation (SOR) strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.

关键词： graph drawing graph layout successive over-relaxation force-directed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：