AbstractRecently, computation, communication and control are deeply and pervasively embedded into physical and engineered components of transportation Cyber-Physical Systems (CPS). In such systems, the growing complexity of system structure calls for increasing system reliability. Reliability modeling and analysis need not only capture the complex dynamic of transportation systems, but also mus...

This paper treats the fundamental problems of reliability and stability analysis in uncertain networks. Here, we consider a collapsed, post-disaster, traffic network that is composed of nodes (centers) and arcs (links), where the uncertain operationality or reliability of links is evaluated by domain experts. To ensure the arrival of relief materials and rescue vehicles to the disaster areas in...

Many biological systems, from fragmented landscapes to host populations, can be represented as networks of connected habitat patches. Links between patches in these connectivity networks can represent equally diverse processes, from individuals moving through the landscape to pathogen transmissions or successive colonization events in metapopulations. Any of these processes can be characterized...

Modularity is an important topological attribute for functional brain networks. Recent human fMRI studies have reported that modularity of functional networks varies not only across individuals being related to demographics and cognitive performance, but also within individuals co-occurring with fluctuations in network properties of functional connectivity, estimated over short time intervals. ...

BACKGROUND AND PURPOSE Measurements of resting-state functional connectivity have increasingly been used for characterization of neuropathologic and neurodevelopmental populations. We collected data to characterize how much imaging time is necessary to obtain reproducible quantitative functional connectivity measurements needed for a reliable single-subject diagnostic test. MATERIALS AND METH...

In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n 2 for n P 8; and k2(FQn) = 3n 1 for n P 5. That is, for n P 8 (resp. n P 5), at least 3n 2 vertices (resp. 3n 1 edges) of FQn are removed to get a disconnected graph that contains no isolated vertices (resp. edges). When the folded hypercube is used to model th...