Electrochemical synthesis and characterization of chloride doped polyaniline

Chloride doped polyaniline conducting polymer films have been prepared in a protic acid medium (HCl) by potentiodynamic method in an electrochemical cell and studied by cyclic voltammetry and FTIR techniques. The FTIR spectra confirmed Cl^- ion doping in the polymers. The polymerization rate was found to increase with increasing concentration of aniline monomer. But the films obtained at high monomer concentration were rough having a nonuniform flaky polyaniline distribution. Results showed that the polymerization rate did not increase beyond a critical HCl concentration. Cyclic voltammetry suggested that, the oxidation-reduction current increased with an increase in scan rate and that the undoped polyaniline films were not hygroscopic whereas chloride doped polyaniline films were found to be highly hygroscopic.     

Formation of a geometric pattern with a mobile wireless sensor network

Mobile wireless sensor networks (MWSNs) will enable information systems to gather detailed information about the environment on an unprecedented scale. These self‐organizing, distributed networks of sensors, processors, and actuators that are capable of movement have a broad range of potential applications, including military reconnaissance, surveillance, planetary exploration, and geophysical mapping. In many of the foreseen applications, the MWSN will need to form a geometric pattern without assistance from the user. In military reconnaissance, for example, the nodes will be dropped onto the battlefield from a plane and land at random positions. The nodes will be expected to arrange themselves into a predetermined formation in order to perform a specific task. Thus, we present algorithms for forming a line, circle, and regular polygon from a given set of random positions. The algorithms are distributed and use no communication between the nodes to minimize energy consumption. Unlike past studies of geometric problems where algorithms are either tested in simulations where each node has global knowledge of all the other nodes or implemented on a small number of robots, the robustness of our algorithms has been studied with simulations that model the sensor system in detail. The simulations demonstrate that the algorithms are robust against random errors in the sensors and actuators. © 2004 Wiley Periodicals, Inc.     

Reversed Temperature-Dependent Propagation Delay Characteristics in Nanometer CMOS Circuits

The supply voltage to threshold voltage ratio is reduced with each new technology generation. The gate overdrive variation with temperature plays an increasingly important role in determining the speed characteristics of CMOS integrated circuits. The temperature-dependent propagation delay characteristics, as shown in this brief, will experience a complete reversal in the near future. Contrary to the older technology generations, the speed of circuits in a 45-nm CMOS technology is enhanced when the temperature is increased at the nominal supply voltage. Operating an integrated circuit at the prescribed nominal supply voltage is not preferable for reliable operation under temperature fluctuations. A design methodology based on optimizing the supply voltage for temperature-variation-insensitive circuit performance is proposed in this brief. The optimum supply voltage is 45% to 53% lower than the nominal supply voltage in a 180-nm CMOS technology. Alternatively, the optimum supply voltage is 15% to 35% higher than the nominal supply voltage in a 45-nm CMOS technology. The speed and energy tradeoffs in the supply voltage optimization technique are also presented     

Mixed oxide supported hydrodesulfurization catalysts—a review

Support effects form important aspect of hydrodesulfurization (HDS) studies and mixed oxide supports received maximum attention in the last two decades. This review will focus attention on studies on mixed oxide supported Mo and W catalysts. For convenience of discussion, these are divided into Al₂O₃ containing mixed oxide supports, TiO₂ containing mixed oxide supports, ZrO₂ containing mixed oxide supports and other mixed oxide supports containing all the rest. TiO₂ containing mixed oxides received maximum attention, especially TiO₂–Al₂O₃ supported catalysts. A brief discussion about their prospects for application to ultradeep desulfurization is also included. An overview of the available literature with emphasis on research carried out in our laboratory form the contents of this publication.     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

Unstructured tree search on SIMD parallel computers

We present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on an SIMD machine consists of two major components: a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors, and a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms and verify the results experimentally. The analysis and experiments show that our new load-balancing methods are highly scalable on SIMD architectures. Their scalability is shown to he no worse than that of the best load-balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer     

Mathematical model for computer simulation and control of steelmaking

A dynamic model for computer simulation and control of steelmaking has been developed. It is essentially based on multicomponent mixed transport control theory with the incorporation of energy balance calculations. The model is applicable to both steelmaking in electric furnaces as well as in oxygen steelmaking converters. The adjustable parameters of the model for simulation of oxygen steelmaking are gas evolution rate (G_co). oxygen flux factor (F_o) and emulsification factor (EM). These simulation parameters, when combined with on-line measurement of off-gas composition and temperature, enable complete dynamic control of the process. The model developed is applied, as an example, to an industrially produced heat in a top blown oxygen steelmaking converter and the results of simulation are discussed.