Model order reduction through the POD-Galerkin method can lead to dramatic gains in terms of computational efficiency solving physical problems. However, applicability non linear high-dimensional dynamical systems such as Navier–Stokes equations has been shown be limited, producing inaccurate and sometimes unstable models. This paper proposes a deep learning based closure modeling approach for ...

We introduce (ℓ-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially (lattice-ordered) set. Bimonoids form an appropriate framework for the study general notion complementation, which subsumes both Boolean complements in bounded distributive lattices and multiplicative inverses monoids. The central question paper is whether how bimonoids can be embedded...

In the paper a method of translation applied in a new system TGT is discussed. TGT translates texts written in Polish into corresponding utterances in the Polish sign language. Discussion is focused on text-into-text translation phase. Proper translation is done on the level of a predicative representation of the sentence. The representation is built on the basis of syntactic graph that depicts...

In this notes unbounded regular operators on Hilbert C∗-modules over arbitrary C∗-algebras are discussed. A densely defined closed operator t possesses a densely defined adjoint operator if the graph of t is an orthogonal summand. Moreover, for a densely defined closed operator t the graph of t is orthogonally complemented if and only if t is regular. For a given C*-algebra A any densely define...

Graph transformation (GT) is being increasingly used in Model Driven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use, rules are often complemented with OCL application conditions. The advancement of rule post-conditions into pre-conditions is a well-known problem in GT, but current techniques do not consider OCL. In this paper we pr...