2 resultados para Hierarchical partitioning

em Duke University


Relevância:

20.00% 20.00%

Publicador:

Resumo:

For efficient use of metal oxides, such as MnO(2) and RuO(2), in pseudocapacitors and other electrochemical applications, the poor conductivity of the metal oxide is a major problem. To tackle the problem, we have designed a ternary nanocomposite film composed of metal oxide (MnO(2)), carbon nanotube (CNT), and conducting polymer (CP). Each component in the MnO(2)/CNT/CP film provides unique and critical function to achieve optimized electrochemical properties. The electrochemical performance of the film is evaluated by cyclic voltammetry, and constant-current charge/discharge cycling techniques. Specific capacitance (SC) of the ternary composite electrode can reach 427 F/g. Even at high mass loading and high concentration of MnO(2) (60%), the film still showed SC value as high as 200 F/g. The electrode also exhibited excellent charge/discharge rate and good cycling stability, retaining over 99% of its initial charge after 1000 cycles. The results demonstrated that MnO(2) is effectively utilized with assistance of other components (fFWNTs and poly(3,4-ethylenedioxythiophene)-poly(styrenesulfonate) in the electrode. Such ternary composite is very promising for the next generation high performance electrochemical supercapacitors.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A tree-based dictionary learning model is developed for joint analysis of imagery and associated text. The dictionary learning may be applied directly to the imagery from patches, or to general feature vectors extracted from patches or superpixels (using any existing method for image feature extraction). Each image is associated with a path through the tree (from root to a leaf), and each of the multiple patches in a given image is associated with one node in that path. Nodes near the tree root are shared between multiple paths, representing image characteristics that are common among different types of images. Moving toward the leaves, nodes become specialized, representing details in image classes. If available, words (text) are also jointly modeled, with a path-dependent probability over words. The tree structure is inferred via a nested Dirichlet process, and a retrospective stick-breaking sampler is used to infer the tree depth and width.