Solubility and activity of oxygen in liquid indium and copper indium alloys

The solubility of oxygen in liquid indium in the temperature range 650–820 °C and in liquid copper-indium alloys at 1100 °C in equilibrium with indium sesquioxide has been measured by a phase equilibration technique. The solubility of oxygen in pure indium is given by the relation log(at.% O) = −4726/T + 3.73 (±0.08) Using the recently measured values for the standard free energy of formation of In2O3 and assuming that oxygen obeys Sievert's law up to saturation, the standard free energy of solution of molecular oxygen in liquid indium is calculated as View the MathML sourceΔG°= −51 440 + 8.07 T (±500) cal where the standard state for dissolved oxygen is an infinitely dilute solution in which activity is equal to atomic per cent. The effect of indium additions on the activity coefficient of oxygen dissolved in liquid copper was measured by a solid oxide galvanic cell. The interaction parameter ϵ0In is given by View the MathML source The experimentally determined variation of the activity coefficient of oxygen in dilute solution in Cu-In alloys is in fair agreement with that predicted by a quasichemical model in which each oxygen atom is assumed to be interstitially coordinated to four metal atoms and the nearest neighbour metal atoms are assumed to lose approximately half their metallic cohesive energies.

Diffusion mechanism in XSi2 and X5Si3 (X= Nb, Mo, V) phases

In view of the importance of the suicides in the high temperature applications, the diffusion behaviour is compared in different systems for two types of silicides, XSi2 and X5Si3 (X=Nb, Mo, V). Atomic mechanism of diffusion and defects present in the structure are discussed. In both the phases, Si has faster diffusion rate than the metal species. This is expected from the nearest neighbour (NN) bonds present in the XSi2 phase but rather unusual in the X5Si3 phase. Relative mobilities of the species calculated indicate the presence of high concentration of Si antisites. Moreover, the concentration of the defects is different in different systems to find different diffusion rates.

k.p based closed form energy band gap and transport electron effective mass model for 100] and 110] relaxed and strained Silicon nanowire

In this paper, we address a physics based closed form model for the energy band gap (E-g) and the transport electron effective mass in relaxed and strained 100] and 110] oriented rectangular Silicon Nanowire (SiNW). Our proposed analytical model along 100] and 110] directions are based on the k.p formalism of the conduction band energy dispersion relation through an appropriate rotation of the Hamiltonian of the electrons in the bulk crystal along 001] direction followed by the inclusion of a 4 x 4 Luttinger Hamiltonian for the description of the valance band structure. Using this, we demonstrate the variation in Eg and the transport electron effective mass as function of the cross-sectional dimensions in a relaxed 100] and 110] oriented SiNW. The behaviour of these two parameters in 100] oriented SiNW has further been studied with the inclusion of a uniaxial strain along the transport direction and a biaxial strain, which is assumed to be decomposed from a hydrostatic deformation along 001] with the former one. In addition, the energy band gap and the effective mass of a strained 110] oriented SiNW has also been formulated. Using this, we compare our analytical model with that of the extracted data using the nearest neighbour empirical tight binding sp(3)d(5)s* method based simulations and has been found to agree well over a wide range of device dimensions and applied strain. (C) 2012 Elsevier Ltd. All rights reserved.

FeatureMatch: A General ANNF Estimation Technique and its Applications

In this paper, we propose FeatureMatch, a generalised approximate nearest-neighbour field (ANNF) computation framework, between a source and target image. The proposed algorithm can estimate ANNF maps between any image pairs, not necessarily related. This generalisation is achieved through appropriate spatial-range transforms. To compute ANNF maps, global colour adaptation is applied as a range transform on the source image. Image patches from the pair of images are approximated using low-dimensional features, which are used along with KD-tree to estimate the ANNF map. This ANNF map is further improved based on image coherency and spatial transforms. The proposed generalisation, enables us to handle a wider range of vision applications, which have not been tackled using the ANNF framework. We illustrate two such applications namely: 1) optic disk detection and 2) super resolution. The first application deals with medical imaging, where we locate optic disks in retinal images using a healthy optic disk image as common target image. The second application deals with super resolution of synthetic images using a common source image as dictionary. We make use of ANNF mappings in both these applications and show experimentally that our proposed approaches are faster and accurate, compared with the state-of-the-art techniques.

Multi-site downscaling of maximum and minimum daily temperature using support vector machine

Climate change impact assessment studies involve downscaling large-scale atmospheric predictor variables (LSAPVs) simulated by general circulation models (GCMs) to site-scale meteorological variables. This article presents a least-square support vector machine (LS-SVM)-based methodology for multi-site downscaling of maximum and minimum daily temperature series. The methodology involves (1) delineation of sites in the study area into clusters based on correlation structure of predictands, (2) downscaling LSAPVs to monthly time series of predictands at a representative site identified in each of the clusters, (3) translation of the downscaled information in each cluster from the representative site to that at other sites using LS-SVM inter-site regression relationships, and (4) disaggregation of the information at each site from monthly to daily time scale using k-nearest neighbour disaggregation methodology. Effectiveness of the methodology is demonstrated by application to data pertaining to four sites in the catchment of Beas river basin, India. Simulations of Canadian coupled global climate model (CGCM3.1/T63) for four IPCC SRES scenarios namely A1B, A2, B1 and COMMIT were downscaled to future projections of the predictands in the study area. Comparison of results with those based on recently proposed multivariate multiple linear regression (MMLR) based downscaling method and multi-site multivariate statistical downscaling (MMSD) method indicate that the proposed method is promising and it can be considered as a feasible choice in statistical downscaling studies. The performance of the method in downscaling daily minimum temperature was found to be better when compared with that in downscaling daily maximum temperature. Results indicate an increase in annual average maximum and minimum temperatures at all the sites for A1B, A2 and B1 scenarios. The projected increment is high for A2 scenario, and it is followed by that for A1B, B1 and COMMIT scenarios. Projections, in general, indicated an increase in mean monthly maximum and minimum temperatures during January to February and October to December.

Super Resolution Using a Single Image Dictionary

To perform super resolution of low resolution images, state-of-the-art methods are based on learning a pair of lowresolution and high-resolution dictionaries from multiple images. These trained dictionaries are used to replace patches in lowresolution image with appropriate matching patches from the high-resolution dictionary. In this paper we propose using a single common image as dictionary, in conjunction with approximate nearest neighbour fields (ANNF) to perform super resolution (SR). By using a common source image, we are able to bypass the learning phase and also able to reduce the dictionary from a collection of hundreds of images to a single image. By adapting recent developments in ANNF computation, to suit super-resolution, we are able to perform much faster and accurate SR than existing techniques. To establish this claim, we compare the proposed algorithm against various state-of-the-art algorithms, and show that we are able to achieve b etter and faster reconstruction without any training.

Modelling ternary effects on antiphase boundary energy of Ni3Al

The shearing of ordered gamma' precipitates by matrix dislocations results in the formation of antiphase boundaries (APB) in Ni-base superalloys. The APB energy is an important source of order-strengthening in disk and blade alloys where Ti and Ta substitute for Al in gamma'. While the importance of APB energy is well-acknowledged, the effect of alloying on APB energy is not fully understood. In the present study, the effect of Ti and Ta additions on the {111} and {010} APB energies was probed via electronic structure calculations. Results suggest that at low levels of Ti/Ta, APB energies on either plane increases with alloying. However, at higher Ti/Ta levels, the APB energies decrease with alloying. These trends understood by accounting for nearest neighbour violations about the APB and additionally, invoking the effect of precipitate composition on the energy penalty of the violations. We propose an Environment Dependent Nearest Neighbour Bond (EDNNB) model that predicts APB energies that are in close agreement to calculated values.

Synthetic image super resolution using FeatureMatch

In this paper, we propose a super resolution (SR) method for synthetic images using FeatureMatch. Existing state-of-the-art super resolution methods are learning based methods, where a pair of low-resolution and high-resolution dictionary pair are trained, and this trained pair is used to replace patches in low-resolution image with appropriate matching patches from the high-resolution dictionary. In this paper, we show that by using Approximate Nearest Neighbour Fields (ANNF), and a common source image, we can by-pass the learning phase, and use a single image for dictionary. Thus, reducing the dictionary from a collection obtained from hundreds of training images, to a single image. We show that by modifying the latest developments in ANNF computation, to suit super resolution, we can perform much faster and more accurate SR than existing techniques. To establish this claim we will compare our algorithm against various state-of-the-art algorithms, and show that we are able to achieve better and faster reconstruction without any training phase.

A finite variant of the Toom Model

We present results for a finite variant of the one-dimensional Toom model with closed boundaries. We show that the steady state distribution is not of product form, but is nonetheless simple. In particular, we give explicit formulas for the densities and some nearest neighbour correlation functions. We also give exact results for eigenvalues and multiplicities of the transition matrix using the theory of R-trivial monoids in joint work with A. Schilling, B. Steinberg and N. M. Thiery.

Joint Bilateral Filtering based Non-local Means Image Denoising

This paper proposes a denoising algorithm which performs non-local means bilateral filtering. As existing literature suggests, non-local means (NLM) is one of the widely used denoising techniques, but has a critical drawback of smoothing of edges. In order to improve this, we perform fast and efficient NLM using Approximate Nearest Neighbour Fields and improve the edge content in denoising by formulating a joint-bilateral filter. Using the proposed joint bilateral, we are able to denoise smooth regions using the NLM approach and efficient edge reconstruction is obtained from the bilateral filter. Furthermore, to avoid tedious parameter selection, we carry out a noise estimation before performing joint bilateral filtering. The proposed approach is observed to perform well on high noise images.

Scouts, Promoters, and Connectors: The Roles of Ratings in Nearest-Neighbor Collaborative Filtering

Recommender systems aggregate individual user ratings into predictions of products or services that might interest visitors. The quality of this aggregation process crucially affects the user experience and hence the effectiveness of recommenders in e-commerce. We present a characterization of nearest-neighbor collaborative filtering that allows us to disaggregate global recommender performance measures into contributions made by each individual rating. In particular, we formulate three roles-scouts, promoters, and connectors-that capture how users receive recommendations, how items get recommended, and how ratings of these two types are themselves connected, respectively. These roles find direct uses in improving recommendations for users, in better targeting of items and, most importantly, in helping monitor the health of the system as a whole. For instance, they can be used to track the evolution of neighborhoods, to identify rating subspaces that do not contribute ( or contribute negatively) to system performance, to enumerate users who are in danger of leaving, and to assess the susceptibility of the system to attacks such as shilling. We argue that the three rating roles presented here provide broad primitives to manage a recommender system and its community.

The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.)

A two-stage iterative algorithm for selecting a subset of a training set of samples for use in a condensed nearest neighbor (CNN) decision rule is introduced. The proposed method uses the concept of mutual nearest neighborhood for selecting samples close to the decision line. The efficacy of the algorithm is brought out by means of an example.

Agglomerative clustering using the concept of mutual nearest neighbourhood

A method for determining the mutual nearest neighbours (MNN) and mutual neighbourhood value (mnv) of a sample point, using the conventional nearest neighbours, is suggested. A nonparametric, hierarchical, agglomerative clustering algorithm is developed using the above concepts. The algorithm is simple, deterministic, noniterative, requires low storage and is able to discern spherical and nonspherical clusters. The method is applicable to a wide class of data of arbitrary shape, large size and high dimensionality. The algorithm can discern mutually homogenous clusters. Strong or weak patterns can be discerned by properly choosing the neighbourhood width.

Disaggregative Clustering Using the Concept of Mutual Nearest Neighborhood

A nonparametric, hierarchical, disaggregative clustering algorithm is developed using a novel similarity measure, called the mutual neighborhood value (MNV), which takes into account the conventional nearest neighbor ranks of two samples with respect to each other. The algorithm is simple, noniterative, requires low storage, and needs no specification of the expected number of clusters. The algorithm appears very versatile as it is capable of discerning spherical and nonspherical clusters, linearly nonseparable clusters, clusters with unequal populations, and clusters with lowdensity bridges. Changing of the neighborhood size enables discernment of strong or weak patterns.

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.