Sonochemical synthesis of Ce1-xFexO2-delta (0 <= x <= 0.45) and Ce0.65Fe0.33Pd0.02O2-delta nanocrystallites: oxygen storage material, CO oxidation and water gas shift catalyst

Nanocrystalline Ce1-xFexO2-delta (0 <= x <= 0.45) and Ce0.65Fe0.33Pd0.02O2-delta of similar to 4 nm sizes were synthesized by a sonochemical method using diethyletriamine (DETA) as a complexing agent. Compounds were characterized by powder X-ray diffraction (XRD), X-ray photo-electron spectroscopy (XPS) and transmission electron microscopy (TEM). Ce1-xFexO2-delta (0 <= x <= 0.45) and Ce0.65Fe0.33Pd0.02O2-delta crystallize in fluorite structure where Fe is in +3, Ce is in +4 and Pd is in +2 oxidation state. Due to substitution of smaller Fe3+ ion in CeO2, lattice oxygen is activated and 33% Fe substituted CeO2 i.e. Ce0.67Fe0.33O1.835 reversibly releases 0.31O] up to 600 degrees C which is higher or comparable to the oxygen storage capacity of CeO2-ZrO2 based solid solutions (Catal. Today 2002, 74, 225-234). Due to interaction of redox potentials of Pd2+/0(0.89 V) and Fe3+/2+ (0.77 V) with Ce4+/3+ (1.61 V), Pd ion accelerates the electron transfer from Fe2+ to Ce4+ in Ce0.65Fe0.33Pd0.02O1.815, making it a high oxygen storage material as well as a highly active catalyst for CO oxidation and water gas shift reaction. The activation energy for CO oxidation with Ce0.65Fe0.33Pd0.02O1.815 is found to be as low as 38 kJ mol(-1). Ce0.67Fe0.33O1.835 and Ce0.65Fe0.33Pd0.02O1.815 have also shown high activity for the water gas shift reaction. CO conversion to CO2 is 100% H-2 specific with these catalysts and conversion rate was found to be as high 27.2 mu moles g(-1) s(-1) and the activation energy was found to be 46.4 kJ mol(-1) for Ce0.65Fe0.33Pd0.02O1.815.

Impedance parameters and the state-of-charge. III. Zinc-manganese dioxide and magnesium-manganese dioxide dry batteries

The problem of non-destructive determination of the state-of-charge of zinc- and magnesium-manganese dioxide dry batteries is examined experimentally from the viewpoint of internal impedance and open-circuit voltage at equilibrium. It is shown that the impedance is mainly charge-transfer controlled at relatively high states-of-charge and progressively changes over to diffusion control as the state-of-charge decreases in the case of zinc-manganese dioxide dry batteries. On the other hand, the impedance is mainly diffusion controlled for undischarged batteries but becomes charge-transfer controlled as soon as there is some discharge in the case of magnesium-manganese dioxide batteries. It is concluded that the determination of state-of-charge is not possible for both types of batteries by the measurement of impedance parameters due to film-induced fluctuations of these parameters. The measurement of open-circuit voltage at equilibrium can be used as a state-of-charge indicator for Zn-MnO2 batteries but not for Mg-MnO2 batteries.

Laser patterning system for integrated optics and storage applications

A computer-controlled laser writing system for optical integrated circuits and data storage is described. The system is characterized by holographic (649F) and high-resolution plates. A minimum linewidth of 2.5 mum is obtained by controlling the system parameters. We show that this system can also be used for data storage applications.

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.

Smart applications for energy harvested WSNs

A Wireless Sensor Network (WSN) powered using harvested energies is limited in its operation by instantaneous power. Since energy availability can be different across nodes in the network, network setup and collaboration is a non trivial task. At the same time, in the event of excess energy, exciting node collaboration possibilities exist; often not feasible with battery driven sensor networks. Operations such as sensing, computation, storage and communication are required to achieve the common goal for any sensor network. In this paper, we design and implement a smart application that uses a Decision Engine, and morphs itself into an energy matched application. The results are based on measurements using IRIS motes running on solar energy. We have done away with batteries; instead used low leakage super capacitors to store harvested energy. The Decision Engine utilizes two pieces of data to provide its recommendations. Firstly, a history based energy prediction model assists the engine with information about in-coming energy. The second input is the energy cost database for operations. The energy driven Decision Engine calculates the energy budgets and recommends the best possible set of operations. Under excess energy condition, the Decision Engine, promiscuously sniffs the neighborhood looking for all possible data from neighbors. This data includes neighbor's energy level and sensor data. Equipped with this data, nodes establish detailed data correlation and thus enhance collaboration such as filling up data gaps on behalf of nodes hibernating under low energy conditions. The results are encouraging. Node and network life time of the sensor nodes running the smart application is found to be significantly higher compared to the base application.

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.