• Aucun résultat trouvé

Giant hybrid polymer/lipid vesicles (Chapter 27)

N/A
N/A
Protected

Academic year: 2021

Partager "Giant hybrid polymer/lipid vesicles (Chapter 27)"

Copied!
56
0
0

Texte intégral

Loading

Figure

Figure 27-1: Illustration of the different membrane structural organization of the membrane in hGUVs  and its principal characteristics
Figure 27 2:  Overlay of maximum intensity 3D projection images taken for A: homogeneous hGUV with  the homogeneously distribution of both signals; B: de-mixed hGUV with green polymer-rich phase and  red lipid rich  phase
Figure 27-3: a) Illustration of the variation of membrane tension resulting from different cooling rates  after preparation onto the membrane structuration:    examples  on vesicles  containing 70% mol (39  mass%) DPPC and 30%mol (61% mass) PDMS-g-(PEO) 2
Table 27-4. Bending modulus (κ) of different liposomes and polymersomes
+4

Références

Documents relatifs

When infecting a hard disk, Stoned writes the original Master Boot Sector to Cylinder 0, Head 0, Sector 7, and then loads it at boot time after the virus has gone

Voilà donc comme aujourdhuy, aussi bien après avoir congnu qu’il faut bien que Dieu veille sur nous, d’autant que tout nous deffaut, que nous souffrions aussi

Mais quand ces prefaces ici sont mises en avant, c’est pour nous ouvrir les oreilles, c’est pour nous percer les cœurs, c’est pour nous donner telle affection de tendre à Dieu

Gordon [516] proposed a method for computing modular inverses, derived from the classical extended Euclidean algorithm (Algorithm 2.107) with multiple-precision division replaced by

expected running time for each input (the expectation being over all outputs of the random number generator used by the algorithm), expressed as a function of the input size..

The remainder of the chapter is organized as follows. Algorithms for the integer factoriza- tion problem are studied in § 3.2. Two problems related to factoring, the RSA problem and

4.55 Fact (running time of Gordon’s algorithm) If the Miller-Rabin test is the primality test used in steps 1, 2, and 4, the expected time Gordon’s algorithm takes to find a

6.4 Definition A binary additive stream cipher is a synchronous stream cipher in which the keystream, plaintext, and ciphertext digits are binary digits, and the output function h