The network reliability in multi-server environment is measured by the connectivity between a vertex and a vertex subset (NA-connectivity). The problem of augmenting a graph by adding the smallest number of new edges to meet NA-edge(vertex)-connectivity requirement is an important optimization problem that contributes to the network design problem to increase the reliability of a current networ...

BACKGROUND Spatial configurations of office environments assessed by Space Syntax methodologies are related to employee movement patterns. These methods require analysis of floors plans which are not readily available in large population-based studies or otherwise unavailable. Therefore a self-report instrument to assess spatial configurations of office environments using four scales was develo...

MEG offers dynamic and spectral resolution for resting-state connectivity which is unavailable in fMRI. However, there are a wide range of available network estimation methods for MEG, and little in the way of existing guidance on which ones to employ. In this technical note, we investigate the extent to which many popular measures of stationary connectivity are suitable for use in resting-stat...

In this paper, we consider the problem of modeling and analyzing the application communication reliability of wireless sensor networks (WSN) with different topologies, including star, tree, mesh, and hierarchical clustering. We propose reliability measures that integrate the conventional connectivity-based network reliability with the sensing coverage measure of WSN. We apply a reduced ordered ...

The node connectivity is usually used to measure the fault tolerance of a multiprocessor system. On the other hand, the diagnosability is an important ability to provide a system level self-diagnosis for maintaining the reliability of a multiprocessor system. It is interesting to investigate the relationship between the connectivity and the diagnosability. Two diagnosis models: PMC model and co...

Connectivity κ(G) of a graph G is the minimum number of vertices whose removal leaves the remaining graph disconnected or trivial. This parameter is important for interconnection networks and can be used to measure reliability in such networks. In this paper, a new interconnection network called locally exchanged twisted cube (LETQ for short), denoted LeTQ(s, t), is proposed. We obtain some bas...