Hydrogen Storage Capacity of Carbon-Foams: Grand Canonical Monte Carlo Simulations

Hydrogen storage in the three-dimensional carbon foams is analyzed using classical grand canonical Monte Carlo simulations. The calculated storage capacities of the foams meet the material-based DOE targets and are comparable to the capacities of a bundle of well-separated similar diameter open nanotubes. The pore sizes in the foams are optimized for the best hydrogen uptake. The capacity depends sensitively on the C-H-2 interaction potential, and therefore, the results are presented for its ``weak'' and ``strong'' choices, to offer the lower and upper bounds for the expected capacities. Furthermore, quantum effects on the effective C-H-2 as well as H-2-H-2 interaction potentials are considered. We find that the quantum effects noticeably change the adsorption properties of foams and must be accounted for even at room temperature.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Data compression by linear prediction for storage and transmission of EEG signals

The EEG time series has been subjected to various formalisms of analysis to extract meaningful information regarding the underlying neural events. In this paper the linear prediction (LP) method has been used for analysis and presentation of spectral array data for the better visualisation of background EEG activity. It has also been used for signal generation, efficient data storage and transmission of EEG. The LP method is compared with the standard Fourier method of compressed spectral array (CSA) of the multichannel EEG data. The autocorrelation autoregressive (AR) technique is used for obtaining the LP coefficients with a model order of 15. While the Fourier method reduces the data only by half, the LP method just requires the storage of signal variance and LP coefficients. The signal generated using white Gaussian noise as the input to the LP filter has a high correlation coefficient of 0.97 with that of original signal, thus making LP as a useful tool for storage and transmission of EEG. The biological significance of Fourier method and the LP method in respect to the microstructure of neuronal events in the generation of EEG is discussed.

Design issues and caching strategies for CD-ROM based multimedia storage

CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities up to 3 GB being available in the near future, they will form an integral part of Video on Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single- user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We also propose an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. In the second section we look at the use of CD-ROM in a VoD server and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt the C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose an admission control algorithm which admits new request streams without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. Finally, we discuss the problem of optimal placement of MPEG streams on CD-ROMs in the third section.

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.

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.