Model transformations are a key element of model-based software development processes. Despite their importance, existing model transformation tools and processes have limited support for reuse, particularly, in the context of product line development that must handle variability among product variants. This forces developers to reinvent the transformation rules thereby adversely impacting thei...

The Myc/Max/Mad family of transcription factors and the eukaryotic initiation factor 4F (4F) complex play fundamental roles in regulating cell growth, proliferation, differentiation, and oncogenic transformation. Recent findings indicate that the role of Myc during cell growth and proliferation is linked to an increase in eIF4F activity in a feedforward relationship, providing a possible molecu...

We present a noncommutative generalization of Lax formalism of U(N) principal chiral model in terms of a one-parameter family of flat connections. The Lax formalism is further used to derive a set of parametric noncommutative Bäcklund transformation and an infinite set of conserved quantities. From the Lax pair, we derive a noncommutative version of the Darboux transformation of the model. PACS...

We investigate one-parameter family of transformation on superfields of super principal chiral model and obtain different zero-curvature representations of the model. The parametric transformation is related to the super Riccati equations and an infinite set of local and non-local conservation laws is derived. A Lax representation of the model is presented which gives rise to a superspace monod...

The paper is a contribution to the problem of semantics-preserving schema restructuring. First, the notion of schema transformation is precisely analysed, its properties of reversibility are stated and an adequate notation is proposed. Then, the paper develops a general family of entity-generating transformations, i.e. operations that add/remove entity types in a schema. This generic transforma...

SPPF (shared packed parse forest) is the best known graph representation of a parse forest (family of related parse trees) used in parsing with ambiguous/conjunctive grammars. Systematic general purpose transformations of SPPFs have never been investigated and are considered to be an open problem in software language engineering. In this paper, we motivate the necessity of having a transformati...

SPPF (shared packed parse forest) is the best known graph representation of a parse forest (family of related parse trees) used in parsing with ambiguous/conjunctive grammars. Systematic general purpose transformations of SPPFs have never been investigated and are considered to be an open problem in software language engineering. In this paper, we motivate the necessity of having a transformati...

each word can be changed over time. understanding the terminology changes in any knowledge is imperative and it prevents the researchers of that knowledge from taking mistakes. this article is trying to perform the semantic transformation of the term of pleura.