A low-cost lead-acid battery with high specific-energy

Lightweight grids for lead-acid battery grids have been prepared from acrylonitrile. butadiene styrene (ABS) copolymer followed by coating with lead. Subsequently, the grids have been electrochemically coated with a conductive and corrosion-resistant layer of polyaniline. These grids are about 75% lighter than those employed in conventional lead-acid batteries. Commercial-grade 6V/3.5 Ah (C-20-rate) lead-acid batteries have been assembled and characterized employing positive and negative plates constituting these grids. The specific energy of such a lead-acid battery is about 50 Wh/kg. The batteries can withstand fast charge-discharge duty cycles.

A note on the equivalence of shock manifold equations

The shock manifold equation is a first order nonlinear partial differential equation, which describes the kinematics of a shockfront in an ideal gas with constant specific heats. However, it was found that there was more than one of these shock manifold equations, and the shock surface could be embedded in a one parameter family of surfaces, obtained as a solution of any of these shock manifold equations. Associated with each shock manifold equation is a set of characteristic curves called lsquoshock raysrsquo. This paper investigates the nature of various associated shock ray equations.

A Low ML-Decoding Complexity, High Coding Gain, Full-Rate, Full-Diversity STBC for 4 x 2 MIMO System

This paper proposes a full-rate, full-diversity space-time block code(STBC) with low maximum likelihood (ML) decoding complexity and high coding gain for the 4 transmit antenna, 2 receive antenna (4 x 2) multiple-input multiple-output (MIMO) system that employs 4/16-QAM. For such a system, the best code known is the DjABBA code and recently, Biglieri, Hong and Viterbo have proposed another STBC (BHV code) for 4-QAM which has lower ML-decoding complexity than the DjABBA code but does not have full-diversity like the DjABBA code. The code proposed in this paper has the same ML-decoding complexity as the BHV code for any square M-QAM but has full-diversity for 4- and 16-QAM. Compared with the DjABBA code, the proposed code has lower ML-decoding complexity for square M-QAM constellation, higher coding gain for 4- and 16-QAM, and hence a better codeword error rate (CER) performance. Simulation results confirming this are presented.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Sliding Modes for the Simulation of Mechanical and Electrical Systems Defined by Differential-Algebraic Equations

We offer a technique, motivated by feedback control and specifically sliding mode control, for the simulation of differential-algebraic equations (DAEs) that describe common engineering systems such as constrained multibody mechanical structures and electric networks. Our algorithm exploits the basic results from sliding mode control theory to establish a simulation environment that then requires only the most primitive of numerical solvers. We circumvent the most important requisite for the conventionalsimulation of DAEs: the calculation of a set of consistent initial conditions. Our algorithm, which relies on the enforcement and occurrence of sliding mode, will ensure that the algebraic equation is satisfied by the dynamic system even for inconsistent initial conditions and for all time thereafter. [DOI:10.1115/1.4001904]

A Simple Five-Level Inverter Topology for Induction Motor Drive Using Conventional Two-Level Inverters and Flying Capacitor Technique

This paper proposes a new five-level inverter topology for open-end winding induction motor (IM) drive. The popular existing circuit configurations for five-level inverter include the NPC inverter and flying capacitor topologies. Compared to the NPC inverter, the proposed topology eliminates eighteen clamping diodes having different voltage ratings in the present circuit. Moreover it requires only one capacitor bank per phase, whereas flying capacitor schemes for five level topologies require six capacitor banks per phase. The proposed topology is realized by feeding the phase winding of an open-end induction motor with two-level inverters in series with flying capacitors. The flying capacitor voltages are balanced using the switching state redundancy for full modulation range. The proposed inverter scheme is capable of producing two-level to five-level pulse width modulated voltage across the phase winding depending on the modulation range. Additionally, in case of any switch failure in the flying capacitor connection, the proposed inverter topology can be operated as a three-level inverter for full modulation range. The proposed scheme is experimentally verified on a four pole, 5hp induction motor drive.

Generalized Burgers equations and Euler–Painlevé transcendents. III

It was proposed earlier [P. L. Sachdev, K. R. C. Nair, and V. G. Tikekar, J. Math. Phys. 27, 1506 (1986); P. L. Sachdev and K. R. C. Nair, ibid. 28, 977 (1987)] that the Euler–Painlevé equations  y(d2y/dη2)+a(dy/dη)2 +f(η)y(dy/dη)+g(η)y2+b(dy/dη) +c=0 represent generalized Burgers equations (GBE’s) in the same way as Painlevé equations represent the Korteweg–de Vries type of equations. The earlier studies were carried out in the context of GBE’s with damping and those with spherical and cylindrical symmetry. In the present paper, GBE’s with variable coefficients of viscosity and those with inhomogeneous terms are considered for their possible connection to Euler–Painlevé equations. It is found that the Euler–Painlevé equation, which represents the GBE ut+uβux=(δ/2)g(t)uxx, g(t)=(1+t)n, β>0, has solutions, which either decay or oscillate at η=±∞, only when −1equations in Paper II. Thus the parametric value β=βn seems to bifurcate the families of solutions, which remain bounded at η=±∞. Other GBE’s considered here are also found to be reducible to Euler–Painlevé equations.

Modified governing equations for gas-particle nozzle flows

A modified set of governing equations for gas-particle flows in nozzles is suggested to include the inertial forces acting on the particle phase. The problem of gas-particle flow through a nozzle is solved using a first order finite difference scheme. A suitable stability condition for the numerical scheme for gas-particle flows is defined. Results obtained from the present set of equations are compared with those of the previous set of equations. It is also found that present set of equations give results which are in good agreement with the experimental observation.

Studies on follicular growth in the immature rat and hamster: Effect of a single injection of gonadotropin or estrogen on the rate of3H-thymidine incorporation into ovarian DNAin vitro

Initiation of follicular growth by specific hormonal stimuli in ovaries of immature rats and hamsters was studied by determining the rate of incorporation of3H-thymidine into ovarian DNAin vitro. Incorporation was considered as an index of DNA synthesis and cell multiplication. A single injection of pregnant mare serum gonadotropin could thus maximally stimulate by 18 hr3H-thymidine incorporation into DNA of the ovary of immature hamsters. Neutralization of pregnant mare serum gonadotropin by an antiserum to ovine follicle stimulating hormone only during the initial 8–10 hr and not later could inhibit the increase in3H-thymidine incorporationin vitro observed at 18 hr, suggesting that the continued presence of gonadotropin stimulus was not necessary for this response. The other indices of follicular growth monitored such as ovarian weight, serum estradiol and uterine weight showed discernible increase at periods only after the above initial event. A single injection of estrogen (diethyl stilbesterol or estradiol-l7β) could similarly cause 18 hr later, a stimulation in the rate of incorporation of3H-thymidine into DNAin vitro in ovaries of immature rats. The presence of endogenous gonadotropins, however, was obligatory for observing this response to estrogen. Evidence in support of the above was two-fold: (i) administration of antiserum to follicle stimulating hormone or luteinizing hormone along with estrogen completely inhibited the increase in3H-thymidine incorporation into ovarian DNAin vitro; (ii) a radioimmunological measurement revealed following estrogen treatment, the presence of a higher concentration of endogenous follicle stimulating hormone in the ovary. Finally, administration of varying doses of ovine follicle stimulating hormone along with a constant dose of estrogen to immature rats produced a dose-dependent increment in the incorporation of3H-thymidine into ovarian DNAin vitro. These observations suggested the potentiality of this system for developing a sensitive bioassay for follicle stimulating hormone.

Site of synthesis of cytochrome P-450 in liver

The suggestion that a rapidly sedimenting rough endoplasmic reticulum fraction in close association with mitochondria, is the preferred site of cytochrome P-450 synthesis has been examined. The rate of cytochrome P-450 synthesis in the different subcellular fractions has been evaluated Image , using the immunoprecipitation technique. The results indicate that the conventional microsomal fraction (100,000 X g sediment) is the major site of cytochrome P-450 synthesis and that the rapidly sedimenting rough endoplasmic reticulum fraction associated with mitochondria is not a preferred site for the hemoprotein synthesis.

An integer arithmetic method to compute generalized matrix inverse and solve linear equations exactly

An algorithm that uses integer arithmetic is suggested. It transforms anm ×n matrix to a diagonal form (of the structure of Smith Normal Form). Then it computes a reflexive generalized inverse of the matrix exactly and hence solves a system of linear equations error-free.

A parallel multistep predictor-corrector algorithm for solving ordinary differential equations

In this paper we give a generalized predictor-corrector algorithm for solving ordinary differential equations with specified initial values. The method uses multiple correction steps which can be carried out in parallel with a prediction step. The proposed method gives a larger stability interval compared to the existing parallel predictor-corrector methods. A method has been suggested to implement the algorithm in multiple processor systems with efficient utilization of all the processors.

Strain-rate sensitivity and microstructural evolution in a Mg-Al-Zn alloy

Strain rate sensitivity measurements are used to identify twinning and changes in deformation mechanisms in a Mg AZ31 alloy over a wide range of temperatures and grain sizes. At low temperatures, there is significant twinning at low strains with strain-rate insensitivity; at large strains, strain rate sensitivity is noted, corresponding to deformation by multiple slip. At high temperatures, there is very little twinning and this leads to a significant strain rate sensitivity from the early stages of deformation. (C) 2010 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Polarization Caging in Diffusion-Controlled Electron Transfer Reactions in Solution

In some bimolecular diffusion-controlled electron transfer (ET) reactions such as ion recombination (IR), both solvent polarization relaxation and the mutual diffusion of the reacting ion pair may determine the rate and even the yield of the reaction. However, a full treatment with these two reaction coordinates is a challenging task and has been left mostly unsolved. In this work, we address this problem by developing a dynamic theory by combining the ideas from ET reaction literature and barrierless chemical reactions. Two-dimensional coupled Smoluchowski equations are employed to compute the time evolution of joint probability distribution for the reactant (P-(1)(X,R,t)) and the product (p((2))(X,R,t)), where X, as is usual in ET reactions, describes the solvent polarization coordinate and R is the distance between the reacting ion pair. The reaction is described by a reaction line (sink) which is a function of X and R obtained by imposing a condition of equal energy on the initial and final states of a reacting ion pair. The resulting two-dimensional coupled equations of motion have been solved numerically using an alternate direction implicit (ADI) scheme (Peaceman and Rachford, J. Soc. Ind. Appl. Math. 1955, 3, 28). The results reveal interesting interplay between polarization relaxation and translational dynamics. The following new results have been obtained. (i) For solvents with slow longitudinal polarization relaxation, the escape probability decreases drastically as the polarization relaxation time increases. We attribute this to caging by polarization of the surrounding solvent, As expected, for the solvents having fast polarization relaxation, the escape probability is independent of the polarization relaxation time. (ii) In the slow relaxation limit, there is a significant dependence of escape probability and average rate on the initial solvent polarization, again displaying the effects of polarization caging. Escape probability increases, and the average rate decreases on increasing the initial polarization. Again, in the fast polarization relaxation limit, there is no effect of initial polarization on the escape probability and the average rate of IR. (iii) For normal and barrierless regions the dependence of escape probability and the rate of IR on initial polarization is stronger than in the inverted region. (iv) Because of the involvement of dynamics along R coordinate, the asymmetrical parabolic (that is, non-Marcus) energy gap dependence of the rate is observed.