We describe a new animation technique for supporting interactive exploration of a graph, building on the wellknown radial tree layout method. When a node is selected to become the center of interest, our visualization performs an animated transition to a new layout. Our approach is to linearly interpolate the polar coordinates of the nodes, while enforcing constraints on the layout to keep the ...

Hierarchical neural networks consist of multiple neural networks assembled in the form of an acyclic graph. The purpose of this study is to identify the hierarchical radial basis function neural networks and select important input features for each sub-RBF neural network automatically. Based on the pre-defined instruction/operator sets, a hierarchical RBF neural network can be created and evolv...

We give three proofs that the reciprocal of Ihara's zeta function can be expressed as a simple polynomial times a determinant involving the adjacency matrix of the graph. The rst proof, for regular graphs, is based on representing radial symmetric eigenfunctions on regular trees in terms of certain polynomials. The second proof, also for regular graphs, is a consequence of the fact that the res...

The subject of the paper are Schrödinger operators on tree graphs which are radial having the branching number bn at all the vertices at the distance tn from the root. We consider a family of coupling conditions at the vertices characterized by (bn− 1)+4 real parameters. We prove that if the graph is sparse so that there is a subsequence of {tn+1 − tn} growing to infinity, in the absence of the...

for a graph $g$ let $gamma (g)$ be its domination number. we define a graph g to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ed}$ graph) if $g$ has no efficient dominating set (eds) but every graph formed by removing a single vertex from $g$ has at least one eds, and (ii) a hypo-unique domination graph (a hypo-$mathcal{ud}$ graph) if $g$ has at least two minimum dominating sets...

The Polyakov bosonic string is quantised in Euclidean Anti-de Sitter space-time using functional methods. Regularisation of the functional determinants using both heat-kernel and zeta function techniques shows that the AdSD+1 string reduces to the Liouville field theory, as in the flat space-time case. A Feynman graph expansion is used to evaluate (approximately) the coefficient multiplying the...

The purpose of the visualization process is to extract insight from information via visual representations. However, the visualization process itself is information and can be in turn visualized. This work describes a method for visualizing the visualization process using a new focus+context radial graph algorithm. Four different metrics for extracting information from the visualization are exa...

Data exploration and manipulation are traditionally considered independently. In this work, we argue to integrate exploration and manipulation in order to smooth user workflows. Our focus is on changing the visual encoding of graph attributes as an exploration task and on changing attribute values as a manipulation task. We present a novel approach for integrating both tasks via a unified visua...

In the present study a mathematical model for the blood flow in stenosed artery in the presence of magnetic field is proposed. The laminar, incompressible, fully developed, non-Newtonian flow of blood in an artery having multiple stenosis is numerically studied under the action of transverse magnetic field. The governing equations are transformed by using a radial transformation and the numeric...

this report presents a case of left radial artery pseudoaneurysm developing at the previous site of invasive monitoring. the patient had prosthetic mitral valve replacement one month earlier, and anti-coagulation therapy had started on the first post-operative day. the patient’s radial artery aneurysm with a 4-centimeter diameter was resected and the radial artery was ligated.