Specification Based Regression Testing Using Explicit State Space Enumeration

This paper presents a method of partial automation of specification based regression testing, which we call ESSE (Explicit State Space Enumeration). The first step in ESSE method is the extraction of a finite state model of the system making use of an already tested version of the system under test (SUT). Thereafter, the finite state model thus obtained is used to compute good test sequences that can be used to regression test subsequent versions of the system. We present two new algorithms for test sequence computation - both based on our finite state model generated by the above method. We also provide the details and results of the experimental evaluation of ESSE method. Comparison with a practically used random-testing algorithm has shown substantial improvements.

An Algorithm for Testing 2-Asummability of Boolean Functions

Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables.

Materials, Processing, and Testing of Flexible Image Sensor Arrays

Editors' note:Flexible, large-area display and sensor arrays are finding growing applications in multimedia and future smart homes. This article first analyzes and compares current flexible devices, then discusses the implementation, requirements, and testing of flexible sensor arrays.—Jiun-Lang Huang (National Taiwan University) and Kwang-Ting (Tim) Cheng (University of California, Santa Barbara)

Testing concordance in species boundaries using acoustic, morphological, and molecular data in the field cricket genus Itaropsis (Orthoptera: Grylloidea, Gryllidae: Gryllinae)

In most taxa, species boundaries are inferred based on differences in morphology or DNA sequences revealed by taxonomic or phylogenetic analyses. In crickets, acoustic mating signals or calling songs have species-specific structures and provide a third data set to infer species boundaries. We examined the concordance in species boundaries obtained using acoustic, morphological, and molecular data sets in the field cricket genus Itaropsis. This genus is currently described by only one valid species, Itaropsis tenella, with a broad distribution in western peninsular India and Sri Lanka. Calling songs of males sampled from four sites in peninsular India exhibited significant differences in a number of call features, suggesting the existence of multiple species. Cluster analysis of the acoustic data, molecular phylogenetic analyses, and phylogenetic analyses combining all data sets suggested the existence of three clades. Whatever the differences in calling signals, no full congruence was obtained between all the data sets, even though the resultant lineages were largely concordant with the acoustic clusters. The genus Itaropsis could thus be represented by three morphologically cryptic incipient species in peninsular India; their distributions are congruent with usual patterns of endemism in the Western Ghats, India. Song evolution is analysed through the divergence in syllable period, syllable and call duration, and dominant frequency.

A new 6-component accelerometer force balance for short duration ground testing facilities

A new six-component accelerometer force balance is developed and used in the HST2 shock tunnel of Indian Institute of Science. Aerodynamic forces and moments for a hypersonic slender body measured using this balance system at a free stream Mach number of 5.75 and Reynolds number of 1.5 million and stagnation enthalpy of 1.5 and 2 MJ/kg are presented. These measured values compare well with the theoretical values estimated using modified Newtonian theory.

The Effects of Nitrogen Bonding on Hardness of AIN/CrN Multilayer Hard Coatings

AIN/CrN multilayer hard coatings with various bilayer thicknesses were fabricated by a reactive sputtering process. The microstructural and mechanical characterizations of multilayer coatings were investigated through transmission electron microscope (TEM) observations and the hardness measurements by nano indentation. In particular, the variation of chemical bonding states of the bilayer nitrides was elucidated by near edge X-ray absorption fine structure (NEXAFS) spectroscopy. Many broken nitrogen bonds were formed by decreasing the bilayer thickness of AIN/CrN multilayer coatings. Existence of optimum AIN/CrN multilayer coatings thickness for maximum hardness could be explained by the competition of softening by the formation of broken nitrogen bonds and strengthening induced by decreasing bilayer thickness.

Hardness and Nitrogen Bonding Structure of A(x)Ti(1-x)N/CrN Multilayer Hard Coating

AlxTi1-xN/CrN multilayer coatings were fabricated by magnetron sputtering and those hardness variations were studied by observing the crack propagation and measuring the chemical bonding state of nitrides by Ti addition. While AlN/CrN multilayer shown stair-like crack propagation, AlxTi1-xN/CrN multilayer illustrated straight crack propagation. Most interestingly, Ti addition induced more broken nitrogen bonds in the nitride multilayers, leading to the reduction of hardness. However, the hardness of Al0.25Ti0.75N/CrN multilayer, having high Ti contents, increased by the formation of many Ti-N bond again instead of Al-N bond. From these results, we found that linear crack propagation behavior was dominated by broken nitrogen bonds in the AlxT1-xN/CrN multilayer coatings.

Statistical Methods for Accelerated Life Testing with Particular Reference to Resin Impregnated Paper Bushings

Electrical failure of insulation is known to be an extremal random process wherein nominally identical pro-rated specimens of equipment insulation, at constant stress fail at inordinately different times even under laboratory test conditions. In order to be able to estimate the life of power equipment, it is necessary to run long duration ageing experiments under accelerated stresses, to acquire and analyze insulation specific failure data. In the present work, Resin Impregnated Paper (RIP) a relatively new insulation system of choice used in transformer bushings, is taken as an example. The failure data has been processed using proven statistical methods, both graphical and analytical. The physical model governing insulation failure at constant accelerated stress has been assumed to be based on temperature dependent inverse power law model.

Active Sequential Hypothesis Testing with Application to a Visual Search Problem

We consider a visual search problem studied by Sripati and Olson where the objective is to identify an oddball image embedded among multiple distractor images as quickly as possible. We model this visual search task as an active sequential hypothesis testing problem (ASHT problem). Chernoff in 1959 proposed a policy in which the expected delay to decision is asymptotically optimal. The asymptotics is under vanishing error probabilities. We first prove a stronger property on the moments of the delay until a decision, under the same asymptotics. Applying the result to the visual search problem, we then propose a ``neuronal metric'' on the measured neuronal responses that captures the discriminability between images. From empirical study we obtain a remarkable correlation (r = 0.90) between the proposed neuronal metric and speed of discrimination between the images. Although this correlation is lower than with the L-1 metric used by Sripati and Olson, this metric has the advantage of being firmly grounded in formal decision theory.

Rainbow connectivity: hardness and tractability

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be summarised as below: 1) For every fixed k >= 3, it is NP-Complete to decide whether src(G) <= k even when the graph G is bipartite. 2) For every fixed odd k >= 3, it is NP-Complete to decide whether rc(G) <= k. This resolves one of the open problems posed by Chakraborty et al. (J. Comb. Opt., 2011) where they prove the hardness for the even case. 3) The following problem is fixed parameter tractable: Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors. 4) For a directed graph G, it is NP-Complete to decide whether rc(G) <= 2.