Influence of matrix characteristics on fracture toughness of high volume fraction Al2O3/Al–AlN composites

The role of matrix microstructure on the fracture of Al-alloy composites with 60 vol% alumina particulates was studied. The matrix composition and microstructure were systematically varied by changing the infiltration temperature and heat treatment. Characterization was carried out by a combination of metallography, hardness measurements, and fracture studies conducted on compact tension specimens to study the fracture toughness and crack growth in the composites. The composites showed a rise in crack resistance with crack extension (R curves) due to bridges of intact matrix ligaments formed in the crack wake. The steady-state or plateau toughness reached upon stable crack growth was observed to be more sensitive to the process temperature rather than to the heat treatment. Fracture in the composites was predominantly by particle fracture, extensive deformation, and void nucleation in the matrix. Void nucleation occurred in the matrix in the as-solutionized and peak-aged conditions and preferentially near the interface in the underaged and overaged conditions. Micromechanical models based on crack bridging by intact ductile ligaments were modified by a plastic constraint factor from estimates of the plastic zone formed under indentations, and are shown to be adequate in predicting the steady-state toughness of the composite.

Fracture and R-curves in high volume fraction Al2O3/Al composites

Fracture toughness and fracture mechanisms in Al2O3/Al composites are described. The unique flexibility offered by pressureless infiltration of molten Al alloys into porous alumina preforms was utilized to investigate the effect of microstructural scale and matrix properties on the fracture toughness and the shape of the crack resistance curves (R-curves). The results indicate that the observed increment in toughness is due to crack bridging by intact matrix ligaments behind the crack tip. The deformation behavior of the matrix, which is shown to be dependent on the microstructural constraints, is the key parameter that influences both the steady-state toughness and the shape of the R-curves. Previously proposed models based on crack bridging by intact ductile particles in a ceramic matrix have been modified by the inclusion of an experimentally determined plastic constraint factor (P) that determines the deformation of the ductile phase and are shown to be adequate in predicting the toughness increment in the composites. Micromechanical models to predict the crack tip profile and the bridge lengths (L) correlate well with the observed behavior and indicate that the composites can be classified as (i) short-range toughened and (ii) long-range toughened on the basis of their microstructural characteristics.

Dynamic matrix rank with partial lookahead

We consider the problem of maintaining information about the rank of a matrix $M$ under changes to its entries. For an $n \times n$ matrix $M$, we show an amortized upper bound of $O(n^{\omega-1})$ arithmetic operations per change for this problem, where $\omega < 2.376$ is the exponent for matrix multiplication, under the assumption that there is a {\em lookahead} of up to $\Theta(n)$ locations. That is, we know up to the next $\Theta(n)$ locations $(i_1,j_1),(i_2,j_2),\ldots,$ whose entries are going to change, in advance; however we do not know the new entries in these locations in advance. We get the new entries in these locations in a dynamic manner.

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Study of symmetrical and related components through the theory of linear vector spaces

The paper proposes a study of symmetrical and related components, based on the theory of linear vector spaces. Using the concept of equivalence, the transformation matrixes of Clarke, Kimbark, Concordia, Boyajian and Koga are shown to be column equivalent to Fortescue's symmetrical-component transformation matrix. With a constraint on power, criteria are presented for the choice of bases for voltage and current vector spaces. In particular, it is shown that, for power invariance, either the same orthonormal (self-reciprocal) basis must be chosen for both voltage and current vector spaces, or the basis of one must be chosen to be reciprocal to that of the other. The original �¿, ��, 0 components of Clarke are modified to achieve power invariance. For machine analysis, it is shown that invariant transformations lead to reciprocal mutual inductances between the equivalent circuits. The relative merits of the various components are discussed.

3D Acoustic Analysis Of Spherical Chamber Having Single Inlet And Multiple Outlet: An Impedance Matrix Approach

The transmission loss (TL) performance of spherical chambers having single inlet and multiple outlet is obtained analytically through modal expansion of acoustic field inside the spherical cavity in terms of the spherical Bessel functions and Legendre polynomials. The uniform piston driven model based upon the impedance [Z] matrix is used to characterize the multi-port spherical chamber. It is shown analytically that the [Z] parameters are independent of the azimuthal angle (phi) due to the axisymmetric shape of the sphere; rather, they depend only upon the polar angle (theta) and radius of the chamber R(0). Thus, the effects of relative polar angular location of the ports and number of outlet ports are investigated. The analytical results are shown to be in good agreement with the 3D FEA results, thereby validating the procedure suggested in this work.

Wave propagation in single-walled carbon nanotube under longitudinal magnetic field using nonlocal Euler-Bernoulli beam theory

In the present work, the effect of longitudinal magnetic field on wave dispersion characteristics of equivalent continuum structure (ECS) of single-walled carbon nanotubes (SWCNT) embedded in elastic medium is studied. The ECS is modelled as an Euler-Bernoulli beam. The chemical bonds between a SWCNT and the elastic medium are assumed to be formed. The elastic matrix is described by Pasternak foundation model, which accounts for both normal pressure and the transverse shear deformation. The governing equations of motion for the ECS of SWCNT under a longitudinal magnetic field are derived by considering the Lorentz magnetic force obtained from Maxwell's relations within the frame work of nonlocal elasticity theory. The wave propagation analysis is performed using spectral analysis. The results obtained show that the velocity of flexural waves in SWCNTs increases with the increase of longitudinal magnetic field exerted on it in the frequency range: 0-20 THz. The present analysis also shows that the flexural wave dispersion in the ECS of SWCNT obtained by local and nonlocal elasticity theories differ. It is found that the nonlocality reduces the wave velocity irrespective of the presence of the magnetic field and does not influences it in the higher frequency region. Further it is found that the presence of elastic matrix introduces the frequency band gap in flexural wave mode. The band gap in the flexural wave is found to independent of strength of the longitudinal magnetic field. (C) 2011 Elsevier Inc. All rights reserved.

Nonlocal continuum mechanics based ultrasonic flexural wave dispersion characteristics of a monolayer graphene embedded in polymer matrix

Wave propagation in graphene sheet embedded in elastic medium (polymer matrix) has been a topic of great interest in nanomechanics of graphene sheets, where the equivalent continuum models are widely used. In this manuscript, we examined this issue by incorporating the nonlocal theory into the classical plate model. The influence of the nonlocal scale effects has been investigated in detail. The results are qualitatively different from those obtained based on the local/classical plate theory and thus, are important for the development of monolayer graphene-based nanodevices. In the present work, the graphene sheet is modeled as an isotropic plate of one-atom thick. The chemical bonds are assumed to be formed between the graphene sheet and the elastic medium. The polymer matrix is described by a Pasternak foundation model, which accounts for both normal pressure and the transverse shear deformation of the surrounding elastic medium. When the shear effects are neglected, the model reduces to Winkler foundation model. The normal pressure or Winkler elastic foundation parameter is approximated as a series of closely spaced, mutually independent, vertical linear elastic springs where the foundation modulus is assumed equivalent to stiffness of the springs. For this model, the nonlocal governing differential equations of motion are derived from the minimization of the total potential energy of the entire system. An ultrasonic type of flexural wave propagation model is also derived and the results of the wave dispersion analysis are shown for both local and nonlocal elasticity calculations. From this analysis we show that the elastic matrix highly affects the flexural wave mode and it rapidly increases the frequency band gap of flexural mode. The flexural wavenumbers obtained from nonlocal elasticity calculations are higher than the local elasticity calculations. The corresponding wave group speeds are smaller in nonlocal calculation as compared to local elasticity calculation. The effect of y-directional wavenumber (eta(q)) on the spectrum and dispersion relations of the graphene embedded in polymer matrix is also observed. We also show that the cut-off frequencies of flexural wave mode depends not only on the y-direction wavenumber but also on nonlocal scaling parameter (e(0)a). The effect of eta(q) and e(0)a on the cut-off frequency variation is also captured for the cases of with and without elastic matrix effect. For a given nanostructure, nonlocal small scale coefficient can be obtained by matching the results from molecular dynamics (MD) simulations and the nonlocal elasticity calculations. At that value of the nonlocal scale coefficient, the waves will propagate in the nanostructure at that cut-off frequency. In the present paper, different values of e(0)a are used. One can get the exact e(0)a for a given graphene sheet by matching the MD simulation results of graphene with the results presented in this article. (c) 2012 Elsevier Ltd. All rights reserved.

Consistency tests of Ampcalculator and chiral amplitudes in SU(3) Chiral Perturbation Theory: A tutorial-based approach

Ampcalculator (AMPC) is a Mathematica (c) based program that was made publicly available some time ago by Unterdorfer and Ecker. It enables the user to compute several processes at one loop (upto O(p(4))) in SU(3) chiral perturbation theory. They include computing matrix elements and form factors for strong and non-leptonic weak processes with at most six external states. It was used to compute some novel processes and was tested against well-known results by the original authors. Here we present the results of several thorough checks of the package. Exhaustive checks performed by the original authors are not publicly available, and hence the present effort. Some new results are obtained from the software especially in the kaon odd-intrinsic parity non-leptonic decay sector involving the coupling G(27). Another illustrative set of amplitudes at tree level we provide is in the context of tau-decays with several mesons including quark mass effects, of use to the BELLE experiment. All eight meson-meson scattering amplitudes have been checked. The Kaon-Compton amplitude has been checked and a minor error in the published results has been pointed out. This exercise is a tutorial-based one, wherein several input and output notebooks are also being made available as ancillary files on the arXiv. Some of the additional notebooks we provide contain explicit expressions that we have used for comparison with established results. The purpose is to encourage users to apply the software to suit their specific needs. An automatic amplitude generator of this type can provide error-free outputs that could be used as inputs for further simplification, and in varied scenarios such as applications of chiral perturbation theory at finite temperature, density and volume. This can also be used by students as a learning aid in low-energy hadron dynamics.

Pattern clustering using cooperative game theory

In this paper, we approach the classical problem of clustering using solution concepts from cooperative game theory such as Nucleolus and Shapley value. We formulate the problem of clustering as a characteristic form game and develop a novel algorithm DRAC (Density-Restricted Agglomerative Clustering) for clustering. With extensive experimentation on standard data sets, we compare the performance of DRAC with that of well known algorithms. We show an interesting result that four prominent solution concepts, Nucleolus, Shapley value, Gately point and \tau-value coincide for the defined characteristic form game. This vindicates the choice of the characteristic function of the clustering game and also provides strong intuitive foundation for our approach.

Fast acoustic likelihood computation using low-rank matrix approximation

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for LVCSR systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication.In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on a 1138 word vocabulary RM1 task using Sphinx 3.7 system show that, for a typical case the matrix multiplication approach leads to overall speedup of 46%. Both the low-rank approximation methods increase the speedup to around 60%, with the former method increasing the word error rate (WER) from 3.2% to 6.6%, while the latter increases the WER from 3.2% to 3.5%.

Multiple transmitter localization and communication footprint identification using sparse reconstruction techniques

This paper considers the problem of identifying the footprints of communication of multiple transmitters in a given geographical area. To do this, a number of sensors are deployed at arbitrary but known locations in the area, and their individual decisions regarding the presence or absence of the transmitters' signal are combined at a fusion center to reconstruct the spatial spectral usage map. One straightforward scheme to construct this map is to query each of the sensors and cluster the sensors that detect the primary's signal. However, using the fact that a typical transmitter footprint map is a sparse image, two novel compressive sensing based schemes are proposed, which require significantly fewer number of transmissions compared to the querying scheme. A key feature of the proposed schemes is that the measurement matrix is constructed from a pseudo-random binary phase shift applied to the decision of each sensor prior to transmission. The measurement matrix is thus a binary ensemble which satisfies the restricted isometry property. The number of measurements needed for accurate footprint reconstruction is determined using compressive sampling theory. The three schemes are compared through simulations in terms of a performance measure that quantifies the accuracy of the reconstructed spatial spectral usage map. It is found that the proposed sparse reconstruction technique-based schemes significantly outperform the round-robin scheme.