No abstract

No abstract

The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical algebraic approaches to graph transformation, for the case of monic matches, where rules allow one to specify how the embedding of preserved items should be carried out.This work has been partly funded by projects CLIMT (ANR/(ANR-11-BS02-016), TGV (CNRS-INRIA-FAPERGS/(156779 and 12/0997-7)), VeriTeS (CNPq 485048/2012-4 and 309981/2014-0), PEPSégalité (CNRS).

To investigate the influence of medium amino acid resources on hybridoma cell proliferation and monoclonal antibody secretion, we first determined, in two different cell lines, the pattern of amino acid consumption. We then showed that complementation of each cell line by an amino acid solution prepared to cover its needs led in both cases to a marked increase in cell density and monoclonal antibody production. This observation suggests that the amino acid supply is one of the factors limiting cell growth and productivity in typical batch processes, and we demonstrated that a similar limitation occurs in a semicontinuous culture. Finally, we showed that the cell decline observed after a period of amino acid deficiency is not irreversible and that proliferation could be resumed if the required amino acids were added.

This paper provides an abstract definition of a class of logics, called diagrammatic logics, together with a definition of morphisms and 2-morphisms between them. The definition of the 2-category of diagrammatic logics relies on category theory, mainly on adjunction, categories of fractions and limit sketches. This framework is applied to the formalisation of a parameterisation process. This process, which consists of adding a formal parameter to some operations in a given specification, is presented as a morphism of logics. Then the parameter passing process for recovering a model of the given specification from a model of the parameterised specification and an actual parameter is shown to be a 2-morphism of logics.Downloaded640 types, like the type of integers, while the second layer deals with algebraic structures, like the structure of groups, which are implemented using the abstract data types in the first layer. In addition, this analysis made it clear that in EAT, groups (for instance) are not implemented individually, but are implemented through parameterised families of groups. Lambán et al. (2003) defined an operation called the imp construction -it was given this name because of its role in the implementation process in the system EAT. In fact, the imp construction is a parameterisation process: starting from a specification Σ in which some operations are labelled as 'pure ' (Domínguez et al. 2006), the imp construction builds a new specification Σ A with a distinguished sort A added to the domain of each non-pure operation. Then the parameter passing process derives an implementation of Σ from each implementation of Σ A and each value in the interpretation of A. Moreover, the exact parameterisation property was proved in Lambán et al. (2003): the implementations of EAT algebraic structures are as general as possible in the sense that they are ingredients of terminal objects in some categories of models. The parameter set in the Kenzo and EAT systems is encoded by means of a record of Common Lisp functions, which has a field for each operation in the algebraic structure to be implemented. The pure terms correspond to functions, which can be obtained from the fixed data and do not require any explicit storage, so each particular instance of the record gives rise to an algebraic structure; more details can be found in Lambán et al. (2003). Lambán et al. (2003) then reinterpreted these results for the EAT algebraic structures in terms of object-oriented techniques, like hidden algebras (Goguen and Malcolm 2000) or coalgebras (Rutten 2000). Domínguez et al. (2007) then extended these results in the algebraic framework of institutions (Goguen and Burstall 1984): the imp construction is represented through institution encodings in the sense of Tarlecki (2000). Goguen and Roşu (2002) provided a survey of the different notions of morphisms between institutions,where institution encodings are called forward institution morphisms. In fact, institution encodings are not that common in institution theories, where ...

No abstract

No abstract

No abstract