3 resultados para Non-directional graph
em CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal
Resumo:
This work reports on the influence of polarization and morphology of electroactive poly(vinylidene fluoride), PVDF, on the biological response of myoblast cells. Non-poled, ‘‘poled +’’ and “poled-“ -PVDF were prepared in the form of films. Further, random and aligned electrospun -PVDF fiber mats were also prepared. It is demonstrated that negatively charged surfaces improve cell adhesion and proliferation and that the directional growth of the myoblast cells can be achieved by the cell culture on oriented fibers. Therefore, the potential application of electroative materials for muscle regeneration is demonstrated.
Resumo:
A large and growing amount of software systems rely on non-trivial coordination logic for making use of third party services or components. Therefore, it is of outmost importance to understand and capture rigorously this continuously growing layer of coordination as this will make easier not only the veri cation of such systems with respect to their original speci cations, but also maintenance, further development, testing, deployment and integration. This paper introduces a method based on several program analysis techniques (namely, dependence graphs, program slicing, and graph pattern analysis) to extract coordination logic from legacy systems source code. This process is driven by a series of pre-de ned coordination patterns and captured by a special purpose graph structure from which coordination speci cations can be generated in a number of di erent formalisms
Resumo:
Current software development often relies on non-trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such a coordination layer is strongly woven within the application at source code level. Therefore, its precise identification becomes a major methodological (and technical) problem and a challenge to any program understanding or refactoring process. The approach introduced in this paper resorts to slicing techniques to extract coordination data from source code. Such data are captured in a specific dependency graph structure from which a coordination model can be recovered either in the form of an Orc specification or as a collection of code fragments corresponding to the identification of typical coordination patterns in the system. Tool support is also discussed