Porosity-dependence of elastic properties and ultrasonic velocity in polycrystalline alumina — a model based on cylindrical pores

Effective elastic moduli and ultrasonic velocity of materials having aligned cylindrical pores have been derived using a series expansion in terms of the difference between the upper and lower bounds of elastic moduli obtained by the variational method. The theoretical results for polycrystalline alumina agree well with the experimental data, confirming the suggestion of previous researchers that a matrix containing parallel cylindrical pores orientated perpendicular to the applied stress, provide a better model than a spherical one in describing the porosity-dependence of elastic moduli in sintered specimens.     

Elastic properties of porous thermosetting polymers

A new equationE =E ₀ (1 –bp) ⁿ has been derived semi-empirically to describe the porosity dependence of elastic properties of thermosetting polymers. The material constantb is defined as a pore distribution geometry factor and the other material constantn is dependent on pore geometry. The equation shows good agreement with the data on porous polyester and epoxy resins.     

Young's modulus of porous brittle solids

A new equationE =E ₀ (1 –aP) ⁿ whereE andE ₀ are the Young's moduli at porosity,P, and zero, respectively, a andn are material constants, has been derived semi-empirically for describing the porosity dependence of Young's modulus of brittle solids. The equation satisfies quite well the exact theoretical solution for the values of Young's moduli at different porosities for model systems with ideal and non-ideal packing geometry. The equation shows excellent agreement with the data On- and-alumina over a wide range of porosity. Unlike the existing porosity-elastic modulus equations, the proposed equation satisfies the boundary conditions and is inherently capable of treating isometric closed pores as well as non-isometric interconnected pores. The parameters a and n provide information about the packing geometry and pore structure of the material.     

Evaluation of Concurrent Flaw Populations in Silicon Carbide in Terms of a Modified Weibull Distribution Function

Concurrent surface- and edge-flaw populations are often observed in strength testing of ceramics The overall strength distribution in such ceramic samples has been analyzed in terms of a modified Weibull distribution function. The junction provides an upper and lower strength limit and is characterized by two shape and location parameters. To evaluate the parameters of the distribution function, the type of flaw that causes failure need not be identified. The applicability of the function has been evaluated in terms of experimental results on SiC specimens. The analysis also shows that the relative values of shape parameters determine which flaw type dominates.     

Combining the evidences of temporal and spectral enhancement techniques for improving the performance of Indian language identification system in the presence of background noise

Language Identification has gained significant importance in recent years, both in research and commercial market place, demanding an improvement in the ability of machines to distinguish between languages. Although methods like Gaussian mixture models, hidden Markov models and neural networks are used for identifying languages the problem of language identification in noisy environments could not be addressed so far. This paper addresses the performance of automatic language identification system in noisy environments. A comparative performance analysis of speech enhancement techniques like minimum mean squared estimation, spectral subtraction and temporal processing, with different types of noise at different SNRs, is presented here. Though these individual enhancement techniques may not yield good performance with different types of noise at different SNRs, it is proposed to combine the evidences of all these techniques to improve the overall performance of the system significantly. The language identification studies are performed using IITKGP-MLILSC (IIT Kharagpur-Multilingual Indian Language Speech Corpus) databases which consists of 27 languages.     

Pyramid coding based rate control for constant bit rate video streaming

In this paper, a novel pyramid coding based rate control scheme is proposed for video streaming applications constrained by a constant channel bandwidth. To achieve the target bit rate with the best quality, the initial quantization parameter (QP) is determined by the average spatio-temporal complexity of the sequence, its resolution and the target bit rate. Simple linear estimation models are then used to predict the number of bits that would be necessary to encode a frame for a given complexity and QP. The experimental results demonstrate that the proposed rate control scheme significantly outperforms the existing rate control scheme in the Joint Model (JM) reference software in terms of Peak Signal to Noise Ratio (PSNR) and consistent perceptual visual quality while achieving the target bit rate. Finally, the proposed scheme is validated through experimental evaluation over a miniature test-bed.

     

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints

We present polylogarithmic approximations for the R|prec|C _max and R|prec|∑ _j w _j C _j problems, when the precedence constraints are “treelike”—i.e., when the undirected graph underlying the precedences is a forest. These are the first non-trivial generalizations of the job shop scheduling problem to scheduling with precedence constraints that are not just chains. These are also the first non-trivial results for the weighted completion time objective on unrelated machines with precedence constraints of any kind. We obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment—this generalizes the job shop problem to these objective functions. We use the same lower bound of “congestion + dilation”, as in other job shop scheduling approaches (e.g. Shmoys, Stein and Wein, SIAM J. Comput. 23, 617–632, 1994). The first step in our algorithm for the R|prec|C _max problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random-delays technique of Leighton, Maggs and Rao to the case of trees. For the special case of chains, we show a dependent rounding technique which leads to a bicriteria approximation algorithm for minimizing the flow time, a notoriously hard objective function. A preliminary version of this paper appeared in the Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 146–157, 2005. V.S. Anil Kumar supported in part by NSF Award CNS-0626964. Part of this work was done while at the Los Alamos National Laboratory, and supported in part by the Department of Energy under Contract W-7405-ENG-36. M.V. Marathe supported in part by NSF Award CNS-0626964. Part of this work was done while at the Los Alamos National Laboratory, and supported in part by the Department of Energy under Contract W-7405-ENG-36. Part of this work by S. Parthasarathy was done while at the Department of Computer Science, University of Maryland, College Park, MD 20742, and in part while visiting the Los Alamos National Laboratory. Research supported in part by NSF Award CCR-0208005 and NSF ITR Award CNS-0426683. Research of A. Srinivasan supported in part by NSF Award CCR-0208005, NSF ITR Award CNS-0426683, and NSF Award CNS-0626636.