Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

Barotropic Instability of the Bickley Jet at High Reynolds Numbers

We investigate the linear stability of the Bickley jet in the framework of the beta-plane approximation. Because singular inviscid neutral modes exist in the retrograde case     , it is necessary to add viscosity to interpret them. One of these modes was found in closed form by Howard and Drazin [1] . However, its critical point is at the center of the jet and it was therefore not possible for these authors to ascertain the relationship of this mode to the stability problem or to discuss how to continue the eigenfunction across the singularity.
The viscous critical layer problem associated with this singularity is considerably more difficult than the usual one (which leads to integrals of the Airy function) because     and, consequently, a second-order turning point is involved. Our analysis shows that the Howard–Drazin mode is degenerate in the domain where it is valid as a limit of the viscous problem (wavenumber  α²≤ 9/2  ), that is, it corresponds to both an odd and an even mode. This conclusion is confirmed by direct numerical solution of the Orr–Sommerfeld equation which shows, in addition, that viscosity is destabilizing along portions of the stability boundary. For a retrograde jet, instability is found to occur beyond the inviscid critical value of β, that is, in the region where the flow would be stable according to the Rayleigh–Kuo condition.     

Modification of the surface state of rough substrates by two different varnishes and influence on the reflected light

Modification of the visual appearance when a rough surface is covered by a varnish is mostly attributed to the levelling of the substrate surface, which depends on the molecular weight of the varnish. The topography of varnished surfaces, however, has never been measured directly. Surfaces of varnishes applied over glass substrates of varying roughness were studied, therefore, using mechanical profilometry. Two different varnishes made with a low and a high molecular weight resin were studied. Both varnishes lower the r.m.s. roughness of the substrates and filter the high spatial frequencies. These results are amplified for the varnish containing the low molecular weight resin. The light reflected by the varnished samples is modelled from these topographical data. Its angular distribution, calculated from the probability density of slopes is presented, taking into account separately the air/varnish and the varnish/substrate interfaces. These analyses are presented in a back-scattering configuration. They show that varnishing significantly reduces the angular width of the reflected light and that this effect is magnified for the low molecular weight resin. Modelling furthermore shows that the influence of the roughness of the varnish/substrate interface is negligible in the total reflected light.     

Kolmogorov Width of Classes of Smooth Functions on the Sphere

Let ^d−1{(x₁,…,x_d) ^d:x²₁+···+x²_d=1} be the unit sphere of the d-dimensional Euclidean space ^d. For r>0, we denote by B^r_p (1p∞) the class of functions f on ^d−1 representable in the formwhere dσ(y) denotes the usual Lebesgue measure on ^d−1, and P^λ_k(t) is the ultraspherical polynomial.For 1p,q∞, the Kolmogorov N-width of B^r_p in L^q( ^d−1) is given bythe left-most infimum being taken over all N-dimensional subspaces X_N of L^q( ^d−1).The main result in this paper is that for r2(d−1)²,where A_NB_N means that there exists a positive constant C, independent of N, such that C⁻¹A_NB_NCA_N.This extends the well-known Kashin theorem on the asymptotic order of the Kolmogorov widths of the Sobolev class of the periodic functions.     

Equilibrium point damage prognosis models for structural health monitoring

Most structural dynamic systems are of high order; however, they often exhibit phenomena that can be dealt with effectively using low order models. This paper presents a method for describing certain kinds of damage evolution in mechanical systems. The method relies on a simple principle that as damage evolves in a structural dynamic system, the damage indicator (i.e., diagnostic feature) behaves like a stable quasi-stationary equilibrium point in a subsidiary non-linear bifurcating system within the so-called damage center manifold. It is shown that just as linear normal modes govern the behavior of linear structures with idealized damping, so too do non-linear normal forms govern the evolution of damage within structures in many instances. The method is justified with citations from the literature on certain types of mechanical failure and then applied in an experimental case involving reversible damage in a bolted fastener. Off-line experiments on a rotorcraft fuselage show that the evolution of damage is sensitive to both temporal and spatial bifurcation parameters. A diagnostic sensing strategy whereby output-only transmissibility features are used to decrease the order of high order structural dynamic measurements is also described.     

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004     

Admissible slopes for monotone and convex interpolation

Summary In many applications, interpolation of experimental data exhibiting some geometric property such as nonnegativity, monotonicity or convexity is unacceptable unless the interpolant reflects these characteristics. This paper identifies admissible slopes at data points of variousC ¹ interpolants which ensure a desirable shape. We discuss this question, in turn for the following function classes commonly used for shape preserving interpolations: monotone polynomials,C ¹ monotone piecewise polynomials, convex polynomials, parametric cubic curves and rational functions.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.