Sentence examples for instances of the function from inspiring English sources

Given the existence of an abstract function that expects data collection instructions from the site manager as input, and outputs JSON encoded measurements, additional data sources could be facilitated by implementing new instances of the function Scalability The ingestion process can be scaled horizontally by deploying additional ingestion engines across machines and networks.

If the input is large, many instances of the map function can execute in parallel on different portions of the input and divide the running time by the number of processors available.

In particular, multiple SON functions, or instances of the same function running in neighboring cells, can be executed in parallel and may then interact such that the originally intended operation from one function is affected, and the related system performance may be different from what was intended to be.

The previous conditions are guaranteed when (h: ( 0,1 ] rightarrow [ 0,infty ) ) is a strictly decreasing bijection between (( 0,1 ] ) and ([ 0,infty ) ) such that h and (h^{-1}) are continuous (in a broad sense, it is sufficient to assume the continuities of h and (h^{-1}) on the extremes of the respective domains). For instance, this is the case of the function (h(t)=1/t-1) for all (tin ( 0,1 ] ).

For maximum flexibility two instances of the same function have been created.

When two names wd and wd2 are both bound to a withdraw function, it does matter whether they are bound to the same function or different instances of that function.

The function individuals are instances of the concepts from the function taxonomy in Figure 2. In the example in Figure 7, the individual sp Automatic_light1 is an instance of comms:Automatic_light_control and sp Constant_light_control1 is an instance of comms:Constant_light_control.

Each instance of the reduce function therefore executes only dependent tuple keys from the map function, and there can be as many reduce functions executing in parallel as the number of keys.

Each instance of the reduce function executes independently, so there can be as many reduce functions executing in parallel as there are distinct keys, i.e. k-mers in the input.

For instance, an observer may be able to obtain the results of an arbitrary instance of the halting function for Turing machines.

The critical assumption of a Naïve Bayes classifier is the conditional independence of the set of attributes that describes each x ∈ X instance of the target function f: X → Y. Like in the SVM method, no clear classification model is provided to the investigator, who can only perform a "blind" assignment of specimen to species.