Paintable Battery
نویسندگان
چکیده
If the components of a battery, including electrodes, separator, electrolyte and the current collectors can be designed as paints and applied sequentially to build a complete battery, on any arbitrary surface, it would have significant impact on the design, implementation and integration of energy storage devices. Here, we establish a paradigm change in battery assembly by fabricating rechargeable Li-ion batteries solely by multi-step spray painting of its components on a variety of materials such as metals, glass, glazed ceramics and flexible polymer substrates. We also demonstrate the possibility of interconnected modular spray painted battery units to be coupled to energy conversion devices such as solar cells, with possibilities of building standalone energy capture-storage hybrid devices in different configurations.
منابع مشابه
Characterization of $(2m, m)$-Paintable Graphs
In this paper, we prove that for any graph G and any positive integer m, G is (2m,m)-paintable if and only if G is 2-paintable. It was asked by Zhu in 2009 whether k-paintable graphs are (km,m)-paintable for any positive integer m. Our result answers this question in the affirmative for k = 2.
متن کاملStrengthening (a, b)-Choosability Results to $(a, b)$-Paintability
Let a, b ∈ N. A graph G is (a, b)-choosable if for any list assignment L such that |L(v)| > a, there exists a coloring in which each vertex v receives a set C(v) of b colors such that C(v) ⊆ L(v) and C(u)∩C(w) = ∅ for any uw ∈ E(G). In the online version of this problem, on each round, a set of vertices allowed to receive a particular color is marked, and the coloring algorithm chooses an indep...
متن کاملPlanar Graphs of Girth at least Five are Square (∆ + 2)-Choosable
We prove a conjecture of Dvořák, Král, Nejedlý, and Škrekovski that planar graphs of girth at least five are square (∆ + 2)-colorable for large enough ∆. In fact, we prove the stronger statement that such graphs are square (∆+2)-choosable and even square (∆+2)-paintable.
متن کاملProgramming a Paintable Computer
A paintable computer is defined as an agglomerate of numerous, finely dispersed, ultra-miniaturized computing particles; each positioned randomly, running asynchronously and communicating locally. Individual particles are tightly resource bound, and processing is necessarily distributed. Yet computing elements are vanishingly cheap and are regarded as freely expendable. In this regime, a limiti...
متن کاملOn Choosability and Paintability of Graphs by Ran Wang A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Approved April 2015 by the Graduate Supervisory Committee: H.A. Kierstead, Chair
Let G = (V,E) be a graph. A list assignment L for G is a function from V to subsets of the natural numbers. An L-coloring is a function f with domain V such that f(v) ∈ L(v) for all vertices v ∈ V and f(x) 6= f(y) whenever xy ∈ E. If |L(v)| = t for all v ∈ V then L is a t-list assignment. The graph G is t-choosable if for every t-list assignment L there is an L-coloring. The least t such that G...
متن کامل