Sentence examples for mappings can be from inspiring English sources

> -wrap-foot> Mapping functions are able to create mappings based on the data of other mappings: In other words, a mapping function is a projection from at least one mapping to another mapping and, consequently, mappings can be mapped again (see next section).

A more detailed description of the mapping procedure and exemplary mappings can be found in the online documentation at http://www.dasmi.de/.

As explained in[8], Shannon-Kotel'nikov mappings can be used to define compression functions M δ that map the N source symbols into a single value θ ̂.

Because of the 1-to-1 mapping constraints (4,5), the relations between the edge mappings and their head-node mappings can be rewritten in a compact form.

These mappings can be established in an automated manner, using heuristics applied locally at each node.

Several local mappings can be combined giving the capability of "mesh-embedding" to vortex methods.

This motivates and helps identify a set of benchmarks against which approaches to the definition and tooling of such mappings can be judged.

In this paper, we systematically analyze the synchronization dependencies in concurrent systems modeled in the Metropolis design environment, where system functions, high level architectures and function-architecture mappings can be modeled and simulated.

And by Remark 3.1, the ℳ-continuity of the mappings can be replaced by continuity.

Some basic facts on -additive symmetric mappings can be found in [29].

Demiclosedness principle of the class of total asymptotically pseudocontractive mappings can be deduced from Theorem 2.1.