Charge order suppression, emergence of ferromagnetism and absence of exchange bias effect in Bi0.25Ca0.75MnO3 nanoparticles: Electron paramagnetic resonance and magnetization studies

We report the results of magnetization and electron paramagnetic resonance (EPR) studies on nanoparticles (average diameter similar to 30 nm) of Bi0.25Ca0.75MnO3 (BCMO) and compare them with the results on bulk BCMO. The nanoparticles were prepared using the nonaqueous sol-gel technique and characterized by XRD and TEM analysis. Magnetization measurements were carried out with a commercial physical property measurement system (PPMS). While the bulk BCMO exhibits a charge ordering transition at similar to 230 K and an antiferromagnetic (AFM) transition at similar to 130 K, in the nanoparticles, the CO phase is seen to have disappeared and a transition to a ferromagnetic (FM) state is observed at T-c similar to 120 K. However, interestingly, the exchange bias effect observed in other nanomanganite ferromagnets is absent in BCMO nanoparticles. EPR measurements were carried out in the X-band between 8 and 300 K. Lineshape fitting to a Lorentzian with two terms (accounting for both the clockwise and anticlockwise rotations of the microwave field) was employed to obtain the relevant EPR parameters as functions of temperature. The results confirm the occurrence of ferromagnetism in the nanoparticles of BCMO. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4730612]

Ferrimagnetism, antiferromagnetism, and magnetic frustration in La2-xSrxCuRuO6 (0 <= x <= 1)

We studied structural and magnetic properties of a series of insulating double perovskite compounds, La2-xSrxCuRuO6 (0 <= x <= 1), representing doping via A-site substitution. The end members La2CuRuO6 and LaSrCuRuO6 form in monoclinic structure while the intermediate Sr doped compounds stabilize in triclinic structure. The Cu and Ru ions sit on alternate B sites of the perovskite lattice with similar to 15% antisite defects in the undoped sample while the Sr-doped samples show a tendency to higher ordering at B sites. The undoped (x = 0) compound shows a ferrimagnetic-like behavior at low temperatures. In surprising contrast to the usual expectation of an enhancement of ferromagnetic interaction on doping, an antiferromagnetic-like ground state is realized for all doped samples (x > 0). Heat capacity measurements indicate the absence of any long-range magnetic order in any of these compounds. The magnetic relaxation and memory effects observed in all compounds suggest glassy dynamical properties associated with magnetic disorder and frustration. We show that the observed magnetic properties are dominated by the competition between the nearest-neighbor Ru-O-Cu 180 degrees superexchange interaction and the next-nearest-neighbor Ru-O-O-Ru 90 degrees superexchange interaction as well as by the formation of antisite defects with interchanged Cu and Ru positions. Our calculated exchange interaction parameters from first principles calculations for x = 0 and x = 1 support this interpretation.

Magnetic Properties of Fe/Cu Codoped ZnO Nanocrystals

Free-standing ZnO nanocrystals simultaneously doped with Fe and Cu with varying Fe/Cu compositions have been synthesized using colloidal methods with a mean size of similar to 7.7 nm. Interestingly, while the Cu-doped ZnO nanocrystal remains diamagnetic and Fe-doped samples show antiferromagnetic interactions between Fe sites without any magnetic ordering down to the lowest temperature investigated, samples doped simultaneously with Fe and Cu show a qualitative departure in exhibiting ferromagnetic interactions, with suggestions of ferromagnetic order at low temperature. XAS measurements establish the presence of Fe2+ and Fe3+ ions, with the concentration of the trivalent species increasing in the presence of Cu doping, providing direct evidence of the Fe2+ + Cu2+ sic Fe3+ + Cu+ redox couple being correlated with the ferromagnetic property. Using DFT, the unexpected ferromagnetic nature of these systems is explained in terms of a double exchange between Fe atoms, mediated by the Cu atom, in agreement with experimental observations.

Interacting fermions in synthetic non-Abelian gauge fields

Generation and study of synthetic gauge fields has enhanced the possibility of using cold atom systems as quantum emulators of condensed matter Hamiltonians. In this article we describe the physics of interacting spin -1/2 fermions in synthetic non-Abelian gauge fields which induce a Rashba spin-orbit interaction on the motion of the fermions. We show that the fermion system can evolve to a Bose-Einstein condensate of a novel boson which we call rashbon. The rashbon-rashbon interaction is shown to be independent of the interaction between the constituent fermions. We also show that spin-orbit coupling can help enhancing superfluid transition temperature of weak superfluids to the order of Fermi temperature. A non-Abelian gauge field, when used in conjunction with another potential, can generate interesting Hamiltonians such as that of a magnetic monopole.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

MPI-based parallel synchronous vector evaluated particle swarm optimization for multi-objective design optimization of composite structures

This paper presents a decentralized/peer-to-peer architecture-based parallel version of the vector evaluated particle swarm optimization (VEPSO) algorithm for multi-objective design optimization of laminated composite plates using message passing interface (MPI). The design optimization of laminated composite plates being a combinatorially explosive constrained non-linear optimization problem (CNOP), with many design variables and a vast solution space, warrants the use of non-parametric and heuristic optimization algorithms like PSO. Optimization requires minimizing both the weight and cost of these composite plates, simultaneously, which renders the problem multi-objective. Hence VEPSO, a multi-objective variant of the PSO algorithm, is used. Despite the use of such a heuristic, the application problem, being computationally intensive, suffers from long execution times due to sequential computation. Hence, a parallel version of the PSO algorithm for the problem has been developed to run on several nodes of an IBM P720 cluster. The proposed parallel algorithm, using MPI's collective communication directives, establishes a peer-to-peer relationship between the constituent parallel processes, deviating from the more common master-slave approach, in achieving reduction of computation time by factor of up to 10. Finally we show the effectiveness of the proposed parallel algorithm by comparing it with a serial implementation of VEPSO and a parallel implementation of the vector evaluated genetic algorithm (VEGA) for the same design problem. (c) 2012 Elsevier Ltd. All rights reserved.

Cubicity and Bandwidth

A unit cube in (or a k-cube in short) is defined as the Cartesian product R (1) x R (2) x ... x R (k) where R (i) (for 1 a parts per thousand currency sign i a parts per thousand currency sign k) is a closed interval of the form a (i) , a (i) + 1] on the real line. A k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that two vertices in G are adjacent if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G is the minimum k such that G has a k-cube representation. From a geometric embedding point of view, a k-cube representation of G = (V, E) yields an embedding such that for any two vertices u and v, ||f(u) - f(v)||(a) a parts per thousand currency sign 1 if and only if . We first present a randomized algorithm that constructs the cube representation of any graph on n vertices with maximum degree Delta in O(Delta ln n) dimensions. This algorithm is then derandomized to obtain a polynomial time deterministic algorithm that also produces the cube representation of the input graph in the same number of dimensions. The bandwidth ordering of the graph is studied next and it is shown that our algorithm can be improved to produce a cube representation of the input graph G in O(Delta ln b) dimensions, where b is the bandwidth of G, given a bandwidth ordering of G. Note that b a parts per thousand currency sign n and b is much smaller than n for many well-known graph classes. Another upper bound of b + 1 on the cubicity of any graph with bandwidth b is also shown. Together, these results imply that for any graph G with maximum degree Delta and bandwidth b, the cubicity is O(min{b, Delta ln b}). The upper bound of b + 1 is used to derive upper bounds for the cubicity of circular-arc graphs, cocomparability graphs and AT-free graphs in terms of the maximum degree Delta.

Thermodynamics of TmRhO3, Phase Equilibria, and Chemical Potentials in the System Tm-Rh-O

Phase equilibria in the system Tm-Rh-O at 1200 K is established by isothermal equilibration of selected compositions and phase identification after quenching to room temperature. Six intermetallic phases (Tm3Rh, Tm7Rh3, Tm5Rh3, Tm3Rh2, TmRh, TmRh2 +/-delta) and a ternary oxide TmRhO3 are identified. Based on experimentally determined phase relations, a solid-state electrochemical cell is devised to measure the standard free energy of formation of orthorhombic perovskite TmRhO3 from cubic Tm2O3 and beta-Rh2O3 in the temperature range from (900 to 1300) K. The results can be summarized as: Delta G(f,ox)(o) +/- 104/J.mol(-1) = -46474 + 3.925(T/K). Invoking the Neumann-Kopp rule, the standard enthalpy of formation of TmRhO3 from its constituent elements at 298.15 K is estimated as -1193.89 (+/- 2.86) kJ.mol(-1). The standard entropy of TmRhO3 at 298.15 K is evaluated as 103.8 (+/- 1.6) J.mol(-1).K-1. The oxygen potential-composition diagram and three-dimensional chemical potential diagram at 1200 K and temperature-composition diagrams at constant partial pressures of oxygen are computed from thermodynamic data. The compound TmRhO3 decomposes at 1688 (+/- 2) K in pure oxygen and at 1583 (+/- 2) K in air at standard pressure.

Identification of Active Sources in Single-Channel Convolutive Mixtures Using Known Source Models

We address the problem of identifying the constituent sources in a single-sensor mixture signal consisting of contributions from multiple simultaneously active sources. We propose a generic framework for mixture signal analysis based on a latent variable approach. The basic idea of the approach is to detect known sources represented as stochastic models, in a single-channel mixture signal without performing signal separation. A given mixture signal is modeled as a convex combination of known source models and the weights of the models are estimated using the mixture signal. We show experimentally that these weights indicate the presence/absence of the respective sources. The performance of the proposed approach is illustrated through mixture speech data in a reverberant enclosure. For the task of identifying the constituent speakers using data from a single microphone, the proposed approach is able to identify the dominant source with up to 8 simultaneously active background sources in a room with RT60 = 250 ms, using models obtained from clean speech data for a Source to Interference Ratio (SIR) greater than 2 dB.

Fluorescent Tris-Imidazolium Sensors for Picric Acid Explosive

Two new anthracene-functionalized fluorescent tris-imidazolium salts have been synthesized, characterized, and proven to be selective sensors for picric acid, which is a common constituent of many powerful explosives. Theoretical studies revealed an unusual ground-state electron transfer from picrate anion to the sensor molecules.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Minimizing the complexity of fast sphere decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Thermoelectric properties of Bi-added Co4Sb12 skutterudites

Void filling in (I) Bi-x-added Co4Sb12 or (II) Sb/Bi substitution of Co4Sb12-xBix has been investigated for structural and thermoelectric properties evaluation. X-ray powder data Rietveld refinements combined with electron probe microanalyses showed a polycrystalline and practically Bi-free CoSb3 skutterudite phase as the major constituent as well as a secondary Bi phase in the grain boundaries. For series I alloys, the electrical conductivity, Seebeck coefficient and thermal conductivity were measured as a function of temperature in the range from 450 to 750 K. The electrical conductivity of all the samples increased with increasing temperature, showing a semiconducting nature with smaller values of the Seebeck coefficient for higher Bi fractions. Conduction over the entire temperature range was found to arise from a single p-type carrier. Thermal conductivity showed a reduction with Bi added in all the samples, except for Bi0.75Co4Sb12, and the lowest lattice thermal conductivity was found for a Bi-added fraction of 0.5. The maximum zT value of 0.53 at 632 K is higher than that of Co4Sb12.

MAST: multi-script annotation toolkit for scenic text

This paper describes a semi-automatic tool for annotation of multi-script text from natural scene images. To our knowledge, this is the maiden tool that deals with multi-script text or arbitrary orientation. The procedure involves manual seed selection followed by a region growing process to segment each word present in the image. The threshold for region growing can be varied by the user so as to ensure pixel-accurate character segmentation. The text present in the image is tagged word-by-word. A virtual keyboard interface has also been designed for entering the ground truth in ten Indic scripts, besides English. The keyboard interface can easily be generated for any script, thereby expanding the scope of the toolkit. Optionally, each segmented word can further be labeled into its constituent characters/symbols. Polygonal masks are used to split or merge the segmented words into valid characters/symbols. The ground truth is represented by a pixel-level segmented image and a '.txt' file that contains information about the number of words in the image, word bounding boxes, script and ground truth Unicode. The toolkit, developed using MATLAB, can be used to generate ground truth and annotation for any generic document image. Thus, it is useful for researchers in the document image processing community for evaluating the performance of document analysis and recognition techniques. The multi-script annotation toolokit (MAST) is available for free download.