The problem of link prediction in temporal networks has attracted considerable recent attention from various domains, such as sociology, anthropology, information science, and computer science. In this paper, we propose a fast similarity-based method to predict the potential links in temporal networks. In this method, we first combine the snapshots of the temporal network into a weighted graph....

conclusions according to the result of this study, the presence of families in a treatment plan could be essential to follow the treatment plan and subsequently reduced the complications of hemodialysis. results the mean ages of the patients in patient-centered and the family-oriented groups were 47.41 ± 10.31 and 48.16 ± 9.21, respectively. the result showed that some of the variables such as ...

We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm...

The study of the viewer-centered object representation known as the aspect graph has recently been an active area of research in computer vision. The aspect graph is desirable because it provides a complete enumeration of all possible distinct views of an object, given a particular model for viewpoint space and adefinition of "distinct". This paper presents a history of the evolution of the asp...

In a previous paper analytical equations were derived for the packing fraction of crystalline structures consisting of bimodal randomly placed hard spheres [H. J. H. Brouwers, Phys. Rev. E 76, 041304 (2007)]. The bimodal packing fraction was derived for the three crystalline cubic systems: viz., face-centered cubic, body-centered cubic, and simple cubic. These three equations appeared also to b...

We propose a novel approach for recognizing 3D CADmade objects in complex range images containing several overlapped and different objects. Objects are modeled by a graph whose nodes are surfaces and arcs are surface relations. We propose an object-centered graph model, called Visual Constraint graph (VC-graph), with special visual constraints modeling occlusions between object surfaces. The VC...

My research interests are concentrated in theoretical computer science, in particular in graph algorithms, approximation algorithms, complexity theory, and quantum computing. In the area of graph algorithms, my work is motivated by the increasing need to understand and manipulate massive graph structures that emerge from web applications and networks, using efficient graph approximation techniq...

Human-centered computing has been described as " an emerging field that aims at bridging the existing gaps between the various disciplines involved with the design and implementation of computing systems that support people's activities " 1. Information visualization is certainly one of the disciplines in the center of human-centered computing 2. Or is it? Since we announced the Call for Paper ...

With the recent technological advances, biological datasets, often represented by networks (i.e., graphs) of interacting entities, proliferate with unprecedented complexity and heterogeneity. Although modern network science opens new frontiers analyzing connectivity patterns in such we still lack data-driven methods for extracting an integral connectional fingerprint a multi-view graph populati...

Let b be a totally integrable graph. Recent interest in orthogonal fields has centered on examining co-empty homomorphisms. We show that Cantor’s criterion applies. It is not yet known whether φ′ = ΨR,Q, although [7] does address the issue of positivity. Therefore is it possible to classify multiply negative triangles?