Improved lithium cyclability and storage in a multi-sized pore (''differential spacers'') mesoporous SnO2

A wide pore distribution mesoporous morphology stabilizes SnO2 structure during lithium insertion and removal and in the process remarkably enhances the lithium storage and cyclability.

On the performance of stabilized ?-nickel hydroxide as a nickel-positive electrode in alkaline storage batteries

The internal resistance of a stabilized alpha-nickel hydroxide electrode is found to be lower than that of a beta-nickel hydroxide electrode as shown from studies of the open-circuit potential-time transients at all states-of-charge. Nevertheless, the self-discharge rates of the former is higher. Gasometric studies reveal that the charging efficiency of the alpha-nickel hydroxide electrode is higher than that of the beta-nickel hydroxide electrode.

Advances in storage batteries

Over the years, new power requirements for telecommunication, space, automotive and traction applications have arisen which need to be met. Although lead-acid and nickel-cadmium storage batteries continue to be the work horses with limited advances, associated environmental hazards and recycling are still the issues to be resolved. As a result, lead-acid and nickel-cadmium storage batteries have declined in importance whilst nickel-metal hydride and lithium secondary batteries with superior performances have shown greater acceptability in newer applications. These developments are reflected in this article.

Prediction of reaeration rates in square, stirred tanks

Experiments were conducted on the oxygen transfer coefficient, k(L)a(20), through surface aeration in geometrically similar square tanks, with a rotor of diameter D fitted with six flat blades. An optimal geometric similarity of various linear dimensions, which produced maximum k(L)a(20) for any rotational speed of rotor N by an earlier study, was maintained. A simulation equation uniquely correlating k = k(L)a(20)(nu/g(2))(1/3) (nu and g are kinematic viscosity of water and gravitational constant, respectively), and a parameter governing the theoretical power per unit volume, X = (ND2)-D-3/(g(4/3)nu(1/3)), is developed. Such a simulation equation can be used to predict maximum k for any N in any size of such geometrically similar square tanks. An example illustrating the application of results is presented. Also, it has been established that neither the Reynolds criterion nor the Froude criterion is singularly valid to simulate either k or K = k(L)a(20)/N, simultaneously in all the sizes of tanks, even through they are geometrically similar. Occurrence of "scale effects" due to the Reynolds and the Froude laws of similitude on both k and K are also evaluated.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

Calcium-Decorated Carbyne Networks as Hydrogen Storage Media

Among the carbon allotropes, carbyne chains appear outstandingly accessible for sorption and very light. Hydrogen adsorption on calcium-decorated carbyne chain was studied using ab initio density functional calculations. The estimation of surface area of carbyne gives the value four times larger than that of graphene, which makes carbyne attractive as a storage scaffold medium. Furthermore, calculations show that a Ca-decorated carbyne can adsorb up to 6 H(2) molecules per Ca atom with a binding energy of similar to 0.2 eV, desirable for reversible storage, and the hydrogen storage capacity can exceed similar to 8 wt %. Unlike recently reported transition metal-decorated carbon nanostructures, which suffer from the metal clustering diminishing the storage capacity, the clustering of Ca atoms on carbyne is energetically unfavorable. Thermodynamics of adsorption of H(2) molecules on the Ca atom was also investigated using equilibrium grand partition function.

Interference Alignment as a Tool in Network Coding as Applied to Distributed Storage

In this paper, we outline an approach to the task of designing network codes in a non-multicast setting. Our approach makes use of the concept of interference alignment. As an example, we consider the distributed storage problem where the data is stored across the network in n nodes and where a data collector can recover the data by connecting to any k of the n nodes and where furthermore, upon failure of a node, a new node can replicate the data stored in the failed node while minimizing the repair bandwidth.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit and Optimal Codes for Distributed Storage

In the distributed storage coding problem we consider, data is stored across n nodes in a network, each capable of storing � symbols. It is required that the complete data can be reconstructed by downloading data from any k nodes. There is also the key additional requirement that a failed node be regenerated by connecting to any d nodes and downloading �symbols from each of them. Our goal is to minimize the repair bandwidth d�. In this paper we provide explicit constructions for several parameter sets of interest.