Two-way converter logic for positive and negative binary numbers

This paper describes a hardware implementation of a two-way converter logic by which conversion between numbers from positive to negative binary representation is possible. Index terms: (i) Negative radix, (ii) Positive radix, (iii) Two-way conversion.

Error Checking Digit for Nonconventional Chemical Codes

In handling large volumes of data such as chemical notations, serial numbers for books, etc., it is always advisable to provide checking methods which would indicate the presence of errors. The entire new discipline of coding theory is devoted to the study of the construction of codes which provide such error-detecting and correcting means.l Although these codes are very powerful, they are highly sophisticated from the point of view of practical implementation

Ambient temperature, zinc ion-conducting, binary molten electrolyte based on acetamide and zinc perchlorate: Application in rechargeable zinc batteries

Binary room temperature molten electrolytes based on acetamide and zinc perchlorate have been prepared and characterized. The electrolytes are found to be highly zinc ion-conducting with very favorable physicochemical and electrochemical characteristics. Raman and infrared spectroscopic studies reveal the presence of large free-ion concentration in the molten liquid. This is corroborated by the high conductivity observed under ambient conditions. Rechargeable zinc batteries assembled using gamma-MnO2 as the cathode and Zn as the anode with the molten electrolyte show high discharge capacities over several cycles, indicating excellent reversibility. This unique class of acetamide-based, room temperature molten liquids may become viable and green alternative electrolytes for rechargeable zinc-based secondary batteries. (C) 2009 Elsevier Inc. All rights reserved.

Vibrational force constant and electron relaxation in H2 and Li2

The force constants of H2 and Li2 are evaluated employing their extended Hartree-Fock wavefunctions by a polynomial fit of their force curves. It is suggested that, based on incomplete multiconfiguration Hartree-Fock wavefunctions, force constants calculated from the energy derivatives are numerically more accurate than those obtained from the derivatives of the Hellmann-Feynman forces. It is observed that electrons relax during the nuclear vibrations in such a fashion as to facilitate the nuclear motions.

Ratio transformer bridge for the measurement of dielectric constant of lossy liquids

A three-terminal capacitance bridge is developed for the measurement of the dielectric constant of lossy liquids. Using this modified ratio transformer bridge, the capacitance shunted by a resistance as low as 50 Omega is measured at 10 kHz. The capacitance error associated with the inductance of the connecting wire is compensated using the novel method of introducing an additional transformer to the existing ratio transformer bridge. Other sources of capacitance errors, such as the non-zero output impedence of the ratio transformer and the shield capacitances of the cables, are discussed.

Helical FDK Algorithms With No Backprojection Weight

In this paper, we present two new filtered backprojection (FBP) type algorithms for cylindrical detector helical cone-beam geometry with no position dependent backprojection weight. The algorithms are extension of the recent exact Hilbert filtering based 2D divergent beam reconstruction with no backprojection weight to the FDK type algorithm for reconstruction in 3D helical trajectory cone-beam tomography. The two algorithms named HFDK-W1 and HFDK-W2 result in better image quality, noise uniformity, lower noise and reduced cone-beam artifacts.

Distributed space-time codes with reduced decoding complexity

We address the problem of distributed space-time coding with reduced decoding complexity for wireless relay network. The transmission protocol follows a two-hop model wherein the source transmits a vector in the first hop and in the second hop the relays transmit a vector, which is a transformation of the received vector by a relay-specific unitary transformation. Design criteria is derived for this system model and codes are proposed that achieve full diversity. For a fixed number of relay nodes, the general system model considered in this paper admits code constructions with lower decoding complexity compared to codes based on some earlier system models.

Wavelength/Time Multiple-Pulses-per-Row codes: Construction and verification

Two dimensional Optical Orthogonal Codes (OOCs) named Wavelength/Time Multiple-Pulses-per-Row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in [6]. In this paper, we report the construction of W/T MPR codes, using Greedy Algorithm (GA), with distinct 1-D OOCs [1] as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab.

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

Memory-based reasoning approach for pattern recognition of binary images

Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a memory-based reasoning approach for pattern recognition of binary images with a large template set. It seems that memory-based reasoning intrinsically requires a large database. Moreover, some binary image recognition problems inherently need large template sets, such as the recognition of Chinese characters which needs thousands of templates. The proposed algorithm is based on the Connection Machine, which is the most massively parallel machine to date, using a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given binary image it scans the template pyramid searching the match. A binary image of N × N pixels can be matched in O(log N) time complexity by our algorithm and is independent of the number of templates. Implementation of the proposed scheme is described in detail.