The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Clustered graph drawing is widely considered as a good method to overcome the scalability problem when visualizing large (or huge) graphs. Force-directed algorithm is a popular approach for laying graphs yet small to medium size datasets due to its slow convergence time. This paper proposes a new method which combines clustering and a force-directed algorithm, to reduce the computational complexity...
Clustered graphs have been widely consisted in Graph Drawing to overcome the problem of drawing large (or huge) graphs with thousands, or perhaps millions of nodes. Force-directed algorithm is one of the available approaches to draw such graphs with good layouts. However, the force directed methods are often produce very different layout outcomes based on different clustering algorithms that greatly...
How to optimize OPC Group Management is the most frequently asked question when integrating OPC with a SCADA system. Group management assumes that the OPC client has the information to partition OPC items into homogeneous OPC groups with optimal configuration parameters, such as update rate or deadband. In reality, supervised group management mandates an empirical configuration which often leads to...
This paper proposes a new interactive visualization for analyzing large hierarchical structures and networks. The technique combines of different graph layout methods with a layout refinement process, an interactive navigation mechanism and clustering algorithms. The integration of these components makes it flexible in dealing with a variety of graph and hierarchical structures. Interactive exploration...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.