Sentence examples for isomorphic mapping from inspiring English sources
This paper is focused on the definition and use of a special isomorphic mapping for low-energy mission analysis.
This paper is concerned with a geometrical approach for low-energy Earth-to-Moon mission analysis, based on isomorphic mapping.
The pose is derived by a virtual graph, which is an isomorphic mapping of the graph of the network connected systems.
The isomorphic mapping of trajectories allows a visual, intuitive representation of periodic orbits and of the related invariant manifolds, which correspond to tubes that emanate from the curve associated with the periodic orbit.
This isomorphic mapping of trajectories allows the identification and intuitive representation of periodic orbits and of the related invariant manifolds, which correspond to tubes that emanate from the curve associated with the periodic orbit.
This work proves how isomorphic mapping (in two distinct forms) can be profitably employed to optimize such transfers, by determining in a geometrical fashion the desired optimization parameters that minimize the delta-v budget required to perform the transfer.
PCA as a manifold provides an isomorphic, direct mapping of high-dimensional data into a lower-dimensional space capturing and representing the information of the original data incrementally.
For any surface with genus at least 3, we prove that the automorphism group of the 1-curve graph is isomorphic to the extended mapping class group; this resolves a conjecture of Schaller from 2000.
For any atom that is not part of an isomorphic substructure, an atom mapping is calculated by MCD, which minimises the number of bonds that are broken and formed.
But the only factor module of Y of length 3 with the same composition factors as Q 1 is Q 1 itself, thus X is the kernel of a non-zero map Y → Q 1. Finally, we use again Lemma 14.8 in order to see that isomorphic kernels of non-zero maps Y → Q 1 are actually identical.
A rooted graph is a multi-graph in which a vertex is designated as the root, and two rooted graphs are isomorphic if there is an isomorphism that maps their roots onto each other.
