Sentence examples for graphs determined from inspiring English sources

In Fig. 13, the two stress crack opening bilinear graphs from the specimens tested under stroke control and under CMOD control were compared to the bilinear stress crack opening graphs determined by the CEB-FIP (1990, 2010) model code.

Figure 14 Influence of limited length of feature vector on stability of the GMM emotion classification process; obtained scores (upper set of graphs), determined class of emotion (bottom set); feature sets P3_8, P3_12, and P3_16, N gmix = 6, N iter = 1200; tested sentence expressed by the female speaker in joyous style.

Figure 15 Influence of incorrectly chosen GMM model of gender type on stability of the emotion classification; obtained scores (upper set of graphs), determined class of emotion (bottom set); feature set P3, N gmix = 6, N iter = 1200; tested sentence expressed in neutral speaking style by the male speaker (left two graphs), and by the female speaker (right graphs).

The order in which the contigs are traversed in these graphs determines the contig ordering of the scaffolds.

Nagamochi [23] proved that a graph determined by the frequency of paths with length one can be found in polynomial time if any exists.

The transition between the structural states of the graph determined by the received updates is depicted by a sequence of image frames.

The maximum match is a combination of the following two factors: (1) the size of the common graph determined by mapping and (2) the aggregate sequence similarity between nodes mapped to one another.

The ad hoc region connectivity graph determines the distance between neighboring vehicles.

We have introduced the interference susceptibility with a two-layered conflict graph determining the interference potential using co- and adjacent channel edge weights.

An interaction graph determines the set of all feasible coalitions, in that a coalition C can form only if the subgraph induced over the nodes/agents in C is connected.

The even adjacency split problem is defined as follows: given an undirected graph, determine whether its vertex set can be partitioned into two dominating sets whose sizes differ by at most one.