グラフ書き換え言語REGRELによるメタプログラミングの表現

We describe a little the blow–ups of the phase portrait of the intricate point p given in Figure 5. Its first blow–up is given in Figure 6A. In it we see from the upper part of

The approach based on the strangeness index includes un- determined solution components but requires a number of constant rank conditions, whereas the approach based on

Inferences are performed by graph transformations. We look for certain patterns in the graph, each of which causes a new edge to be added to the graph, and an old edge to be

This paper derives a priori error estimates for a special finite element discretization based on component mode synthesis.. The a priori error bounds state the explicit dependency

Debreu’s Theorem ([1]) says that every n-component additive conjoint structure can be embedded into (( R ) n i=1 ,. In the introdution, the differences between the analytical and

The variational constant formula plays an important role in the study of the stability, existence of bounded solutions and the asymptotic behavior of non linear ordinary

These are intended to be a model-independent framework in which to study the totality of (∞, 1)-categories and related

New reductions for the multicomponent modified Korteveg de Vries (MMKdV) equations on the symmetric spaces of DIII-type are derived using the approach based on the reduction