Narrow Results

A k-containerC(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) is a k*-container if every vertex of G is incident with a path in C(u, v). A graph G is k*-connected if there exists a k*-container between any two distinct vertices u and v. A k-regular graph G is super spanning connected if G is i*-connected for all 1 ≤ i ≤ k. In this paper, we prove that the (n, k)-star graph S_n,k is super spanning connected if n ≥ 3 and (n-k) ≥ 2.

A k-container of a graph G is a set of k internally disjoint paths between two distinct vertices. A k-container of G is a k*-container if it contains all vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices, and a bipartite graph G is k*-laceable if there exists a k*-container between any two vertices from different partite sets of G. A k-connected graph (respectively, bipartite graph) G is super spanning connected (respectively, laceable) if G is r*-connected (r*-laceable) for any r with 1 ≤ r ≤ k. This paper shows that the two-dimensional torus Torus(m, n), m, n ≥ 3, is super spanning connected if at least one of m and n is odd and super spanning laceable if both m and n are even. Furthermore, the super spanning connectivity and spanning laceability of tori with faulty elements have been discussed.

Mobile edge computing (MEC) provides users with low-latency, high-bandwidth, and high-reliability services by migrating the computing power of the cloud computing center to the edge of the network. It is thus being considered an effective solution for the contradiction between the limited computing capabilities of Internet of Things (IoT) devices and the rapid development of delay-sensitive real-time applications. In this study, we propose and design a container union file system based on the differencing hard disk and dynamic loading strategy to address the excessively long migration time caused by the bundling transmission of the file system and container images during container-based service migration. The proposed method involves designing a mechanism based on a remote dynamic loading strategy to avoid the downloading of all container images, thereby reducing the long preparation time before which stateless migration can begin. Furthermore, in view of the excessive latency of the edge service during the stateful migration process, a strategy for avoiding the transmission of the underlying file system and container images is designed to optimize the service interruption time and service quality degradation time. Experiments show that the proposed method and strategy can effectively reduce the migration time of container-based services.

A k-containerC(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u,v) of G is a k*-container if it contains all vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices. The spanning connectivity of G, κ*(G), is defined to be the largest integer k such that G is w*-connected for all 1 ≤ w ≤ k if G is a 1*-connected graph and undefined otherwise. A graph G is super spanning connected if κ* (G) = κ(G). In this paper, we prove that the n-dimensional fully connected cubic network FCCN_n is super spanning connected.

Containers in fuzzy graphs are studied in this paper. A container in a graph is a family of internally disjoint paths between a pair of vertices. Equivalently, a container in a fuzzy graph is a collection of internally disjoint strongest paths. Strongest paths often provide maximum contribution to a network’s traffic flow. Therefore analysis of strongest paths and containers helps examining the dynamics and complexities of networks. Apart from certain structural properties of containers, two classic results on graph degrees are also generalized to fuzzy setup. Spanning containers of blocks, fuzzy trees and locamin cycles are discussed. An algorithm to identify the maximum and minimum capacity of containers and an application related to human trafficking are also proposed.

In the contemporary philosophy of mind, the notion of subjective experience plays a central role. One of the most interesting dimensions of the subjective experience is its time dimension. In this paper I will attempt to develop a plausible model of subjective experience of time based on the following conceptual tools: on the metaphor of the ‘Specious Present’ developed by William James and on the concept of the ‘Thick Moment’ of consciousness, introduced by the British psychologist Nicholas Humphrey. Subsequently, I will deal with two basic properties of time experience: change and duration. I will examine their relation to the previously introduced container view of consciousness. In the second part of this paper, I will apply this model of conscious time experience on some ‘extraordinary’ time experiences to see how this model can accommodate this type of experiences.