On generating optimal signal probabilities for random tests: A genetic approach

Genetic Algorithms are robust search and optimization techniques. A Genetic Algorithm based approach for determining the optimal input distributions for generating random test vectors is proposed in the paper. A cost function based on the COP testability measure for determining the efficacy of the input distributions is discussed, A brief overview of Genetic Algorithms (GAs) and the specific details of our implementation are described. Experimental results based on ISCAS-85 benchmark circuits are presented. The performance pf our GA-based approach is compared with previous results. While the GA generates more efficient input distributions than the previous methods which are based on gradient descent search, the overheads of the GA in computing the input distributions are larger. To account for the relatively quick convergence of the gradient descent methods, we analyze the landscape of the COP-based cost function. We prove that the cost function is unimodal in the search space. This feature makes the cost function amenable to optimization by gradient-descent techniques as compared to random search methods such as Genetic Algorithms.

Repeated drop weight impacts and post-impact ILSS tests on glass-epoxy composite

E glass epoxy laminates of thicknesses in the range 2-5 mm were subjected to repeated impacts. For each thickness the number of hits to cause tup penetration was determined and the value of this number was higher the larger the thickness of the laminate tested. The C-scan, before and after impact, was done to obtain information regarding flaw distribution. Short beam shear test samples were made from locations at fixed distances from impact point and tested. The samples closer to the zone of impact showed lower strength values. Scanning fractography revealed shear deformation features for these samples and brittle fracture features for the region near the zone of impact.

Maintaining dynamic sequences under equality tests in polylogarithmic time

We present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O(1) time. The randomized version supports new sequence creations in O(log(2) n) expected time where n is the length of the sequence created. The deterministic solution supports sequence creations in O(log n (log m log* m + log n)) time for the mth operation.

Validation of processing maps for a 15Cr-15Ni-2.2Mo-0.3Ti austenitic stainless steel using hot forging and rolling tests

The processing maps are being developed for use in optimising hot workability and controlling the microstructure of the product. The present investigation deals with the examination to assess the prediction of the processing maps for a 15Cr-15Ni-2.2Mo-0.3Ti austenitic stainless steel using forging and rolling tests at different temperatures in the range of 600-1200 degreesC. The tensile properties of these deformed products were evaluated at room temperature. The influence of the processing conditions, i.e. strain rate and temperature on the tensile properties of the deformed product were analysed to identify the optimum processing parameters. The results have shown good agreement between the regimes exhibited by the map and the properties of the rolled or forged product. The optimum parameters for processing of this steel were identified as rolling or press forging at temperatures above 1050 degreesC to obtain optimum product properties. (C) 2002 Elsevier Science B.V. All rights reserved.

A low power, process invariant keeper design for high speed dynamic logic circuits

A low power keeper circuit using the concept of rate sensing has been proposed. The proposed technique reduces the amount of short circuit power dissipation in the domino gate by 70% compared to the conventional keeper technique. Also the total power-delay product is 26% lower compared to the previously reported techniques. The process tracking capability of the design enables the domino gate to achieve uniform delay across different process corners. This reduces the amount of short circuit power dissipation that occurs in the cascaded domino gates by 90%. The use of the proposed technique in the read path of a register file reduces the energy requirement by 26% as compared to the other keeper techniques. The proposed technique has been prototyped in 130nm CMOS technology.

Conjugacy invariant pseudo-norms, representability and RNA secondary structures

To a reasonable approximation, a secondary structures of RNA is determined by Watson-Crick pairing without pseudo-knots in such a way as to minimise the number of unpaired bases: We show that this minimal number is determined by the maximal conjugacy-invariant pseudo-norm on the free group on two generators subject to bounds on the generators. This allows us to construct lower bounds on the minimal number of unpaired bases by constructing conjugacy invariant pseudo-norms. We show that one such construction, based on isometric actions on metric spaces, gives a sharp lower bound. A major goal here is to formulate a purely mathematical question, based on considering orthogonal representations, which we believe is of some interest independent of its biological roots.

An invariant subspace-based approach to the random eigenvalue problem of systems with clustered spectrum

The repeated or closely spaced eigenvalues and corresponding eigenvectors of a matrix are usually very sensitive to a perturbation of the matrix, which makes capturing the behavior of these eigenpairs very difficult. Similar difficulty is encountered in solving the random eigenvalue problem when a matrix with random elements has a set of clustered eigenvalues in its mean. In addition, the methods to solve the random eigenvalue problem often differ in characterizing the problem, which leads to different interpretations of the solution. Thus, the solutions obtained from different methods become mathematically incomparable. These two issues, the difficulty of solving and the non-unique characterization, are addressed here. A different approach is used where instead of tracking a few individual eigenpairs, the corresponding invariant subspace is tracked. The spectral stochastic finite element method is used for analysis, where the polynomial chaos expansion is used to represent the random eigenvalues and eigenvectors. However, the main concept of tracking the invariant subspace remains mostly independent of any such representation. The approach is successfully implemented in response prediction of a system with repeated natural frequencies. It is found that tracking only an invariant subspace could be sufficient to build a modal-based reduced-order model of the system. Copyright (C) 2012 John Wiley & Sons, Ltd.

A new method for fracture toughness determination of graded (Pt,Ni)Al bond coats by microbeam bend tests

A novel method is proposed for fracture toughness determination of graded microstructurally complex (Pt,Ni)Al bond coats using edge-notched doubly clamped beams subjected to bending. Micron-scale beams are machined using the focused ion beam and loaded in bending under a nanoindenter. Failure loads gathered from the pop-ins in the load-displacement curves combined with XFEM analysis are used to calculate K-c at individual zones, free from substrate effects. The testing technique and sources of errors in measurement are described and possible micromechanisms of fracture in such heterogeneous coatings discussed.