Perpendicular exchange bias in IrMn/Pt/[Co/Pt](3) multilayers with cone magnetization

The perpendicular exchange bias and magnetic anisotropy were investigated in IrMn/Pt/[Co/Pt](3) multilayers through the analysis of in-plane and out-of-plane magnetization hysteresis loops. A phenomenological model was used to simulate the in-plane curves and the effective perpendicular anisotropies were obtained employing the area method. The canted state anisotropy was introduced by taking into account the first and second uniaxial anisotropy terms of the ferromagnet with the corresponding uniaxial anisotropy direction allowed to make a nonzero angle with the film`s normal. This angle, obtained from the fittings, was of approximately 15 degrees for IrMn/[Co/Pt](3) film and decreases with the introduction of Pt in the IrMn/Pt/[Co/Pt](3) system, indicating that the Pt interlayer leads to a predominant perpendicular anisotropy. A maximum of the out-of-plane anisotropy was found between 0.5 and 0.6 nm of Pt, whereas a maximum of the perpendicular exchange bias was found at 0.3 nm. These results are very similar to those obtained for IrMn/Cu/[Co/Pt](3) system; however, the decrease of the exchange bias with the spacer thickness is more abrupt and the enhacement of the perpendicular anisotropy is higher for the case of Cu spacer as compared with that of Pt spacer. The existence of a maximum in the perpendicular exchange bias as a function of the Pt layer thickness was attributed to the predominance of the enhancement of exchange bias due to more perpendicular Co moment orientation over the exponential decrease of the ferromagnetic/antiferromagnetic exchange coupling and, consequently, of the exchange-bias field. (C) 2011 Elsevier B.V. All rights reserved.

Magnetic interaction in exchange-biased bilayers: a first-order reversal curve analysis

The distributions of coercivities and magnetic interactions in a set of polycrystalline Ni(0.8)Fe(0.2)/FeMn bilayers have been determined using the first-order reversal curve (FORC) formalism. The thickness of the permalloy (Py) film was fixed at 10 nm (nominal), while that of the FeMn film varied within the range 0-20 nm. The FORC diagrams of each bilayer displayed two clearly distinguishable regions. The main region was generated by Py particles whose coercivities were enhanced in comparison with those in which the FeMn film was absent (sample O). The minor region was produced by Py particles with coercivities similar to or slightly higher than those of particles in the Py film of sample O. Each sample presented two distributions of interaction fields, one for each region, and both were centred slightly below the exchange-bias field, thus indicating a prevalence of magnetizing interactions. These results are consistent with a grain size distribution in the Py layer and the presence of uncompensated antiferromagnetic moments.

First-order-reversal-curve analysis of Pr-Fe-B-based exchange spring magnets

Ribbons of nominal composition (Pr(9.5)Fe(84.5)B(6))(0.96)Cr(0.01)(TiC)(0.03) were produced by arc-melting and melt-spinning the alloys on a Cu wheel. X-ray diffraction (XRD) reveals two main phases, one based upon alpha-Fe and the other upon Pr(2)Fe(14)B. The ribbons show exchange spring behavior with H (c) = 12.5 kOe and (BH)(max) = 13.6 MGOe when these two phases are well coupled. Transmission electron microscopy revealed the coupled behavior is observed when the microstructure consists predominantly of alpha-Fe grains (diameter similar to 100 nm.) surrounded by hard material containing Pr(2)Fe(14)B. The microstructure is discussed in terms of a calculation by Skomski and Coey. A first-order-reversal-curve (FORC) analysis was performed for both a well-coupled sample and a poorly coupled sample. The FORC diagrams show two strong peaks for both the poorly coupled sample and for the well-coupled material. In both cases, the localization of the FORC probability suggests magnetizing interactions between particles. Switching field distributions were calculated and are consistent with the sample microstructure.

Effects of Side-Chain and Electron Exchange Correlation on the Band Structure of Perylene Diimide Liquid Crystals: A Density Functional Study

The structural and electronic properties of perylene diimide liquid crystal PPEEB are studied using ab initio methods based on the density functional theory (I)FT). Using available experimental crystallographic data as a guide, we propose a detailed structural model for the packing of solid PPEEB. We find that due to the localized nature of the band edge wave function, theoretical approaches beyond the standard method, such as hybrid functional (PBE0), are required to correctly characterize the band structure of this material. Moreover, unlike previous assumptions, we observe the formation of hydrogen bonds between the side chains of different molecules, which leads to a dispersion of the energy levels. This result indicates that the side chains of the molecular crystal not only are responsible for its structural conformation but also can be used for tuning the electronic and optical properties of these materials.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

On the lower bound on the exchange-correlation energy in two dimensions

We study the properties of the lower bound on the exchange-correlation energy in two dimensions. First we review the derivation of the bound and show how it can be written in a simple density-functional form. This form allows an explicit determination of the prefactor of the bound and testing its tightness. Next we focus on finite two-dimensional systems and examine how their distance from the bound depends on the system geometry. The results for the high-density limit suggest that a finite system that comes as close as possible to the ultimate bound on the exchange-correlation energy has circular geometry and a weak confining potential with a negative curvature. (c) 2009 Elsevier B.V. All rights reserved.

Spin-density functional for exchange anisotropic Heisenberg model

Ground-state energies for anti ferromagnetic Heisenberg models with exchange anisotropy are estimated by means of a local-spin approximation made in the context of the density functional theory. Correlation energy is obtained using the non-linear spin-wave theory for homogeneous systems from which the spin functional is built. Although applicable to chains of any size, the results are shown for small number of sites, to exhibit finite-size effects and allow comparison with exact-numerical data from direct diagonalization of small chains. (C) 2009 Elsevier B.V. All rights reserved.

EXACT AND APPROXIMATE RELATIONS FOR THE SPIN-DEPENDENCE OF THE EXCHANGE ENERGY IN HIGH MAGNETIC FIELDS

The exchange energy of an arbitrary collinear-spin many-body system in an external magnetic field is a functional of the spin-resolved charge and current densities, E(x)[n(up arrow), n(down arrow), j(up arrow), j(down arrow)]. Within the framework of density-functional theory (DFT), we show that the dependence of this functional on the four densities can be fully reconstructed from either of two extreme limits: a fully polarized system or a completely unpolarized system. Reconstruction from the limit of an unpolarized system yields a generalization of the Oliver-Perdew spin scaling relations from spin-DFT to current-DFT. Reconstruction from the limit of a fully polarized system is used to derive the high-field form of the local-spin-density approximation to current-DFT and to magnetic-field DFT.

Analysis of Agonist and Antagonist Effects on Thyroid Hormone Receptor Conformation by Hydrogen/Deuterium Exchange

Thyroid hormone receptors (TRs) are ligand-gated transcription factors with critical roles in development and metabolism. Although x-ray structures of TR ligand-binding domains (LBDs) with agonists are available, comparable structures without ligand (apo-TR) or with antagonists are not. It remains important to understand apo-LBD conformation and the way that it rearranges with ligands to develop better TR pharmaceuticals. In this study, we conducted hydrogen/deuterium exchange on TR LBDs with or without agonist (T(3)) or antagonist (NH(3)). Both ligands reduce deuterium incorporation into LBD amide hydrogens, implying tighter overall folding of the domain. As predicted, mass spectroscopic analysis of individual proteolytic peptides after hydrogen/deuterium exchange reveals that ligand increases the degree of solvent protection of regions close to the buried ligand-binding pocket. However, there is also extensive ligand protection of other regions, including the dimer surface at H10-H11, providing evidence for allosteric communication between the ligand-binding pocket and distant interaction surfaces. Surprisingly, C-terminal activation helix H12, which is known to alter position with ligand, remains relatively protected from solvent in all conditions suggesting that it is packed against the LBD irrespective of the presence or type of ligand. T(3), but not NH(3), increases accessibility of the upper part of H3-H5 to solvent, and we propose that TR H12 interacts with this region in apo-TR and that this interaction is blocked by T(3) but not NH(3.) We present data from site-directed mutagenesis experiments and molecular dynamics simulations that lend support to this structural model of apo-TR and its ligand-dependent conformational changes. (Molecular Endocrinology 25: 15-31, 2011)

Erbium and Ytterbium Codoped Titanoniobophosphate Glasses for Ion-Exchange-Based Planar Waveguides

This work presents the optical properties of erbium-doped and erbium/ytterbium codoped Na(2)O-Al(2)O(3)-TiO(2)-Nb(2)O(5)-P(2)O(5) glass systems and also the characterization of planar waveguides obtained by typical thermally assisted Ag+<-> Na+ ion-exchange process. The glass systems allow the preparation of single mode and multimode planar waveguides presenting a strong and relatively broad emission at 1536 nm. The emission signal in the infrared region is intensified for silver-containing samples when compared with free-silver samples. The emission signal intensification may be attributed to a nonplasmonic energy transfer from silver species to Er3+ ions as no bands related to surface plasmon resonance (SPR) of silver nanoparticles were observed.

A WAVELET-BASED SPEAKER VERIFICATION ALGORITHM

This paper presents a study on wavelets and their characteristics for the specific purpose of serving as a feature extraction tool for speaker verification (SV), considering a Radial Basis Function (RBF) classifier, which is a particular type of Artificial Neural Network (ANN). Examining characteristics such as support-size, frequency and phase responses, amongst others, we show how Discrete Wavelet Transforms (DWTs), particularly the ones which derive from Finite Impulse Response (FIR) filters, can be used to extract important features from a speech signal which are useful for SV. Lastly, an SV algorithm based on the concepts presented is described.

Improved voice activity detection algorithm using wavelet and support vector machine

This paper proposes an improved voice activity detection (VAD) algorithm using wavelet and support vector machine (SVM) for European Telecommunication Standards Institution (ETS1) adaptive multi-rate (AMR) narrow-band (NB) and wide-band (WB) speech codecs. First, based on the wavelet transform, the original IIR filter bank and pitch/tone detector are implemented, respectively, via the wavelet filter bank and the wavelet-based pitch/tone detection algorithm. The wavelet filter bank can divide input speech signal into several frequency bands so that the signal power level at each sub-band can be calculated. In addition, the background noise level can be estimated in each sub-band by using the wavelet de-noising method. The wavelet filter bank is also derived to detect correlated complex signals like music. Then the proposed algorithm can apply SVM to train an optimized non-linear VAD decision rule involving the sub-band power, noise level, pitch period, tone flag, and complex signals warning flag of input speech signals. By the use of the trained SVM, the proposed VAD algorithm can produce more accurate detection results. Various experimental results carried out from the Aurora speech database with different noise conditions show that the proposed algorithm gives considerable VAD performances superior to the AMR-NB VAD Options 1 and 2, and AMR-WB VAD. (C) 2009 Elsevier Ltd. All rights reserved.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

A multi-GPU algorithm for large-scale neuronal networks

Large-scale simulations of parts of the brain using detailed neuronal models to improve our understanding of brain functions are becoming a reality with the usage of supercomputers and large clusters. However, the high acquisition and maintenance cost of these computers, including the physical space, air conditioning, and electrical power, limits the number of simulations of this kind that scientists can perform. Modern commodity graphical cards, based on the CUDA platform, contain graphical processing units (GPUs) composed of hundreds of processors that can simultaneously execute thousands of threads and thus constitute a low-cost solution for many high-performance computing applications. In this work, we present a CUDA algorithm that enables the execution, on multiple GPUs, of simulations of large-scale networks composed of biologically realistic Hodgkin-Huxley neurons. The algorithm represents each neuron as a CUDA thread, which solves the set of coupled differential equations that model each neuron. Communication among neurons located in different GPUs is coordinated by the CPU. We obtained speedups of 40 for the simulation of 200k neurons that received random external input and speedups of 9 for a network with 200k neurons and 20M neuronal connections, in a single computer with two graphic boards with two GPUs each, when compared with a modern quad-core CPU. Copyright (C) 2010 John Wiley & Sons, Ltd.

An algorithm for automatic checking of exercises in a dynamic geometry system: iGeom

One of the key issues in e-learning environments is the possibility of creating and evaluating exercises. However, the lack of tools supporting the authoring and automatic checking of exercises for specifics topics (e.g., geometry) drastically reduces advantages in the use of e-learning environments on a larger scale, as usually happens in Brazil. This paper describes an algorithm, and a tool based on it, designed for the authoring and automatic checking of geometry exercises. The algorithm dynamically compares the distances between the geometric objects of the student`s solution and the template`s solution, provided by the author of the exercise. Each solution is a geometric construction which is considered a function receiving geometric objects (input) and returning other geometric objects (output). Thus, for a given problem, if we know one function (construction) that solves the problem, we can compare it to any other function to check whether they are equivalent or not. Two functions are equivalent if, and only if, they have the same output when the same input is applied. If the student`s solution is equivalent to the template`s solution, then we consider the student`s solution as a correct solution. Our software utility provides both authoring and checking tools to work directly on the Internet, together with learning management systems. These tools are implemented using the dynamic geometry software, iGeom, which has been used in a geometry course since 2004 and has a successful track record in the classroom. Empowered with these new features, iGeom simplifies teachers` tasks, solves non-trivial problems in student solutions and helps to increase student motivation by providing feedback in real time. (c) 2008 Elsevier Ltd. All rights reserved.