Lithium carbonate and lithium oxalate were incorporated as leachable corrosion inhibitors in model organic coatings for the protection of AA2024-T3. The coated samples were artificially damaged with a scribe. It was found that the lithium-salts are able to leach from the organic coating and form a protective layer in the scribe on AA2024-T3 under neutral salt spray conditions. The present paper...

Submitted to American Journal of Physiology – Regulatory, Integrative and 1 Comparative Physiology 2 3 Acid secretion by mitochondrion-rich cells of medaka (Oryzias latipes) acclimated 4 to acidic fresh water 5 6 7 Chia-Cheng Lin, Li-Yih Lin, Hao-Hsuan Hsu, Violette Thermes, Patrick Prunet, 8 Jiun-Lin Horng, Pung-Pung Hwang 9 10 1 Institute of Cellular and Organismic Biology, Academia Sinica, T...

• Two Simple Applications of the LLL • Packet Routing In this lecture, we prove the general form of the Lovász Local Lemma, and see two applications of the lemma: hypergraph coloring and finding satisfying assignments for Boolean CNF formulas. We then begin studying packet routing, another area in which we will apply the lemma. In the last lecture, we proved the symmetric form of the Lovász Loc...

In the last lecture, we analyzed the Move-To-Front heuristic for searching in a self-organizing linkedlist. In particular, we showed that Move-To-Front is both statically and dynamically optimal (as good as any dynamic list) up to a factor of 2, provided we work under Sleator & Tarjan’s cost model. We also introduced an omniscient algorithm called Order-By-Next-Request [Mun00], and proved that ...

A t-out-of-n secret-sharing scheme allows an honest dealer D to distribute a secret s among n players, such that any subset of t players has no information about s, but every set of t + 1 players can collaboratively reconstruct the secret. The most famous secret-sharing scheme is Shamir’s Sharing Scheme [Sha79] (cf. Section 8.1.2). It uses polynomials to obtain the desired properties. Before pr...

In a previous lecture, we defined the Byzantine agreement/broadcast problems and showed that there is no protocol solving these problems when the fraction of corrupted players is 1/3 or larger. Today, we prove the converse by showing a protocol for broadcast (and hence Byzantine agreement; cf. the previous lecture) when the fraction of corrupted players is less than 1/3. The protocol we will sh...