Nature of copper in the new cuprate superconductors Pb2Sr2Ca1-xLxCu3O8+δ

Based on Cu K-edge absorption spectroscopy as well as Cu(2p3/2) and Cu(LVV) Auger spectroscopies it is shown that the recently discovered Pb2Sr2Ca1-xLxCu3O8+δ (L=Y or Lu) superconductors contain well-defined Cu1+ species in admixture with Cu2+. The proportion of Cu1+ is small in the nonsuperconducting samples with x=1, a feature which is uniquely different from that in YBa2Cu3O7-δ.

Nature of hydrogen atom trapped inside palladium lattice

Colloid of palladium nanoparticles has been prepared by the Solvated Metal Atom Dispersion (SMAD) method. Reaction of Pd(0) nanopowder obtained upon precipitation from the colloid, with ammonia borane (H3N center dot BH3, AB) in aqueous solutions at room temperature results in the generation of active hydrogen atoms. The active hydrogen atoms either combine with one another resulting in H-2 evolution or diffuse into the Pd lattice to afford PdHx. Diffusion of hydrogen atoms leads to an expansion of the Pd lattice. The diffused hydrogen atoms are distributed uniformly over the entire particle. These features were established using powder XRD and electron microscopy studies. The H-1 NMR spectral studies of PdHx before and after desorption of H-2 revealed that the hydrogen atoms trapped inside Pd lattice are hydridic in nature. Desorption of hydrogen from PdHx did not result in complete reversibility suggesting that some hydrogen atoms are strongly trapped inside the Pd lattice. (C) 2010 Professor T. Nejat Veziroglu. Published by Elsevier Ltd. All rights reserved.

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

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.

A dragonfly inspired flapping wing actuated by electro active polymers

An energy-based variational approach is used for structural dynamic modeling of the IPMC (Ionic Polymer Metal Composites) flapping wing. Dynamic characteristics of the wing are analyzed using numerical simulations. Starting with the initial design, critical parameters which have influence on the performance of the wing are identified through parametric studies. An optimization study is performed to obtain improved flapping actuation of the IPMC wing. It is shown that the optimization algorithm leads to a flapping wing with dimensions similar to the dragonfly Aeshna Multicolor wing. An unsteady aerodynamic model based on modified strip theory is used to obtain the aerodynamic forces. It is found that the IPMC wing generates sufficient lift to support its own weight and carry a small payload. It is therefore a potential candidate for flapping wing of micro air vehicles.

Nature of corrosive and abrasive wear in ball mill grinding

Laboratory results of marked-ball wear tests are used to discuss the relative significance of corrosive and abrasive wear in wet grinding. The electrochemical mechanism was investigated by correlating the corrosive wear with the corrosion current obtained from polarization curves under abrasion. Slurry rheology governs the manner in which ground slurries coat grinding balls, thereby influencing not only the grinding efficiency but also abrasive wear. The effects of percent solids and a grinding aid are illustrated.

Nature of the copper species in superconducting YBa2Cu3O7

The nominal composition of YBa2Cu3O7 oxide suggests that 33% of the copper should be in the 3+ state. In structural studies3–5, Cu3+ and Cu2+ ions have been assigned specific sites based on their preferred coordinations, and many of the models of superconductivity also require the presence of Cu3+. Our studies however show that Cu is present only in the Cu1+ and Cu2+ states, the proportion of the former increasing with decreasing temperature. It appears that there is no clear experimental evidence for the presence of Cu3+ in YBa2Cu3O7.

Reactions of bis(isonitrosoethylacetoacetato)palladium(II) with straight chain aliphatic primary amines influence of concentration of the reacting amines on the nature of the products

Reactions of bis(isonitrosoethylacetoacetato)palladium(II), Pd(IEAA)2,with straight chain non-bulky alkylamines, RNH2(R = CH3, C2H5, n-C3H7or n-C4H9) in the mole ratio 1:1 gave bis (B-alkylisonitrosoethylacetoacetateimino)Palladium(II), Pd(R-IEAI)2. In this reaction the coordinated carbonyl groups of Pd(IEAA)2 undergo condensation with amines fo rming Schiff bases (>CNR). On the other hand, the reactions of Pd(IEAA)2 with a large excess of amine yielded N-alkylamido bridgedisonitrosoethylacetoacetatedipalladium(II), μ-(NHR)2[Pd(IEAA)]2 complexes. The complexes are characterized by elemental analyses, magnetic susceptib ility, i.r., p.m.r. and in some cases, nitrogen 1s X-ray photoelectron and mass spectral studies.

Algorithms for Colouring Random k-colourable Graphs

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k greater than or equal to 3. The best known polynomial time approximation algorithms require n(delta) (for a positive constant delta depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be ii-coloured almost surely in polynomial time. In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into ii colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) greater than or equal to n(-1+is an element of) where is an element of is a constant greater than 1/4.

Integration-free algorithms for fixed end-point regulator problems

A new formulation is suggested for the fixed end-point regulator problem, which, in conjunction with the recently developed integration-free algorithms, provides an efficient means of obtaining numerical solutions to such problems.

Chemical approaches to penicillin allergy—V. Nature of reaction between rabbit antigen (CRP-penicillin conjugate) and rabbit antipenicillin antibody

The availability of an electrophoretically homogeneous rabbit penicillin carrier receptor protein (CRP) and rabbit antipenicillin antibody afforded an idealin vitro system to calculate the thermodynamic parameters of the binding of14C benzyl penicillin CRP conjugate (antigen) to the purified rabbit antipenicillin antibody. The thermodynamic parameters of this antigen-antibody reaction has been studied by radio-active assay method by using millipore filter. Equilibrium constant (K) of this reaction has been found to be 2·853×109M−2 and corresponding free energy (ΔG) at 4°C and 37°C has been calculated to be −12·02 and −13·5 kcal/mole, enthalpy (ΔH) and entropy (ΔS) has been found to be 361 kcal/mole and +30 eu/mole respectively. Competitive binding studies of CRP-analogue conjugates with the divalent rabbit antibody has been carried out in the presence of14C-penicilloyl CRP. It was found that 7-deoxy penicillin-CRP complex and 6-amino penicilloyl CRP conjugate binds to the antibody with energies stronger than that with the14C-penicilloyl CRP. All the other analogue conjugates are much weaker in interfering with the binding of the penicilloyl CRP with the antibody. The conjugate of methicillin,o-nitro benzyl penicillin and ticarcillin with CRP do not materially interfere in the process.

Chicken prealbumin: Nature of its heterogeneity and binding of plasma retinol-binding protein and thyroid hormones

The heterogeneity of chicken prealbumin (PA) has been shown to be due to the occurrence of three different plasma proteins (PA1 PA2 and PA3). Equilibrium dialysis studies revealed that the thyroid hormones bind specifically to PA2. These hormones bind at the same site on PA2. Circular dichroism studies failed to reveal conformational changes on interaction of retinol-binding protein and thyroid hormone with PA2. Both retinol-binding protein and thyroid hormone are independently transported by PA2.

The nature of dislocation motion in quasicrystals

Calculations in a hydrodynamic model of quasicrystal dynamics show that dislocation motion in these systems is impeded by a drag far greater than that in crystals.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.