A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

The K-means algorithm for clustering is very much dependent on the initial seed values. We use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting proper initial seed values in the K-means algorithm. Results obtained are very encouraging and in most of the cases, on data sets having well separated clusters, the proposed scheme reached a global minimum.

Effect of Substrate and Annealing Temperatures on Mechanical Properties of Ti-rich NiTi Films

The effect of substrate and annealing temperatures on mechanical properties of Ti-rich NiTi films deposited on Si (100) substrates by DC magnetron sputtering was studied by nanoindentation. NiTi films were deposited at two substrate temperatures viz. 300 and 400 degrees C. NiTi films deposited at 300 degrees C were annealed for 4 h at four different temperatures, i.e. 300, 400, 500 and 600 degrees C whereas films deposited at 400 degrees C were annealed for 4 h at three different temperatures, i.e. 400, 500 and 600 degrees C. The elastic modulus and hardness of the films were found to be the same in the as-deposited as well as annealed conditions for both substrate temperatures. For a given substrate temperature, the hardness and elastic modulus were found to remain unchanged as long as the films were amorphous. However, both elastic modulus and hardness showed an increase with increasing annealing temperature as the films become crystalline. The results were explained on the basis of the change in microstructure of the film with change in annealing temperature.

A Parallel Progressive Refinement Image Rendering Algorithm on a Scalable Multithreaded VLSI Processor Array

In this paper we develop a multithreaded VLSI processor linear array architecture to render complex environments based on the radiosity approach. The processing elements are identical and multithreaded. They work in Single Program Multiple Data (SPMD) mode. A new algorithm to do the radiosity computations based on the progressive refinement approach[2] is proposed. Simulation results indicate that the architecture is latency tolerant and scalable. It is shown that a linear array of 128 uni-threaded processing elements sustains a throughput close to 0.4 million patches/sec.

Effects of thermal annealing on the properties of zirconia films prepared by ion-assisted deposition

The effect of thermal annealing in the range 300–800 °C on the properties of zirconia films prepared by ion assisted deposition was studied. It was found that at low temperature the cubic phase is formed. This phase is stable up to 700 °C. All the films exhibit a monophasic monoclinic structure at 800 °C. The stress, estimated from X-ray patterns, shows a transition from tensile to compressive with increasing ion fluence. The refractive index and extinction coefficient do not seem to change appreciably up to 700 °C, showing a marked degradation thereafter. Single step annealing to the highest temperature was found to result in better stability than multistep annealing.

On the exothermic peak during annealing of electrodeposited nanocrystalline nickel

Nanocrystalline metals frequently exhibit poor thermal stability, and the exothermic peak in differential scanning calorimetry is usually attributed to grain growth. We show from experiments on electrodeposited nano-Ni with varying levels of S, and tests with microcrystalline Ni and S powders, that the exothermic peak is associated with the formation of a nickel sulfide phase and concurrent grain growth. Analysis suggests that segregation plays a more important role in limiting grain growth than second-phase particles in nano-Ni. (C) 2010 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Microstructure evolution and hardness variation during annealing of equal channel angular pressed ultra-fine grained nickel subjected to 12 passes

The microstructure, thermal stability and hardness of ultra-fine grained (UFG) Ni produced by 12 passes of equal channel angular pressing (ECAP) through the route Bc were studied. Comparing the microstructure and hardness of the as-ECAPed samples with the published data on UFG Ni obtained after 8 passes of ECAP through the route Bc reveals a smaller average grain size (230 nm in the present case compared with 270 nm in 8-pass Ni), significantly lower dislocation density (1.08 x 10(14) m(-2) compared with 9 x 10(14) m(-2) in 8-pass Ni) and lower hardness (2 GPa compared with 2.45 GPa for 8-pass Ni). Study of the thermal stability of the 12-pass UFG Ni revealed that recovery is dominant in the temperature range 150-250A degrees C and recrystallisation occurred at temperatures > 250 A degrees C. The UFG microstructure is relatively stable up to about 400 A degrees C. Due to the lower dislocation density and consequently a lower stored energy, the recrystallisation of 12-pass ECAP Ni occurred at a higher temperature (similar to 250 A degrees C) compared with the 8-pass Ni (similar to 200 A degrees C). In the 12-pass Nickel, hardness variation shows that its dependence on grain size is inversely linear rather than the common grain size(-0.5) dependence.

Concise row-pruning algorithm to invert a matrix

Presented here, in a vector formulation, is an O(mn2) direct concise algorithm that prunes/identifies the linearly dependent (ld) rows of an arbitrary m X n matrix A and computes its reflexive type minimum norm inverse A(mr)-, which will be the true inverse A-1 if A is nonsingular and the Moore-Penrose inverse A+ if A is full row-rank. The algorithm, without any additional computation, produces the projection operator P = (I - A(mr)- A) that provides a means to compute any of the solutions of the consistent linear equation Ax = b since the general solution may be expressed as x = A(mr)+b + Pz, where z is an arbitrary vector. The rank r of A will also be produced in the process. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for consistent/inconsistent equations is readily computable when A is full row-rank (else, a minimum norm solution for consistent equations is obtainable), (iii) the algorithm identifies ld rows, if any, and reduces concerned computation and improves accuracy of the result, (iv) error-bounds for the inverse as well as the solution x for Ax = b are readily computable, (v) error-free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward, (vi) it is suitable for vector (pipeline) machines, and (vii) the inverse produced by the algorithm can be used to solve under-/overdetermined linear systems.

An actor-critic algorithm with function approximation for discounted cost constrained Markov decision processes

We develop in this article the first actor-critic reinforcement learning algorithm with function approximation for a problem of control under multiple inequality constraints. We consider the infinite horizon discounted cost framework in which both the objective and the constraint functions are suitable expected policy-dependent discounted sums of certain sample path functions. We apply the Lagrange multiplier method to handle the inequality constraints. Our algorithm makes use of multi-timescale stochastic approximation and incorporates a temporal difference (TD) critic and an actor that makes a gradient search in the space of policy parameters using efficient simultaneous perturbation stochastic approximation (SPSA) gradient estimates. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal policy. (C) 2010 Elsevier B.V. All rights reserved.

Study Of Acoustic Source Localization Algorithm For Planar Arrays

The source localization algorithms in the earlier works, mostly used non-planar arrays. If we consider scenarios like human-computer communication, or human-television communication where the microphones need to be placed on the computer monitor or television front panel, i.e we need to use the planar arrays. The algorithm proposed in 1], is a Linear Closed Form source localization algorithm (LCF algorithm) which is based on Time Difference of Arrivals (TDOAs) that are obtained from the data collected using the microphones. It assumes non-planar arrays. The LCF algorithm is applied to planar arrays in the current work. The relationship between the error in the source location estimate and the perturbation in the TDOAs is derived using first order perturbation analysis and validated using simulations. If the TDOAs are erroneous, both the coefficient matrix and the data matrix used for obtaining source location will be perturbed. So, the Total least squares solution for source localization is proposed in the current work. The sensitivity analysis of the source localization algorithm for planar arrays and non-planar arrays is done by introducing perturbation in the TDOAs and the microphone locations. It is shown that the error in the source location estimate is less when we use planar array instead of the particular non-planar array considered for same perturbation in the TDOAs or microphone location. The location of the reference microphone is proved to be important for getting an accurate source location estimate if we are using the LCF algorithm.

Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain

The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando's algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.

Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance

In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions in this paper are two-fold. First, we propose a low-complexity algorithm for large-MIMO detection based on a layered low-complexity local neighborhood search. Second, we obtain a lower bound on the maximum-likelihood (ML) bit error performance using the local neighborhood search. The advantages of the proposed ML lower bound are i) it is easily obtained for MIMO systems with large number of antennas because of the inherent low complexity of the search algorithm, ii) it is tight at moderate-to-high SNRs, and iii) it can be tightened at low SNRs by increasing the number of symbols in the neighborhood definition. Interestingly, the proposed detection algorithm based on the layered local search achieves bit error performances which are quite close to this lower bound for large number of antennas and higher-order QAM. For e. g., in a 32 x 32 V-BLAST MIMO system, the proposed detection algorithm performs close to within 1.7 dB of the proposed ML lower bound at 10(-3) BER for 16-QAM (128 bps/Hz), and close to within 4.5 dB of the bound for 64-QAM (192 bps/Hz).

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.

Stabilizing trench's algorithm to invert symmetric toeplitz matrices

Presented here is a stable algorithm that uses Zohar's formulation of Trench's algorithm and computes the inverse of a symmetric Toeplitz matrix including those with vanishing or nearvanishing leading minors. The algorithm is based on a diagonal modification of the matrix, and exploits symmetry and persymmetry properties of the inverse matrix.

Structural and electrical properties of radio frequency magnetron sputtered tantalum oxide films: Influence of post-deposition annealing

The as-deposited and annealed radio frequency reactive magnetron sputtered tantalum oxide (Ta2O5) films were characterized by studying the chemical binding configuration, structural and electrical properties. X-ray photoelectron spectroscopy and X-ray diffraction analysis of the films elucidate that the film annealed at 673 K was stoichiometric with orthorhombic beta-phase Ta2O5. The dielectric constant values of the tantalum oxide capacitors with the sandwich structure of Al/Ta2O5/Si were in the range from 14 to 26 depending on the post-deposition annealing temperature. The leakage current density was < 20 nA cm(-2) at the gate bias voltage of 0.04 MV/cm for the annealed films. The electrical conduction mechanism observed in the films was Poole-Frenkel. (C) 2010 Elsevier Ltd. All rights reserved.

Effect of thermal annealing on the dielectric properties of KTiOPO4 single crystals

Dielectric properties of potassium titanyl phosphate have been investigated as a function of thickness and frequency, as well as annealing treatment under various atmospheres. The low frequency dielectric constant of KTP crystals is shown to depend upon the sample thickness, and this feature is attributed to the existence of surface layers. The frequency-dependent dielectric response of KTP exhibits a non-Debye type relaxation, with a distribution of relaxation times. The dielectric behavior of KTP samples annealed in various atmospheres shows that the low frequency dielectric constant is influenced by the contribution from the space charge layers. Prolonged annealing of the samples leads to a surface degradation, resulting in the formation of a surface layer of lower dielectric constant. This surface degradation is least when annealed in the presence of dry oxygen. From the analysis of the dielectric data using complex electric modulus, alpha(m) has been evaluated for the virgin and annealed samples. (C) 1996 American Institute of Physics.