Influence of annealing on structural, morphological, compositional and surface properties of magnetron sputtered nickel-titanium thin films

Thin films of NiTi were deposited by DC magnetron sputtering from an equiatomic alloy target (Ni/Ti: 50/50 at.%). The films were deposited without intentional heating of the substrates. The thickness of the deposited films was approximately 2 mu m. The structure and morphology of NiTi films annealed at different temperatures were analyzed in order to understand the effect of annealing on physical properties of the films. The compositional investigations of fresh and annealed films were also evaluated by energy dispersive X-ray spectroscopy (EDS) and X-ray photo-electron spectroscopy (XPS) techniques. X-ray diffraction (XRD) studies showed that as-deposited films were amorphous in nature whereas annealed films were found to poly-crystalline with the presence of Austenite phase as the dominant phase. AFM investigations showed higher grain size and surface roughness values in the annealed films. In annealed films, the grain size and film roughness values were increased from 10 to 85 nm and 2-18 nm. Film composition measured by EDS were found to 52.5 atomic percent of Ni and 47.5 atomic percent of Ti. XPS investigations, demonstrated the presence of Ni content on the surface of the films, in fresh films, whereas annealed films did not show any nickel. From HR-XPS investigations, it can be concluded that annealed NiTi films have higher tendency to form metal oxide (titanium dioxide) layer on the surface of the films than fresh NiTi films. (C) 2013 Elsevier B. V. All rights reserved.

A Hybrid Parallel Algorithm for Computing and Tracking Level Set Topology

The contour tree is a topological abstraction of a scalar field that captures evolution in level set connectivity. It is an effective representation for visual exploration and analysis of scientific data. We describe a work-efficient, output sensitive, and scalable parallel algorithm for computing the contour tree of a scalar field defined on a domain that is represented using either an unstructured mesh or a structured grid. A hybrid implementation of the algorithm using the GPU and multi-core CPU can compute the contour tree of an input containing 16 million vertices in less than ten seconds with a speedup factor of upto 13. Experiments based on an implementation in a multi-core CPU environment show near-linear speedup for large data sets.

Fast and accurate quantification using Genetic Algorithm optimized H-1-C-13 refocused constant-time INEPT

Using Genetic Algorithm, a global optimization method inspired by nature's evolutionary process, we have improved the quantitative refocused constant-time INEPT experiment (Q-INEPT-CT) of Makela et al. (JMR 204 (2010) 124-130) with various optimization constraints. The improved `average polarization transfer' and `min-max difference' of new delay sets effectively reduces the experimental time by a factor of two (compared with Q-INEPT-CT, Makela et al.) without compromising on accuracy. We also discuss a quantitative spectral editing technique based on average polarization transfer. (C) 2013 Elsevier Inc. All rights reserved.

Hybrid aggregated-vector algorithm for efficient parallelization of fast multipole method

An efficient parallelization algorithm for the Fast Multipole Method which aims to alleviate the parallelization bottleneck arising from lower job-count closer to root levels is presented. An electrostatic problem of 12 million non-uniformly distributed mesh elements is solved with 80-85% parallel efficiency in matrix setup and matrix-vector product using 60GB and 16 threads on shared memory architecture.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

Post-deposition annealing influenced structural and electrical properties of Al/TiO2/Si gate capacitors

Titanium dioxide (TiO2) thin films are deposited on unheated p-Si (100) and quartz substrates by employing DC reactive magnetron sputtering technique. The effect of post-deposition annealing in air at temperatures in the range 673-973 K on the structural, electrical, and dielectric properties of the films was investigated. The chemical composition of the TiO2 films was analyzed with X-ray photoelectron spectroscopy. The surface morphology of the films was studied by atomic force microscope. The optical band gap of the as-deposited film was 3.50 eV, and it increased to 3.55 eV with the increase in annealing temperature to 773 K. The films annealed at higher temperature of 973 K showed the optical band gap of 3.43 eV. Thin film capacitors were fabricated with the MOS configuration of Al/TiO2/p-Si. The leakage current density of the as-deposited films was 1.2 x 10(-6) A/cm(2), and it decreased to 5.9 x 10(-9) A/cm(2) with the increase in annealing temperature to 973 K. These films showed high dielectric constant value of 36. (C) 2013 Elsevier Ltd. All rights reserved.

Differentially private stochastic gradient descent algorithm for multiparty classification

We consider the problem of developing privacy-preserving machine learning algorithms in a dis-tributed multiparty setting. Here different parties own different parts of a data set, and the goal is to learn a classifier from the entire data set with-out any party revealing any information about the individual data points it owns. Pathak et al [7]recently proposed a solution to this problem in which each party learns a local classifier from its own data, and a third party then aggregates these classifiers in a privacy-preserving manner using a cryptographic scheme. The generaliza-tion performance of their algorithm is sensitive to the number of parties and the relative frac-tions of data owned by the different parties. In this paper, we describe a new differentially pri-vate algorithm for the multiparty setting that uses a stochastic gradient descent based procedure to directly optimize the overall multiparty ob-jective rather than combining classifiers learned from optimizing local objectives. The algorithm achieves a slightly weaker form of differential privacy than that of [7], but provides improved generalization guarantees that do not depend on the number of parties or the relative sizes of the individual data sets. Experimental results corrob-orate our theoretical findings.

Delay optimized zero-forcing channel shortening algorithm for wireless communication

In Orthogonal Frequency Division Multiplexing and Discrete Multitone transceivers, a guard interval called Cyclic Prefix (CP) is inserted to avoid inter-symbol interference. The length of the CP is usually greater than the impulse response of the channel resulting in a loss of useful data carriers. In order to avoid long CP, a time domain equalizer is used to shorten the channel. In this paper, we propose a method to include a delay in the zero-forcing equalizer and obtain an optimal value of the delay, based on the location of zeros of the channel. The performance of the algorithms is studied using numerical simulations.

A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs

In wireless sensor networks (WSNs) the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting at the same time. Such a situation is known as spatially correlated contention. The random access methods to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration and therefore generating an optimal or sub-optimal schedule is not very useful. On the other hand, if the algorithm takes very large time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. To efficiently handle the spatially correlated contention in WSNs, we present a distributed TDMA slot scheduling algorithm, called DTSS algorithm. The DTSS algorithm is designed with the primary objective of reducing the time required to perform scheduling, while restricting the schedule length to maximum degree of interference graph. The algorithm uses randomized TDMA channel access as the mechanism to transmit protocol messages, which bounds the message delay and therefore reduces the time required to get a feasible schedule. The DTSS algorithm supports unicast, multicast and broadcast scheduling, simultaneously without any modification in the protocol. The protocol has been simulated using Castalia simulator to evaluate the run time performance. Simulation results show that our protocol is able to considerably reduce the time required to schedule.

A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems

In this paper, we propose a low-complexity algorithm based on Markov chain Monte Carlo (MCMC) technique for signal detection on the uplink in large scale multiuser multiple input multiple output (MIMO) systems with tens to hundreds of antennas at the base station (BS) and similar number of uplink users. The algorithm employs a randomized sampling method (which makes a probabilistic choice between Gibbs sampling and random sampling in each iteration) for detection. The proposed algorithm alleviates the stalling problem encountered at high SNRs in conventional MCMC algorithm and achieves near-optimal performance in large systems with M-QAM. A novel ingredient in the algorithm that is responsible for achieving near-optimal performance at low complexities is the joint use of a randomized MCMC (R-MCMC) strategy coupled with a multiple restart strategy with an efficient restart criterion. Near-optimal detection performance is demonstrated for large number of BS antennas and users (e.g., 64, 128, 256 BS antennas/users).

Active yaw control of a vehicle using a Fuzzy logic algorithm

Yaw rate of a vehicle is highly influenced by the lateral forces generated at the tire contact patch to attain the desired lateral acceleration, and/or by external disturbances resulting from factors such as crosswinds, flat tire or, split-μ braking. The presence of the latter and the insufficiency of the former may lead to undesired yaw motion of a vehicle. This paper proposes a steer-by-wire system based on fuzzy logic as yaw-stability controller for a four-wheeled road vehicle with active front steering. The dynamics governing the yaw behavior of the vehicle has been modeled in MATLAB/Simulink. The fuzzy controller receives the yaw rate error of the vehicle and the steering signal given by the driver as inputs and generates an additional steering angle as output which provides the corrective yaw moment. The results of simulations with various drive input signals show that the yaw stability controller using fuzzy logic proposed in the current study has a good performance in situations involving unexpected yaw motion. The yaw rate errors of a vehicle having the proposed controller are notably smaller than an uncontrolled vehicle's, and the vehicle having the yaw stability controller recovers lateral distance and desired yaw rate more quickly than the uncontrolled vehicle.

Effect of post-deposition annealing on transverse piezoelectric coefficient and vibration sensing performance of ZnO thin films

The present experimental study investigates the influence of post-deposition annealing on the transverse piezoelectric coefficient (d(31)) value of ZnO thin films deposited on a flexible metal alloy substrate, and its relationship with the vibration sensing performance. Highly c-axis oriented and crystalline ZnO thin films were deposited on flexible Phynox alloy substrate via radio frequency (RF) reactive magnetron sputtering. ZnO thin film samples were annealed at different temperatures ranging from 100 degrees C to 500 degrees C, resulting in the temperature of 300 degrees C determined as the optimum annealing temperature. The crystallinity, morphology, microstructure, and rms surface roughness of annealed ZnO thin films were systematically investigated by X-ray Diffraction (XRD), Scanning Electron Microscopy (SEM), and Atomic Force Microscopy (AFM), respectively. The piezoelectric d(31) coefficient value was measured by 4-point bending method. ZnO thin film annealed at 300 degrees C was highly c-axis oriented, crystalline, possesses fine surface morphology with uniformity in the grain size. This film showed higher d(31) coefficient value of 7.2 pm V-1. A suitable in-house designed and developed experimental set-up, for evaluating the vibration sensing performance of annealed ZnO thin films is discussed. As expected the ZnO thin film annealed at 300 degrees C showed relatively better result for vibration sensing studies. It generates comparatively higher peak output voltage of 147 mV, due to improved structural and morphological properties, and higher piezoelectric d(31) coefficient value. (C) 2014 Elsevier B. V. All rights reserved.

Improving tangential resolution with a modified delay-and-sum reconstruction algorithm in photoacoustic and thermoacoustic tomography

Spatial resolution in photoacoustic and thermoacoustic tomography is ultrasound transducer (detector) bandwidth limited. For a circular scanning geometry the axial (radial) resolution is not affected by the detector aperture, but the tangential (lateral) resolution is highly dependent on the aperture size, and it is also spatially varying (depending on the location relative to the scanning center). Several approaches have been reported to counter this problem by physically attaching a negative acoustic lens in front of the nonfocused transducer or by using virtual point detectors. Here, we have implemented a modified delay-and-sum reconstruction method, which takes into account the large aperture of the detector, leading to more than fivefold improvement in the tangential resolution in photoacoustic (and thermoacoustic) tomography. Three different types of numerical phantoms were used to validate our reconstruction method. It is also shown that we were able to preserve the shape of the reconstructed objects with the modified algorithm. (C) 2014 Optical Society of America

Texture evolution during annealing of large-strain deformed nanocrystalline nickel

The recrystallization behaviour of cold-rolled nanocrystalline (nc) nickel has been studied at temperatures between 573 and 1273 K using bulk texture measurements and electron back-scattered diffraction. The texture in nc nickel is different from that of its microcrystalline counterpart, consisting of a strong Goss (G) and rotated Goss (RG) components at 773 K instead of the typical cube component. The texture evolution in nc Ni has been attributed to the prior deformation textures and nucleation advantage of G and RG grains.

PocketMatch (version 2.0): A parallel algorithm for the detection of structural similarities between protein ligand binding-sites

Knowledge of protein-ligand interactions is essential to understand several biological processes and important for applications ranging from understanding protein function to drug discovery and protein engineering. Here, we describe an algorithm for the comparison of three-dimensional ligand-binding sites in protein structures. A previously described algorithm, PocketMatch (version 1.0) is optimised, expanded, and MPI-enabled for parallel execution. PocketMatch (version 2.0) rapidly quantifies binding-site similarity based on structural descriptors such as residue nature and interatomic distances. Atomic-scale alignments may also be obtained from amino acid residue pairings generated. It allows an end-user to compute database-wide, all-to-all comparisons in a matter of hours. The use of our algorithm on a sample dataset, performance-analysis, and annotated source code is also included.