Sentence examples for a set of connection from inspiring English sources

I represents a set of connection requests.

The controller accepts a set of connection requirements and identifies a non-conflicting subset that can be used to set the state of the switches for data transfer.

For the first case, we establish several criteria of output synchronization under arbitrary switching between a set of connection topologies by employing a common Lyapunov function.

In this paper, we address the problem of scheduling the switching of a set of connection requests one after the other from current routing to another pre-determined routing.

Given a network modeled by an undirected graph where the link cost follows ACMC model and a set of survivable flow demands between node pairs with correspon-ding bandwidth and type of connection (anycast or unicast), this problem aims at finding a set of connection for all flow demands such that the network cost is minimized.

The goal is to find a set of connection for all demands such that the network cost (NCost) is minimized: NCost = ∑ i c i (1 where c i = C k, if B k − 1 < ∑ j Rij < B k Figure 1 The example of survivable unicast transmission.

In this context, the concepts of "complex networks" (e.g., Watts and Strogatz 1998; Barabási and Albert 1999; Girvan and Newman 2002; Estrada 2012) seem to provide new avenues a network is a set of points called "nodes" connected by a set of connections called "links".

A set of connections in the matrix (M) is called a mating for (M).

In this sense reasoning is a set of connections based on experience, common sense, similarity and typicalness.

In addition to your personally-defined set of social graph connections, you also have a set of connections defined by your participation in Networks, Groups, and Events.

This problem aims at finding a set of connections with a minimized network cost in order to protect the network against any single failure.