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

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Wang, Yibo Zhang, Chen Wang, Wei Xu, Fanjiang Wang, Hao Chinese Acad Sci Inst Software Sci & Technol Integrated Informat Syst Lab Beijing 100190 Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100190 Peoples R China

ISBN: (纸本)9781479986965

IdeaGraph is a core component of Idea Discovery, which discovers idea by converting unstructured data into a scenario graph. Since the scenario graph is complex and heterogeneous, the layouts generated by general graph layout algorithms can't well support human cognition. To tackle this issue, a novel graph layout algorithm named CiFDAL is proposed, which is a hybrid of circular layout algorithm and Force-Directed algorithm (FDA). Overall, it places clusters and key nodes on two nested circles, and different hierarchies distinguish their different importance. Specifically, it uses FDA to ensure the related nodes being closer in distance. Additionally, it improves the classical random-initialized FDA by adopting a better initial position set and iterative node-position exchange technique. Experimental results demonstrate the superiority of our algorithm by comparing with several benchmarks implemented in a famous visualization tool - GraphViz.

关键词： Idea Discovery IdeaGraph Scenario graph layout algorithm Human cognition

来源：评论

学校读者我要写书评

暂无评论

An Automatic layout algorithm for BPEL Processes

An Automatic Layout Algorithm for BPEL Processes

引用

5th ACM Symposium on Software Visualization

作者： Albrecht, Benjamin Effinger, Philip Held, Markus Kaufmann, Michael Eberhard Karls Univ Tubingen Wilhelm Schickard Inst Informat Tubingen Germany

ISBN: (纸本)9781450304948

The Business Process Execution Language (BPEL) is the standard execution language for business workflows. BPEL is an XML-based, verbose and complex language, consisting of block- and graph-oriented control structures, which makes it hard to generate intuitive visualizations. Although many tools enable the visualization of workflows before the transformation into executable systems, notations and style criteria for the visualization and layout of workflows are not standardized, so it is very hard to compare different tools. Often, the construction of a layout for a possibly complex workflow is left to the user or the result is visually unsatisfying. We present a novel algorithm for the layout of complex BPEL workflows, which uses the principles of the algorithm by Sugiyama and takes into account BPEL specifics, e.g. nested structures, parallel paths and several distinct types of elements. The BPEL specifics represent challenges to the layout algorithm and are not completely fulfilled by any other layout approach for BPEL.

关键词： Workflow visualization layout algorithm

来源：评论

学校读者我要写书评

暂无评论

A multi-constraint layout algorithm for Dynamic Network Visualization 2

A multi-constraint Layout Algorithm for Dynamic Network Visu...

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Xiaolei Du Yingmei Wei Lingda Wu College of Information System and Management National University of Defense Technology The Key Laboratory Equipment Academy

ISBN: (纸本)9781509036202

Visualizing the evolving process of the dynamic network is a challenge in the Big Data *** addition to presenting network structure at each time step,the layout sequence should preserve user's mental *** this paper,we propose a novel algorithm based on multiple constraints to achieve an aesthetic layout while maintain a coherent mental *** evolution parameter,considering time-space changes in the dynamic process,is presented to restrain nodes' movement and preserve mental *** energy parameter is then applied based on nodes' energy state to achieve a stable and aesthetic *** effectiveness of our method is demonstrated by comparing to previous method using two network data sets.

关键词： network visualization dynamic network layout algorithm

来源：评论

学校读者我要写书评

暂无评论

One-entity stamping die profile and iterative horizontal-line-incision layout algorithm

引用

Jixie Kexue Yu Jishu/Mechanical Science and Technology 2001年第6期20卷 11+940-942+946页

作者： Wang, F. Yu, X. Department of Mechanical Engineering Tsinghua University Beijing 100084 China

The methods and their advantages of using one AutoCAD entity as stamping die profile are presented. A new layout algorithm, called iterative horizontal-line-incision layout algorithm, is put forward based on one-entity profile technology. Comparison between this and the usually used region layout algorithm is made. The module realization and sample application are introduced.

关键词： Iterative horizontal-line-incision layout algorithm One-entity profile Optimal layout Stamping die CAD

来源：评论

学校读者我要写书评

暂无评论

BFL: a node and edge betweenness based fast layout algorithm for large scale networks

引用

BMC BIOINFORMATICS 2009年第1期10卷 19-19页

作者： Hashimoto, Tatsunori B. Nagasaki, Masao Kojima, Kaname Miyano, Satoru Univ Tokyo Ctr Human Genome Inst Med Sci Minato Ku Tokyo 1088639 Japan Harvard Univ Cambridge MA 02138 USA

Background: Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e. g. subcellular localization, biological node and graph attributes, or/and not available for large scale networks, e. g. more than 10000 elements. Results: To overcome these problems, we propose the use of a biologically important graph metric, betweenness, a measure of network flow. This metric is highly correlated with many biological phenomena such as lethality and clusters. We devise a new fast parallel algorithm calculating betweenness to minimize the preprocessing cost. Using this metric, we also invent a node and edge betweenness based fast layout algorithm (BFL). BFL places the high-betweenness nodes to optimal positions and allows the low-betweenness nodes to reach suboptimal positions. Furthermore, BFL reduces the runtime by combining a sequential insertion algorim with betweenness. For a graph with n nodes, this approach reduces the expected runtime of the algorithm to O(n(2)) when considering edge crossings, and to O(n log n) when considering only density and edge lengths. Conclusion: Our BFL algorithm is compared against fast graph layout algorithms and approaches requiring intensive optimizations. For gene networks, we show that our algorithm is faster than all layout algorithms tested while providing readability on par with intensive optimization algorithms. We achieve a 1.4 second runtime for a graph with 4000 nodes and 12000 edges on a standard desktop computer.

关键词： Short Path layout algorithm Node Betweenness Betweenness Score Generalize Zeta Function

来源：评论

学校读者我要写书评

暂无评论

A new dynamical layout algorithm for complex biochemical reaction networks

引用

BMC BIOINFORMATICS 2005年第1期6卷 212-212页

作者： Wegner, K Kummer, U EML Res Bioinformat & Computat Biochem D-69118 Heidelberg Germany

Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computational approaches, visualisation techniques are highly important. Biochemical reaction networks, e. g. metabolic pathways are often depicted as graphs and these graphs should be drawn dynamically to provide flexibility in the context of different data. Conventional layout algorithms are not sufficient for every kind of pathway in biochemical research. This is mainly due to certain conventions to which biochemists/biologists are used to and which are not in accordance to conventional layout algorithms. A number of approaches has been developed to improve this situation. Some of these are used in the context of biochemical databases and make more or less use of the information in these databases to aid the layout process. However, visualisation becomes also more and more important in modelling and simulation tools which mostly do not offer additional connections to databases. Therefore, layout algorithms used in these tools have to work independently of any databases. In addition, all of the existing algorithms face some limitations with respect to the number of edge crossings when it comes to larger biochemical systems due to the interconnectivity of these. Last but not least, in some cases, biochemical conventions are not met properly. Results: Out of these reasons we have developed a new algorithm which tackles these problems by reducing the number of edge crossings in complex systems, taking further biological conventions into account to identify and visualise cycles. Furthermore the algorithm is independent from database information in order to be easily adopted in any application. It can also be tested as part of the SimWiz package (free to download for academic users at [ 1]). Conclusion: The new algorithm reduces the complexity of pathways, as well as edge crossings and edge length in th

关键词： Main Compound Biochemical Network Small Cycle layout algorithm Dummy Node

来源：评论

学校读者我要写书评

暂无评论

An efficient grid layout algorithm for biological networks utilizing various biological attributes

引用

BMC BIOINFORMATICS 2007年第1期8卷 76-76页

作者： Kojima, Kaname Nagasaki, Masao Jeong, Euna Kato, Mitsuru Miyano, Satoru Univ Tokyo Inst Med Sci Ctr Human Genome Minato Ku Tokyo 1088639 Japan

Background: Clearly visualized biopathways provide a great help in understanding biological systems. However, manual drawing of large-scale biopathways is time consuming. We proposed a grid layout algorithm that can handle gene-regulatory networks and signal transduction pathways by considering edge-edge crossing, node-edge crossing, distance measure between nodes, and subcellular localization information from Gene Ontology. Consequently, the layout algorithm succeeded in drastically reducing these crossings in the apoptosis model. However, for larger-scale networks, we encountered three problems: (i) the initial layout is often very far from any local optimum because nodes are initially placed at random, (ii) from a biological viewpoint, human layouts still exceed automatic layouts in understanding because except subcellular localization, it does not fully utilize biological information of pathways, and (iii) it employs a local search strategy in which the neighborhood is obtained by moving one node at each step, and automatic layouts suggest that simultaneous movements of multiple nodes are necessary for better layouts, while such extension may face worsening the time complexity. Results: We propose a new grid layout algorithm. To address problem (i), we devised a new force-directed algorithm whose output is suitable as the initial layout. For (ii), we considered that an appropriate alignment of nodes having the same biological attribute is one of the most important factors of the comprehension, and we defined a new score function that gives an advantage to such configurations. For solving problem (iii), we developed a search strategy that considers swapping nodes as well as moving a node, while keeping the order of the time complexity. Though a nave implementation increases by one order, the time complexity, we solved this difficulty by devising a method that caches differences between scores of a layout and its possible updates. Conclusion: layouts of the new gr

关键词： Time Complexity Optimal layout layout algorithm Distance Cost Swap Operation

来源：评论

学校读者我要写书评

暂无评论

A multilevel layout algorithm for visualizing physical and genetic interaction networks, with emphasis on their modular organization

引用

BIODATA MINING 2012年第1期5卷 2-2页

作者： Tuikkala, Johannes Vahamaa, Heidi Salmela, Pekka Nevalainen, Olli S. Aittokallio, Tero Univ Turku Dept Informat Technol FI-20014 Turku Finland Univ Turku Dept Math FI-20014 Turku Finland Univ Helsinki Inst Mol Med Finland FIMM FI-00014 Helsinki Finland

Background: Graph drawing is an integral part of many systems biology studies, enabling visual exploration and mining of large-scale biological networks. While a number of layout algorithms are available in popular network analysis platforms, such as Cytoscape, it remains poorly understood how well their solutions reflect the underlying biological processes that give rise to the network connectivity structure. Moreover, visualizations obtained using conventional layout algorithms, such as those based on the force-directed drawing approach, may become uninformative when applied to larger networks with dense or clustered connectivity structure. Methods: We implemented a modified layout plug-in, named Multilevel layout, which applies the conventional layout algorithms within a multilevel optimization framework to better capture the hierarchical modularity of many biological networks. Using a wide variety of real life biological networks, we carried out a systematic evaluation of the method in comparison with other layout algorithms in Cytoscape. Results: The multilevel approach provided both biologically relevant and visually pleasant layout solutions in most network types, hence complementing the layout options available in Cytoscape. In particular, it could improve drawing of large-scale networks of yeast genetic interactions and human physical interactions. In more general terms, the biological evaluation framework developed here enables one to assess the layout solutions from any existing or future graph drawing algorithm as well as to optimize their performance for a given network type or structure. Conclusions: By making use of the multilevel modular organization when visualizing biological networks, together with the biological evaluation of the layout solutions, one can generate convenient visualizations for many network biology applications.

关键词： Semantic Similarity layout algorithm layout Option Multilevel Framework Cluster Option

来源：评论

学校读者我要写书评

暂无评论

Automatic layout algorithm for Graphic Language in Visual Communication Design

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2023年第8期14卷 699-708页

作者： Liao, Xiaofang Hu, Xinqian Guangdong Univ Foreign Studies Intelligent Informat Res Inst South China Business Coll Guangzhou 510545 Peoples R China Hunan Univ Technol Zhuzhou 412000 Peoples R China

As computer technology advances, people's capacity for visual perception grows better, and the demands placed on computerized layouts progressively rise. The simple style of graphics is no longer the only option for computer figure video creation;instead, there is a greater tendency to visually represent the effect and improve the aesthetics and expressiveness of visuals and images. Graphic language uses visual components, including shapes, colors, typographies, images, and icons, in a visual communication context to express messages, ideas, and emotions. Graphics language encounters greater chances and obstacles against the backdrop of this information era. Consequently, it is crucial to convert data into graphics language. Visual communication is evolving in some potential directions with the advancement of technological advances and cultural convergence. The graphic language has its distinct visual meaning, and each person's visual experience is extremely diverse and exists in life with various visual elements in different layouts. A hybridized Grid and Content-based Automatic layout (HGC-AL) algorithm for graphic language in Visual Communication Design (VCD) has been developed to produce visually balanced layouts and establish a structured system for arranging content elements. The content-based layout uses design constraints for better alignment and avoids conflict loss. The hierarchical arrangement of graphic elements in a grid layout analyzes the types of visual elements like image, text, and color. Finally, graphic language enhances the visual score and gives flexibility by allowing changes and modifications within the grid layout. Following the design requirements change, the responsive fluid grid supports various graphical content, sizes, and alignments. Thus, compared with existing layout algorithms, the proposed algorithm is validated with metrics like Intersection of Union (IoU), alignment accuracy, content coverage ratio, visual score, scalability rati

关键词： Graphic language visual communication design layout algorithm design elements grid layout content layout

来源：评论

学校读者我要写书评

暂无评论

The Ordered Treemap of Weight Divided layout algorithm

引用

电脑学刊 2019年第5期30卷 31-45页

作者： Bo Yang Weiqun Cao

Existing treemap layout algorithms are inefficient sequentially, while ordered treemap layout algorithms are incapable of squarifying ability and providing continuity. In this paper, we propose a type of ordered treemap of weight divided layout algorithm. The overall idea of the algorithm is to bundle multiple nodes into two nodes with similar weights. Then, the long edge segmentation principle is used to design the rectangular area of the treemap. Through the application of the ＂divide and conquer＂ rule for the new structure of the two power value nodes, the layouts of all the single nodes are accomplished by repeating the above process until completion. We used 50 randomly generated datasets and compared nine types of layout algorithms. The comparison and analysis are made with six indexes for our algorithm. The experimental results show that the algorithm has an advantage in terms of average aspect ratio, continuity, and distance correlation, and that it is suitable for a hierarchical data visualization display that has order requirements.

关键词： hierarchical data layout algorithm ordered treemap square treemap

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：