Exponential dichotomies of evolution operators in Banach spaces

This paper considers three dichotomy concepts (exponential dichotomy, uniform exponential dichotomy and strong exponential dichotomy) in the general context of non-invertible evolution operators in Banach spaces. Connections between these concepts are illustrated. Using the notion of Green function, we give necessary conditions and sufficient ones for strong exponential dichotomy. Some illustrative examples are presented to prove that the converse of some implication type theorems are not valid

Beam Voltage Effects in the Study of Embedded Biological Materials by Secondary Electron Detectors

Thin and semithin sections were extensively examined by the secondary electron (SE) detector in a conventional scanning electron microscope (SEM), and in a transmission electron microscope with a scanning attachment (STEM). Various para-meters, in particular the beam voltage, were shown to affect the final SE image (SEI). As for SEM observation, a surface contrast was imaged at low primary electron (PE) voltages (0.6-2 kV), whereas a subsurface contrast predominated at higher energies (15-30 kV). In STEM, significant differences were not detected by varying the PE in the 20-100 kV range. Surface and subsurface in-formation was simultaneously imaged even though the SEI were better resolved at the highest energy

Endothelialization of a New Dacron Graft in an Experimental Model: Light Microscopy, Electron Microscopy and Immunocytochemistry

Two types of synthetic vascular grafts, Dacron Triaxial and Dacron Gelseal Triaxial, were implanted into both the common carotids of sheep. The animals were sacrificed 1, 2, 8, and 16 weeks after surgery. Multiple specimens, obtained from grafts and anastomoses, were studied by light microscopy, transmission and scanning electron microscopy. A parallel immunocytochemical analysis was performed on some specimens. Dacron Triaxial grafts failed to develop a complete neointimal coverage. Myofibroblasts and fibroblasts were the dominant cells in such synthetic graft. Moreover, focal areas of stripping, platelet deposition, and thrombosis were observed at 8 and 16 weeks. In contrast, a stable endothelial coverage developed on the Gelseal Triaxial grafts after 16 weeks

A model for adapting 3D graphics based on scalable coding, real-time simplification and remote rendering

Most current multiplayer 3D games can only be played on dedicated platforms, requiring specifically designed content and communication over a predefined network. To overcome these limitations, the OLGA (On-Line GAming) consortium has devised a framework to develop distributive, multiplayer 3D games. Scalability at the level of content, platforms and networks is exploited to achieve the best trade-offs between complexity and quality

Choreographies in Practice

Choreographic Programming is a development methodology for concurrent software that guarantees correctness by construction. The key to this paradigm is to disallow mismatched I/O operations in programs, called choreographies, and then mechanically synthesise distributed implementations in terms of standard process models via a mechanism known as EndPoint Projection (EPP). Despite the promise of choreographic programming, there is still a lack of practical evaluations that illustrate the applicability of choreographies to concrete computational problems with standard concurrent solutions. In this work, we explore the potential of choreographies by using Procedural Choreographies (PC), a model that we recently proposed, to write distributed algorithms for sorting (Quicksort), solving linear equations (Gaussian elimination), and computing Fast Fourier Transform. We discuss the lessons learned from this experiment, giving possible directions for the usage and future improvements of choreography languages

Healing of Prosthetic Arterial Grafts

Numerous synthetic biomaterials have been developed as vascular substitutes. In vitro, ex vivo and in vivo studies have demonstrated that in animals, selected materials, i.e., Dacron and ePTFE (expanded polytetrafluoroethylene) grafts, are successfully incorporated in both the large and the small caliber host arteries through a process which is generally referred to as graft healing. Morphologically, this process consists of a series of complex events including fibrin deposition and degradation, monocyte-macrophage recruitment and flow-oriented cell-layer generation, this last event being the complete endothelialization of the arterial substitute. In contrast to experimental animals, the flow surface of synthetic vascular grafts remains unhealed in humans, particularly in the small caliber conduits. Healing in man consists of graft incorporation by the perigraft fibrous tissue response with a surface covered by more or less compacted, cross-linked fibrin. It is therefore obvious that: i) marked differences in graft healing exist between animals and man; and ii) the usual mechanisms of graft endothelialization are partially ineffective in man. In order to guarantee the patency of synthetic vascular grafts for human small artery bypass, new strategies and approaches have recently been attempted. In particular, the endothelial cell seeding approach has been successfully accomplished in animals and is being experimented in human clinical studies. The problems and results of this biological approach are outlined in this paper

Abstract Interpretation of Indexed Grammars.

Indexed grammars are a generalization of context-free grammars and recognize a proper subset of context-sensitive languages. The class of languages recognized by indexed grammars are called indexed languages and they correspond to the languages recognized by nested stack automata. For example indexed grammars can recognize the language {a^n b^n c^n | n > = 1} which is not context-free, but they cannot recognize {(ab^n)^n) | n >= 1} which is context-sensitive. Indexed grammars identify a set of languages that are more expressive than context-free languages, while having decidability results that lie in between the ones of context-free and context-sensitive languages. In this work we study indexed grammars in order to formalize the relation between indexed languages and the other classes of languages in the Chomsky hierarchy. To this end, we provide a fixpoint characterization of the languages recognized by an indexed grammar and we study possible ways to abstract, in the abstract interpretation sense, these languages and their grammars into context-free and regular languages

The Paths to Choreography Extraction

Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification (e.g., Multiparty Session Types) and synthesis of correct-by-construction software (Choreographic Programming). They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most existing software does not come with choreographies yet, which prevents their application. To attack this problem, we propose a novel methodology (called choreography extraction) that, given a set of programs or protocol specifications, automatically constructs a choreography that describes their behavior. The key to our extraction is identifying a set of paths in a graph that represents the symbolic execution of the programs of interest. Our method improves on previous work in several directions: we can now deal with programs that are equipped with a state and internal computation capabilities; time complexity is dramatically better; we capture programs that are correct but not necessarily synchronizable, i.e., they work because they exploit asynchronous communication

Electron Microscopy of Lipid Deposits in Human Atherosclerosis

The filipin probe associated with tannic acid stain was used to study intra-and extracellular lipids in surgically removed human atherosclerotic lesions (n = 20). In particular, intimal thickenings, fatty streaks and fibrolipidic plaques have been investigated by using mainly transmission and scanning electron microscopy. In the intimal thickenings, the lipid deposits were mainly localized in the subendothelial space as homogeneously sized particles (40-140 nm) and more heterogeneous uni-multilamellar vesicles (35-700 nm). Intermediate lipid forms were also observed. In the fatty streaks, the lipid deposits were intracellular and mainly observed in cells with a monocyte/macrophagic phenotype. Lipid inclusions, lipid lysosomal bodies and intracellular cholesterol crystals very similar to those observed in experimentally induced atherosclerosis were documented. In the fibrolipidic plaque the lipid deposits were found both in the intracellular and in the extracellular compartments. Lipids accumulated within arterial macrophages and smooth muscle cells, usually as lipid droplets. Clusters of lipoprotein-like particles (50 nm in diameter) as well as larger uni-multilamellar lipids (700 nm) with an occasional compound appearance were particularly observed bound to elastic tissue and collagen fibers. These morphological observations outline the complexity of lipid metabolism in the various histological aspects of human atherosclerosis

Formal framework for reasoning about the precision of dynamic analysis

Dynamic program analysis is extremely successful both in code debugging and in malicious code attacks. Fuzzing, concolic, and monkey testing are instances of the more general problem of analysing programs by dynamically executing their code with selected inputs. While static program analysis has a beautiful and well established theoretical foundation in abstract interpretation, dynamic analysis still lacks such a foundation. In this paper, we introduce a formal model for understanding the notion of precision in dynamic program analysis. It is known that in sound-by-construction static program analysis the precision amounts to completeness. In dynamic analysis, which is inherently unsound, precision boils down to a notion of coverage of execution traces with respect to what the observer (attacker or debugger) can effectively observe about the computation. We introduce a topological characterisation of the notion of coverage relatively to a given (fixed) observation for dynamic program analysis and we show how this coverage can be changed by semantic preserving code transformations. Once again, as well as in the case of static program analysis and abstract interpretation, also for dynamic analysis we can morph the precision of the analysis by transforming the code. In this context, we validate our model on well established code obfuscation and watermarking techniques. We confirm the efficiency of existing methods for preventing control-flow-graph extraction and data exploit by dynamic analysis, including a validation of the potency of fully homomorphic data encodings in code obfuscation