We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to the circumferences of a set of concentric circles around the origin. Such constraints frequently occur in the layout of social or policy networks, when structural centrality is mapped to geometric centrality, or when the primary intention of the layout is the display of the vicinity of a distingui...

We present a novel method of segmentation of lymph valve leaflets from confocal microscopy studies. By using a user informed, layer based segmentation framework, we segment the outer boundary of the lymph valve in 3D from a series of confocal images. This boundary is then used to compute the surface structure of the vessel by providing a boundary constraint to a dual graph based on minimum surf...

3D model retrieval techniques can be classified as histogram-based, view-based and graph-based approaches. We propose a hybrid shape descriptor which combines the global and local radial distance features by utilizing the histogram-based and view-based approaches respectively. We define an area-weighted global radial distance with respect to the center of the bounding sphere of the model and en...

This paper describes the development of genetic algorithms for their application to the reconfiguration problem of radial distribution electrical networks, taking into account the expected occurrence of voltage sags. The reconfiguration is an optimization problem, which is formulated to obtain a radial topology representing the least voltage sags in certain buses. The electric system is represe...

We present the analysis of photometric and spectroscopic data of two classical Cepheids, FN Aquilae and V1344 Aquilae. Based on the joint treatment of the new and earlier radial velocity data, both Galactic Cepheids have been found to be a member in a spectroscopic binary system. To match the phases of the earlier radial velocity data correctly with the new ones, we also determined the temporal...

This paper is concerned with the consensus tracking problem of high order MIMO nonlinear multi-agent systems. The agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. The communication network topology of agents is assumed to be a fixed undirected graph. A distributed adaptive control method is proposed to solve the consensus problem utilizing re...

To estimate the location-scale parameters of a bell-shaped density on attributed graphs, we consider radial densities as approximations. The problem of estimating the parameters of radial densities on graphs is equivalent to the problem of estimating the parameters of truncated Gaussians in a Euclidean space. Based on this result, we adopt the maximum likelihood method for truncated Gaussians. ...

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

Network analysis uses centralities as a method to order the actors and the links between them according to their importance based on the structural properties of the given network. In mathematical terms a network can be modelled as an instance of the abstract object graph, where the actors of the network are vertices and the links are represented by edges. An intuitive form of visualization of ...

In provenance research, the large scale of data sets often complicates analysis and understanding. One solution is visualization, a tool that enables scientists and analysts to understand large data sets. The standard format for visualizing provenance is the node-link diagram. However, while effective for understanding local activity, the node-link diagram fails to offer a high-level summary of...