Points-to Analysis as a System of Linear Equations

We propose a novel formulation of the points-to analysis as a system of linear equations. With this, the efficiency of the points-to analysis can be significantly improved by leveraging the advances in solution procedures for solving the systems of linear equations. However, such a formulation is non-trivial and becomes challenging due to various facts, namely, multiple pointer indirections, address-of operators and multiple assignments to the same variable. Further, the problem is exacerbated by the need to keep the transformed equations linear. Despite this, we successfully model all the pointer operations. We propose a novel inclusion-based context-sensitive points-to analysis algorithm based on prime factorization, which can model all the pointer operations. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that our approach is competitive to the state-of-the-art algorithms. With an average memory requirement of mere 21MB, our context-sensitive points-to analysis algorithm analyzes each benchmark in 55 seconds on an average.

Exact-Solutions Of Linear Partial-Differential Equations With Variable-Coefficients

Backlund transformations relating the solutions of linear PDE with variable coefficients to those of PDE with constant coefficients are found, generalizing the study of Varley and Seymour [2]. Auto-Backlund transformations are also determined. To facilitate the generation of new solutions via Backlund transformation, explicit solutions of both classes of the PDE just mentioned are found using invariance properties of these equations and other methods. Some of these solutions are new.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

Creep in TiO2 doped Zirconia: Implications for high strain rate superplasticity

In ceramics, dopants offer the possibility of higher creep rates by enhancing diffusion. The present study examines the potential for high strain rate superplasticity in a TiO2 doped zirconia, by conducting creep experiments together with microstructural characterization. It is shown that both pure and doped zirconia exhibit transitions in creep behaviour from Coble diffusion creep with n similar to 1 to an interface controlled process with n similar to 2. Doping with TiO2 enhances the creep rate by over an order of magnitude. There is evidence of substantial grain boundary sliding, consistent with diffusion creep.

MOSAICS: Multiplexed Optimal Signal Acquisition Involving Compressed Sensing

It is possible to sample signals at sub-Nyquist rate and still be able to reconstruct them with reasonable accuracy provided they exhibit local Fourier sparsity. Underdetermined systems of equations, which arise out of undersampling, have been solved to yield sparse solutions using compressed sensing algorithms. In this paper, we propose a framework for real time sampling of multiple analog channels with a single A/D converter achieving higher effective sampling rate. Signal reconstruction from noisy measurements on two different synthetic signals has been presented. A scheme of implementing the algorithm in hardware has also been suggested.

Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems

For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for n(r) < 4. For any value of n(r), the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.

Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks

Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and non-square CODs other than the Alamouti design) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop wireless relay networks using the amplify and forward protocol. For such a network, a new class of high rate, training-symbol embedded (TSE) SSD DSTBCs are proposed from TSE-CODs. The constructed codes include the training symbols within the structure of the code which is shown to be the key point to obtain high rate along with the SSD property. TSE-CODs are shown to offer full-diversity for arbitrary complex constellations. Non-square TSE-CODs are shown to provide better rates (in symbols per channel use) compared to the known SSD DSTBCs for relay networks when the number of relays is less than 10. Importantly, the proposed DSTBCs do not contain zeros in their codewords and as a result, antennas of the relay nodes do not undergo a sequence of switch on and off transitions within every codeword use. Hence, the proposed DSTBCs eliminate the antenna switching problem.

Effect of strain rate on the high-temperature low-cycle fatigue properties of a nimonic PE-16 superalloy

Strain-rate effects on the low-cycle fatigue (LCF) behavior of a NIMONIC PE-16 superalloy have been evaluated in the temperature range of 523 to 923 K. Total-strain-controlled fatigue tests were per-formed at a strain amplitude of +/-0.6 pct on samples possessing two different prior microstructures: microstructure A, in the solution-annealed condition (free of gamma' and carbides); and microstructure B, in a double-aged condition with gamma' of 18-nm diameter and M23C6 carbides. The cyclic stress response behavior of the alloy was found to depend on the prior microstructure, testing temperature, and strain rate. A softening regime was found to be associated with shearing of ordered gamma' that were either formed during testing or present in the prior microstructure. Various manifestations of dynamic strain aging (DSA) included negative strain rate-stress response, serrations on the stress-strain hysteresis loops, and increased work-hardening rate. The calculated activation energy matched well with that for self-diffusion of Al and Ti in the matrix. Fatigue life increased with an increase in strain rate from 3 x 10(-5) to 3 x 10(-3) s-1, but decreased with further increases in strain rate. At 723 and 823 K and low strain rates, DSA influenced the deformation and fracture behavior of the alloy. Dynamic strain aging increased the strain localization in planar slip bands, and impingement of these bands caused internal grain-boundary cracks and reduced fatigue life. However, at 923 K and low strain rates, fatigue crack initiation and propagation were accelerated by high-temperature oxidation, and the reduced fatigue life was attributed to oxidation-fatigue interaction. Fatigue life was maximum at the intermediate strain rates, where strain localization was lower. Strain localization as a function of strain rate and temperature was quantified by optical and scanning electron microscopy and correlated with fatigue life.

Effects of Ultrafast Solvation on the Rate of Adiabatic Outer-Sphere Electron Transfer Reactions

Recent studies have demonstrated that solvation dynamics in many common dipolar liquids contain an initial, ultrafast Gaussian component which may contribute even more than 60% to the total solvation energy. It is also known that adiabatic electron transfer reactions often probe the high-frequency components of the relevant solvent friction (Hynes, J. T. J. Phys. Chem. 1986, 90, 3701). In this paper, we present a theoretical study of the effects of the ultrafast solvent polar modes on the adiabatic electron transfer reactions by using the formalism of Hynes. Calculations have been carried out for a model system and also for water and acetonitrile. It is found that, in general, the ultrafast modes can greatly enhance the rate of electron transfer, even by more than an order of magnitude, over the rate obtained by using only the slow overdamped modes usually considered. For water, this acceleration of the rate can be attributed to the high-frequency intermolecular vibrational and librational modes. For a weakly adiabatic reaction, the rate is virtually indistinguishable from the rate predicted by the Marcus transition state theory. Another important result is that even in this case of ultrafast underdamped solvation, energy diffusion appears to be efficient so that electron transfer reaction in water is controlled essentially by the barrier crossing dynamics. This is because the reactant well frequency is-directly proportional to the rate of the initial Gaussian decay of the solvation time correlation function. As a result, the value of the friction at the reactant well frequency rarely falls below the value required for the Kramers turnover except when the polarizability of the water molecules may be neglected. On the other hand, in acetonitrile, the rate of electron transfer reaction is found to be controlled by the energy diffusion dynamics, although a significant contribution to the rate comes also from the barrier crossing rate. Therefore, the present study calls for a need to understand the relaxation of the high-frequency modes in dipolar liquids.

Exact free-surface flows for shallow-water equations .1. - the incompressible case

A comprehensive exact treatment of free surface flows governed by shallow water equations (in sigma variables) is given. Several new families of exact solutions of the governing PDEs are found and are shown to embed the well-known self-similar or traveling wave solutions which themselves are governed by reduced ODEs. The classes of solutions found here are explicit in contrast to those found earlier in an implicit form. The height of the free surface for each family of solutions is found explicitly. For the traveling or simple wave, the free surface is governed by a nonlinear wave equation, but is arbitrary otherwise. For other types of solutions, the height of the free surface is constant either on lines of constant acceleration or on lines of constant speed; in another case, the free surface is a horizontal plane while the flow underneath is a sine wave. The existence of simple waves on shear flows is analytically proved. The interaction of large amplitude progressive waves with shear flow is also studied.

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

PVU and wave-particle splitting schemes for Euler equations of gas dynamics

A new way of flux-splitting, termed as the wave-particle splitting is presented for developing upwind methods for solving Euler equations of gas dynamics. Based on this splitting, two new upwind methods termed as Acoustic Flux Vector Splitting (AFVS) and Acoustic Flux Difference Splitting (AFDS) methods are developed. A new Boltzmann scheme, which closely resembles the wave-particle splitting, is developed using the kinetic theory of gases. This method, termed as Peculiar Velocity based Upwind (PVU) method, uses the concept of peculiar velocity for upwinding. A special feature of all these methods that the unidirectional and multidirectional parts of the flux vector are treated separately. Extensive computations done using these schemes demonstrate the soundness of the ideas.