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.

Modified Crack Closure Integral (MCCI) For 3-D Problems Using 20-Noded Brick Elements

The Modified Crack Closure Integral (MCCI) technique based on Irwin's crack closure integral concept is very effective for estimation of strain energy release rates G in individual as well as mixed-mode configurations in linear elastic fracture mechanics problems. In a finite element approach, MCCI can be evaluated in the post-processing stage in terms of nodal forces and displacements near the crack tip. The MCCI expressions are however, element dependent and require a systematic derivation using stress and displacement distributions in the crack tip elements. Earlier a general procedure was proposed by the present authors for the derivation of MCCI expressions for 3-dimensional (3-d) crack problems modelled with 8-noded brick elements. A concept of sub-area integration was proposed to estimate strain energy release rates at a large number of points along the crack front. In the present paper a similar procedure is adopted for the derivation of MCCI expressions for 3-d cracks modelled with 20-noded brick elements. Numerical results are presented for centre crack tension and edge crack shear specimens in thick slabs, showing a comparison between present results and those available in the literature.

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.

Texture Evolution in Boron Modified Ti-6Al-4V Alloy

Owing to their high strength-to-weight ratio, excellent mechanical properties and corrosion resistance, titanium (Ti) and its alloys, especially (alpha+beta) alloys like Ti-6Al-4V is the backbone materials for aerospace, energy, and chemical industries. Trace boron addition (similar to 0.1 wt. %) to the alloy Ti-6Al-4V produces a reduction in as-cast grain size by roughly an order of magnitude resulting in enhanced ductility, higher stiffness, strength and good fracture resistance. Boron addition could also affect the evolution of texture and microstructure in the material. The solidification microstructures of Boron free as well as Boron containing Ti-6Al-4V are found to be almost homogeneous from periphery towards the center of as-cast ingot in terms of both alpha-colony size and distribution. Boron addition substantially reduces alpha-colony size (similar to 50-80 mu m). A gradual change in alpha texture from periphery towards the center has been observed with orientations close to specific texture components suggesting the formation of texture zones. The mechanism of texture evolution can be visualized as a result of variant selection during solidification through (alpha+beta) phase field.

Robust Transceiver Design for Multiuser MIMO Downlink

In this paper, we consider robust joint linear precoder/receive filter design for multiuser multi-input multi-output (MIMO) downlink that minimizes the sum mean square error (SMSE) in the presence of imperfect channel state information (CSI). The base station is equipped with multiple transmit antennas, and each user terminal is equipped with multiple receive antennas. The CSI is assumed to be perturbed by estimation error. The proposed transceiver design is based on jointly minimizing a modified function of the MSE, taking into account the statistics of the estimation error under a total transmit power constraint. An alternating optimization algorithm, wherein the optimization is performed with respect to the transmit precoder and the receive filter in an alternating fashion, is proposed. The robustness of the proposed algorithm to imperfections in CSI is illustrated through simulations.

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).

Modified crack closure integral (MCCI) for 3-d problems using 20 noded brick elememnts

The Modified Crack Closure Integral (MCCI) technique based on Irwin's crack closure integral concept is very effective for estimation of strain energy release rates G in individual as well as mixed-mode configurations in linear elastic fracture mechanics problems. In a finite element approach, MCCI can be evaluated in the post-processing stage in terms of nodal forces and displacements near the crack tip. The MCCI expressions are however, element dependent and require a systematic derivation using stress and displacement distributions in the crack tip elements. Earlier a general procedure was proposed by the present authors for the derivation of MCCI expressions for 3-dimensional (3-d) crack problems modelled with 8-noded brick elements. A concept of sub-area integration was proposed to estimate strain energy release rates at a large number of points along the crack front. In the present paper a similar procedure is adopted for the derivation of MCCI expressions for 3-d cracks modelled with 20-noded brick elements. Numerical results are presented for centre crack tension and edge crack shear specimens in thick slabs, showing a comparison between present results and those available in the literature.

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.

Structure-Activity Relationship of Photocytotoxic Iron(III) Complexes of Modified Dipyridophenazine Ligands

Iron(III) complexes FeL(B)] (1-5) of a tetradentate trianionic phenolate-based ligand (L) and modified dipyridophenazine bases (B), namely, dipyrido-6,7,8,9-tetrahydrophenazine (dpqC in 1), dipyrido3,2-a:2',3'-c]phenazine-2-carboxylic acid (dppzc in 2), dipyrido3,2-a:2',3'-c]phenazine-11-sulfonic acid (dppzs in 3), 7-aminodipyrido3,2-a:2',3'-c]phenazine (dppza in 4) and benzoi]dipyridro3,2-a:2',3'-c]phenazine (dppn in 5), have been synthesized, and their photocytotoxic properties studied along with their dipyridophenazine analogue (6). The complexes have a five. electron paramagnetic iron(III) center, and the Fe(III)/Fe(II) redox couple appears at about 0.69 V versus SCE in DMF-0.1 M TBAP. The physicochemical data also suggest that the complexes possess similar structural features as that of its parent complex FeL(dppz)] with FeO3N3 coordination in a distorted octahedral geometry. The DNA-complex and protein-complex interaction studies have revealed that the complexes interact favorably with the biomolecules, the degree of which depends on the nature of the substituents present on the dipyridophenazine ring. Photocleavage Of pUC19 DNA by the complexes has been studied using visible light of 476, 530, and 647 nm wavelengths. Mechanistic investigations with inhibitors show formation of HO center dot radicals via a photoredox pathway. Photocytotoxicity study of the complexes in HeLa cells has shown that the dppn complex (5) is highly active in causing cell death in visible light with sub micromolar IC50 value. The effect of substitutions and the planarity of the phenazine moiety on the cellular uptake are quantified by determining the total Cellular iron content using the inductively coupled plasma-optical emission spectrometry (ICP-OES) technique. The cellular uptake increases marginally with an increase in the hydrophobicity of the dipyridophenazine ligands whereas complex 3 with dppzs shows very high uptake. Insights into the cell death mechanism by the dppn complex 5, obtained through DAFT nuclear staining in HeLa cells, reveal a rapid programmed cell death mechanism following photoactivation of complex 5 with visible light. The effect of substituent on the DNA photocleavage activity of the complexes has been rationalized from the theoretical studies.

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.

Analysis of a cracked lug loaded by an interference fit pin

In the present study, a lug joint fitted with an interference fit (oversized) pin is considered with radial through cracks situated at diametrically opposite points perpendicular to the loading direction. A finite element contact stress algorithm is developed with linear elastic assumptions to deal with varying partial contact/separation at the pin-plate interface using a marching solution. Stress Intensity Factor (SIF) at the crack tips is evaluated using the Modified Crack Closure Integral (MCCI) method. The effect of change in crack length and edge distance on the load-contact relation, SIFs and stress distributions are studied. A rigorous plane stress elasticity solution of the pin-plate interface at the crack mouth confirmed the existence of the stress concentration leading to a local peak in the radial stress at the crack mouth and provided a method of estimating it quantitatively. Copyright (C) 1996 Elsevier Science Ltd.

Fast algorithm for data exchange in reconfigurable tree structures

This paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exists two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear time complexity, and provides a large reduction in run-time as compared to a previously proposed algorithm. This is well-confirmed from the experimental results obtained by executing a large number of randomly-generated data exchange tables. Another significant feature of the algorithm is that the bit-size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.

Code Generation Paradigms On Optical Orthogonal And Other Codes In a Fiber Optic CDMA Lan

Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.

Pipelined ring algorithm for matrix multiplication on transputer networks: performance analysis and estimation

A parallel matrix multiplication algorithm is presented, and studies of its performance and estimation are discussed. The algorithm is implemented on a network of transputers connected in a ring topology. An efficient scheme for partitioning the input matrices is introduced which enables overlapping computation with communication. This makes the algorithm achieve near-ideal speed-up for reasonably large matrices. Analytical expressions for the execution time of the algorithm have been derived by analysing its computation and communication characteristics. These expressions are validated by comparing the theoretical results of the performance with the experimental values obtained on a four-transputer network for both square and irregular matrices. The analytical model is also used to estimate the performance of the algorithm for a varying number of transputers and varying problem sizes. Although the algorithm is implemented on transputers, the methodology and the partitioning scheme presented in this paper are quite general and can be implemented on other processors which have the capability of overlapping computation with communication. The equations for performance prediction can also be extended to other multiprocessor systems.

Low cycle fatigue behaviour of a nitrogen modified 316L stainless steel at 823 K

Strain controlled low cycle fatigue tests on solution annealed nitrogen modified 316L stainless steel have been conducted in air at 823 K to ascertain the influence of strain rate and strain amplitude. Effect of strain rate was examined from 3x10(-5) s(-1) to 3 x 10(-2) at a fixed strain amplitude of +/- 0.6%. The influence of strain amplitude was evaluated between +/- 0.25 % and +/- 1.0% at a constant strain rate of 3x10(-3) s(-1). The cyclic stress response at all testing conditions is characterized by an initial hardening followed by saturation. Serrated flow, a characteristic feature of dynamic strain ageing (DSA) was seen at strain rates lower than 3x10(-3) s(-1). Fatigue life was found to decrease with decrease in strain rate. The reduction in fatigue resistance is attributed mainly to the detrimental effects associated with DSA.