Thermodynamic studies on NdFeO3(s)

The enthalpy increments and the standard molar Gibbs energy of formation of NdFeO3(s) have been measured using a hightemperature Calvet microcalorimeter and a solid oxide galvanic cell, respectively. A lambda-type transition, related to magnetic order-disorder transformation (antiferromagnetic to paramagnetic), is apparent from the heat capacity data at similar to 687 K. Enthalpy increments, except in the vicinity of transition, can be represented by a polynomial expression: {Hdegrees(m)(T)-Hdegrees(m) (298.15 K)} /J(.)mol(-1) (+/- 0.7%)=-53625.6+146.0(T/K) +1.150 X 10(-4)(T/K)(2) +3.007 x 10(6)(T/K)(-1); (298.15 less than or equal to T/K less than or equal to 1000). The heat capacity, the first differential of {Hdegrees(m)(T)-Hdegrees(m)(298.15 K)}with respect to temperature, is given by Cdegrees(pm)/J(.)K(-1.)mol(-1)=146.0+ 2.30x10(-4) (T/K) - 3.007 X 10(6)(T/K)(-2). The reversible emf's of the cell, (-) Pt/{NdFeO3(s) +Nd2O3(s)+Fe(s)}//YDT/CSZ// Fe(s)+'FeO'(s)}/Pt(+), were measured in the temperature range from 1004 to 1208 K. It can be represented within experimental error by a linear equation: E/V=(0.1418 +/- 0.0003)-(3.890 +/- 0.023) x 10(-5)(T/K). The Gibbs energy of formation of solid NdFeO, calculated by the least-squares regression analysis of the data obtained in the present study, and data for Fe0.95O and Nd2O3 from the literature, is given by Delta(f)Gdegrees(m)(NdFeO3 s)/kJ (.) mol(-1)( +/- 2.0)=1345.9+0.2542(T/K); (1000 less than or equal to T/K less than or equal to 1650). The error in Delta(f)Gdegrees(m)(NdFeO3, s, T) includes the standard deviation in emf and the uncertainty in the data taken from the literature. Values of Delta(f)Hdegrees(m)(NdFeO3, s, 298.15 K) and Sdegrees(m) (NdFeO3 s, 298.15 K) calculated by the second law method are - 1362.5 (+/-6) kJ (.) mol(-1) and 123.9 (+/-2.5) J (.) K-1 (.) mol(-1), respectively. Based on the thermodynamic information, an oxygen potential diagram for the system Nd-Fe-O was developed at 1350 K. (C) 2002 Elsevier Science (USA).

Pyrochlore ``dynamic spin-ice'' Pr(2)Sn(2)O(7) and monoclinic Pr(2)Ti(2)O(7): A comparative temperature-dependent Raman study

Here we report a temperature-dependent Raman study of the pyrochlore ``dynamic spin-ice'' compound Pr(2)Sn(2)O(7) and compare the results with its non-pyrochlore (monoclinic) counterpart Pr(2)Ti(2)O(7). In addition to phonon modes, we observe two bands associated with electronic Raman scattering involving crystal field transitions in Pr(2)Sn(2)O(7) at similar to 135 and 460 cm(-1) which couple strongly to phonons. Anomalous temperature dependence of phonon frequencies that are observed in Pyrochlore Pr(2)Sn(2)O(7) are absent in monoclinic Pr(2)Ti(2)O(7). This, therefore, confirms that the strong phonon-phonon anharmonic interactions, responsible for the temperature-dependent anomalous behavior of phonons, arise due to the inherent vacant sites in the pyrochlore structure. (C) 2011 Elsevier Inc. All rights reserved.

Thermodynamic, kinetic and electrical switching studies on Si(15)Te(85-x)In(x) glasses: Observation of Boolchand intermediate phase

An interesting topic for quite some time is an intermediate phase observed in chalcogenide glasses, which is related to network connectivity and rigidity. This phenomenon is exhibited by Si-Te-In glasses also. It has been addressed here by carrying out detailed thermal investigations by using Alternating Differential Scanning Calorimetry technique. An effort has also been made to determine the stability of these glasses using the data obtained from different thermodynamic quantities and crystallization kinetics of these glasses. Electrical switching behavior by recording I-V characteristics and variation of switching voltages with indium composition have been studied in these glasses for phase change memory applications. (C) 2011 Elsevier Inc. All rights reserved.

Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis

Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our analysis uses an abstract lattice of formulas to find a pre-condition at the entry of the program such that a null-dereference can occur only if the initial state of the program satisfies this pre-condition. We use a simplified domain of formulas, abstracting out integer arithmetic, as well as unbounded access paths due to recursive data structures. For the sake of precision we model aliasing relationships explicitly in our abstract lattice, enable strong updates, and use a limited notion of path sensitivity. For the sake of scalability we prune formulas continually as they get propagated, reducing to true conjuncts that are less likely to be useful in validating or invalidating the formula. We have implemented our approach, and present an evaluation of it on a set of ten real Java programs. Our results show that the set of design features we have incorporated enable the analysis to (a) explore long, inter-procedural paths to verify each dereference, with (b) reasonable accuracy, and (c) very quick response time per dereference, making it suitable for use in desktop development environments.

Fragment Finder 2.0: a computing server to identify structurally similar fragments

Fragment Finder 2.0 is a web-based interactive computing server which can be used to retrieve structurally similar protein fragments from 25 and 90% nonredundant data sets. The computing server identifies structurally similar fragments using the protein backbone C alpha angles. In addition, the identified fragments can be superimposed using either of the two structural superposition programs, STAMP and PROFIT, provided in the server. The freely available Java plug-in Jmol has been interfaced with the server for the visualization of the query and superposed fragments. The server is the updated version of a previously developed search engine and employs an in-house-developed fast pattern matching algorithm. This server can be accessed freely over the World Wide Web through the URL http://cluster.physics.iisc.ernet.in/ff/.

Synthesis dependent characteristics of Sr1-xMnxTiO3 (x=0.03, 0.05, 0.07 and 0.09)

Sr1-xMnxTiO3 (where x=0.03, 0.05, 0.07 and 0.09) was synthesized via different routes that include solid-state, oxalate precipitation and freeze drying. In oxalate precipitation technique, compositions corresponding to 3 and 5 mol% doping of Mn were monophasic whereas the higher compositions revealed the presence of the secondary phases such as MnO, Mn3O4 etc., as confirmed by high resolution X-ray diffraction (XRD) studies. The decomposition behavior of the precursors prepared using oxalate precipitation method corresponding to the above mentioned compositions was studied. Nanopowders of compositions pertaining to 5 to 9 mol% of Mn doping were obtained using freeze-drying technique. The average crystallite size of these nanopowders was found to be in the 35 to 65 nm range. The microstructural studies carried out on the sintered ceramics, fabricated using powders synthesized by different routes established the fine grained nature ( < 1 mu m) of the one obtained by freeze drying method. Raman scattering studies were carried out in order to complement the observations made from XRD regarding the phase purity. The dielectric properties of the ceramics obtained by different synthesis routes were studied in the 80-300 K temperature range at 100 kHz and the effect of grain size has been discussed. (C) 2012 Elsevier Inc. All rights reserved.

Reuse, recycle to de-bloat software

Most Java programmers would agree that Java is a language that promotes a philosophy of “create and go forth”. By design, temporary objects are meant to be created on the heap, possibly used and then abandoned to be collected by the garbage collector. Excessive generation of temporary objects is termed “object churn” and is a form of software bloat that often leads to performance and memory problems. To mitigate this problem, many compiler optimizations aim at identifying objects that may be allocated on the stack. However, most such optimizations miss large opportunities for memory reuse when dealing with objects inside loops or when dealing with container objects. In this paper, we describe a novel algorithm that detects bloat caused by the creation of temporary container and String objects within a loop. Our analysis determines which objects created within a loop can be reused. Then we describe a source-to-source transformation that efficiently reuses such objects. Empirical evaluation indicates that our solution can reduce upto 40% of temporary object allocations in large programs, resulting in a performance improvement that can be as high as a 20% reduction in the run time, specifically when a program has a high churn rate or when the program is memory intensive and needs to run the GC often.

Phase chemistry of the system Nb-Rh-O

Phase relations in the system Nb-Rh-O at 1223 K were investigated by isothermal equilibration of eleven compositions and analysis of quenched samples using OM, XRD, SEM and EDS. The oxide phase in equilibrium with the alloy changes progressively from NbO to NbO2, NbO2.422 and Nb2O5-x with increasing Rh. Only one ternary oxide NbRhO4 with tetragonal structure (a=0.4708 nm and c=0.3017 nm) was detected. It coexists with Rh and Nb2O5. The standard Gibbs energy of formation of NbRhO4 from its component binary oxides measured using a solid-state electrochemical cell can be represented by the equation; Delta G(f,ox)(o)(J/mol) = -38,350 + 5.818 x T(+/- 96) Constructed on the basis of thermodynamic information of the various alloy and oxide phases are oxygen potential diagram for the system Nb-Rh-O at 1223 K and temperature-composition diagrams at constant partial pressures of oxygen.

New rock salt-related oxides Li3M2RuO6 (M=Co, Ni): Synthesis, structure, magnetism and electrochemistry

We describe the synthesis, crystal structure, magnetic and electrochemical characterization of new rock salt-related oxides of formula, Li3M2RuO6 (M=Co, Ni). The M=Co oxide adopts the LiCoO2 (R-3m) structure, where sheets of LiO6 and (Co-2/Ru)O-6 octahedra are alternately stacked along the c-direction. The M=Ni oxide also adopts a similar layered structure related to Li2TiO3, where partial mixing of Li and Ni/Ru atoms lowers the symmetry to monoclinic (C2/c). Magnetic susceptibility measurements reveal that in Li3Co2RuO6, the oxidation states of transition metal ions are Co3+ (S=0), Co2+ (S=1/2) and Ru4+ (S=1), all of them in low-spin configuration and at 10 K, the material orders antiferromagnetically. Analogous Li3Ni2RuO6 presents a ferrimagnetic behavior with a Curie temperature of 100 K. The differences in the magnetic behavior have been explained in terms of differences in the crystal structure. Electrochemical studies correlate well with both magnetic properties and crystal structure. Li-transition metal intermixing may be at the origin of the more impeded oxidation of Li3Ni2RuO6 when compared to Li3CO2RuO6. Interestingly high first charge capacities (between ca. 160 and 180 mAh g(-1)) corresponding to ca. 2/3 of theoretical capacity are reached albeit, in both cases, capacity retention and cyclability are not satisfactory enough to consider these materials as alternatives to LiCoO2. (C) 2013 Elsevier Inc. All rights reserved.

Scalable flow-sensitive pointer analysis for fava with strong updates

The ability to perform strong updates is the main contributor to the precision of flow-sensitive pointer analysis algorithms. Traditional flow-sensitive pointer analyses cannot strongly update pointers residing in the heap. This is a severe restriction for Java programs. In this paper, we propose a new flow-sensitive pointer analysis algorithm for Java that can perform strong updates on heap-based pointers effectively. Instead of points-to graphs, we represent our points-to information as maps from access paths to sets of abstract objects. We have implemented our analysis and run it on several large Java benchmarks. The results show considerable improvement in precision over the points-to graph based flow-insensitive and flow-sensitive analyses, with reasonable running time.

Discovering Math APIs by Mining Unit Tests

In today's API-rich world, programmer productivity depends heavily on the programmer's ability to discover the required APIs. In this paper, we present a technique and tool, called MATHFINDER, to discover APIs for mathematical computations by mining unit tests of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code to compute the expression by mapping its subexpressions to API method calls. For each subexpression, MATHFINDER searches for a method such that there is a mapping between method inputs and variables of the subexpression. The subexpression, when evaluated on the test inputs of the method under this mapping, should produce results that match the method output on a large number of tests. We implemented MATHFINDER as an Eclipse plugin for discovery of third-party Java APIs and performed a user study to evaluate its effectiveness. In the study, the use of MATHFINDER resulted in a 2x improvement in programmer productivity. In 96% of the subexpressions queried for in the study, MATHFINDER retrieved the desired API methods as the top-most result. The top-most pseudo-code snippet to implement the entire expression was correct in 93% of the cases. Since the number of methods and unit tests to mine could be large in practice, we also implement MATHFINDER in a MapReduce framework and evaluate its scalability and response time.

Oxygen potentials and phase equilibria in the system Ca-Co-O and thermodynamic properties of Ca3Co2O6 and Ca3Co4O9.163

Oxygen potentials established by the equilibrium between three condensed phases, CaOss+CoOss+ Ca3Co2O6 and CoOss+Ca3Co2O6+Ca3CO3.93+O-alpha(9.36-delta), are measured as a function of temperature using solid-state electrochemical cells incorporating yttria-stabilized zirconia as the electrolyte and pure oxygen as the reference electrode. Cation non-stoichiometry and oxygen non-stoichiometry in Ca3Co3.93+alpha O9.36-delta are determined using different techniques under defined conditions. Decomposition temperatures and thermodynamic properties of Ca3Co2O6 and Ca3Co4O9.163 are calculated from the results. The standard entropy and enthalpy of formation of Ca3Co2O6 at 298.15 K are evaluated. Using thermodynamic data from this study and auxiliary information from the literature, phase diagram for the ternary system Ca-Co-O is computed. Isothermal sections at representative temperatures are displayed to demonstrate the evolution of phase relations with temperature. (C) 2014 Elsevier Inc. All rights reserved.

Two techniques to improve the precision of a demand-driven null-dereference verification approach

The problem addressed in this paper is sound, scalable, demand-driven null-dereference verification for Java programs. Our approach consists conceptually of a base analysis, plus two major extensions for enhanced precision. The base analysis is a dataflow analysis wherein we propagate formulas in the backward direction from a given dereference, and compute a necessary condition at the entry of the program for the dereference to be potentially unsafe. The extensions are motivated by the presence of certain ``difficult'' constructs in real programs, e.g., virtual calls with too many candidate targets, and library method calls, which happen to need excessive analysis time to be analyzed fully. The base analysis is hence configured to skip such a difficult construct when it is encountered by dropping all information that has been tracked so far that could potentially be affected by the construct. Our extensions are essentially more precise ways to account for the effect of these constructs on information that is being tracked, without requiring full analysis of these constructs. The first extension is a novel scheme to transmit formulas along certain kinds of def-use edges, while the second extension is based on using manually constructed backward-direction summary functions of library methods. We have implemented our approach, and applied it on a set of real-life benchmarks. The base analysis is on average able to declare about 84% of dereferences in each benchmark as safe, while the two extensions push this number up to 91%. (C) 2014 Elsevier B.V. All rights reserved.

Multithreaded Test Synthesis for Deadlock Detection

Designing and implementing thread-safe multithreaded libraries can be a daunting task as developers of these libraries need to ensure that their implementations are free from concurrency bugs, including deadlocks. The usual practice involves employing software testing and/or dynamic analysis to detect. deadlocks. Their effectiveness is dependent on well-designed multithreaded test cases. Unsurprisingly, developing multithreaded tests is significantly harder than developing sequential tests for obvious reasons. In this paper, we address the problem of automatically synthesizing multithreaded tests that can induce deadlocks. The key insight to our approach is that a subset of the properties observed when a deadlock manifests in a concurrent execution can also be observed in a single threaded execution. We design a novel, automatic, scalable and directed approach that identifies these properties and synthesizes a deadlock revealing multithreaded test. The input to our approach is the library implementation under consideration and the output is a set of deadlock revealing multithreaded tests. We have implemented our approach as part of a tool, named OMEN1. OMEN is able to synthesize multithreaded tests on many multithreaded Java libraries. Applying a dynamic deadlock detector on the execution of the synthesized tests results in the detection of a number of deadlocks, including 35 real deadlocks in classes documented as thread-safe. Moreover, our experimental results show that dynamic analysis on multithreaded tests that are either synthesized randomly or developed by third-party programmers are ineffective in detecting the deadlocks.

Trace Driven Dynamic Deadlock Detection and Reproduction

Dynamic analysis techniques have been proposed to detect potential deadlocks. Analyzing and comprehending each potential deadlock to determine whether the deadlock is feasible in a real execution requires significant programmer effort. Moreover, empirical evidence shows that existing analyses are quite imprecise. This imprecision of the analyses further void the manual effort invested in reasoning about non-existent defects. In this paper, we address the problems of imprecision of existing analyses and the subsequent manual effort necessary to reason about deadlocks. We propose a novel approach for deadlock detection by designing a dynamic analysis that intelligently leverages execution traces. To reduce the manual effort, we replay the program by making the execution follow a schedule derived based on the observed trace. For a real deadlock, its feasibility is automatically verified if the replay causes the execution to deadlock. We have implemented our approach as part of WOLF and have analyzed many large (upto 160KLoC) Java programs. Our experimental results show that we are able to identify 74% of the reported defects as true (or false) positives automatically leaving very few defects for manual analysis. The overhead of our approach is negligible making it a compelling tool for practical adoption.