When visualizing graphs into node-link diagrams, angular resolution is often used as one of the aesthetic criteria measuring the diagram quality in terms of human comprehension. However, angular resolution has not bee...
详细信息
ISBN:
(纸本)9781457712456
When visualizing graphs into node-link diagrams, angular resolution is often used as one of the aesthetic criteria measuring the diagram quality in terms of human comprehension. However, angular resolution has not been empirically validated for its relevance to humans. In addition, although many force-directed algorithms have been proposed for automatic graph drawing, performance evaluation of these algorithms has not been conclusive due to the lack of proper methods. To shorten these gaps, this paper 1) validates the aesthetic based on human experimental data and identifies the best of angular resolution measures used in the literature;2) introduces a force-directed algorithm, forceAR, for improving angular resolution;3) proposes a new framework for more reliable and thorough evaluation of force-directed algorithms. Finally as a case study, our forceAR algorithm is evaluated using this framework.
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...
详细信息
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.
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 clust...
详细信息
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.
With the increasing chip density and the continuous improvement of reliability requirements, the concurrent error detection techniques in register transfer level have become an increasing concern. Because of the actua...
详细信息
ISBN:
(纸本)9781424458950
With the increasing chip density and the continuous improvement of reliability requirements, the concurrent error detection techniques in register transfer level have become an increasing concern. Because of the actual low probability of failure occurring, a number of semi-concurrent error detection techniques are feasible. The circuits can be checked in every N iterations. So the recomputations will have N-1 free iterations. This paper can take full advantage of the free iterations to achieve the concurrent processing of the original computation, thus enhancing performance. The proposed strategy is actually independent from a specific scheduling-and-allocation algorithm;however, for recomputations the conventional duplication with comparison leads to high circuit complexity increase. So we modify the force-directed algorithm to ease the hardware overhead as well as to ensure that the data path is fault-secure in an iteration.
We propose a self-contained, flat, force-directed algorithm for global placement that is simpler than existing placers and easier to integrate into timing-closure flows. It maintains lower-bound and upper-bound placem...
详细信息
ISBN:
(纸本)9781424481927
We propose a self-contained, flat, force-directed algorithm for global placement that is simpler than existing placers and easier to integrate into timing-closure flows. It maintains lower-bound and upper-bound placements that converge to a final solution. The upper-bound placement is produced by a novel rough legalization algorithm. Our placer SimPL outperforms mPL6, NTUPlace3, FastPlace3, APlace2 and Capo simultaneously in runtime and solution quality, running 6.4 times faster than mPL6 and reducing wirelength by 2% on the ISPD 2005 benchmark suite.
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 s...
详细信息
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.
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 a...
详细信息
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.
暂无评论