Fatigue Laws Via Functional Equations

In routine industrial design, fatigue life estimation is largely based on S-N curves and ad hoc cycle counting algorithms used with Miner's rule for predicting life under complex loading. However, there are well known deficiencies of the conventional approach. Of the many cumulative damage rules that have been proposed, Manson's Double Linear Damage Rule (DLDR) has been the most successful. Here we follow up, through comparisons with experimental data from many sources, on a new approach to empirical fatigue life estimation (A Constructive Empirical Theory for Metal Fatigue Under Block Cyclic Loading', Proceedings of the Royal Society A, in press). The basic modeling approach is first described: it depends on enforcing mathematical consistency between predictions of simple empirical models that include indeterminate functional forms, and published fatigue data from handbooks. This consistency is enforced through setting up and (with luck) solving a functional equation with three independent variables and six unknown functions. The model, after eliminating or identifying various parameters, retains three fitted parameters; for the experimental data available, one of these may be set to zero. On comparison against data from several different sources, with two fitted parameters, we find that our model works about as well as the DLDR and much better than Miner's rule. We finally discuss some ways in which the model might be used, beyond the scope of the DLDR.

Observers for linear systems with unknown inputs

This paper presents a constructive solution to the problem of designing a reduced-order Luenberger observer for linear systems subject to arbitrary unknown inputs.

Boxicity and maximum degree

A d-dimensional box is a Cartesian product of d closed intervals on the real line. The boxicity of a graph is the minimum dimension d such that it is representable as the intersection graph of d-dimensional boxes. We give a short constructive proof that every graph with maximum degree D has boxicity at most 2D2. We also conjecture that the best upper bound is linear in D.

Splittings of free groups, normal forms and partitions of ends

Splittings of a free group correspond to embedded spheres in the 3-manifold M = # (k) S (2) x S (1). These can be represented in a normal form due to Hatcher. In this paper, we determine the normal form in terms of crossings of partitions of ends corresponding to normal spheres, using a graph of trees representation for normal forms. In particular, we give a constructive proof of a criterion determining when a conjugacy class in pi (2)(M) can be represented by an embedded sphere.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Resonant microwave power absorption in slabs

Resonant microwave power absorption is examined for slabs exposed to TEM waves from both faces and for a slab placed on a reflecting support. Using the electric field distribution in the slab, the average power is obtained by integrating the spatially distributed power across the sample length. Due to constructive interference of the standing waves within the sample, the average power rises to a local maximum during a resonance. Irrespective of the material, resonances occur at integral values of L/lambda(s) when the slab is exposed to radiation from both faces and at L/lambda(s) = 0.5n-0.25 when placed on a reflecting support.

Efficiency enhancement in DSSC using metal nanoparticles: A size dependent study

The photoelectrode of Eosin-Y sensitised DSSC was modified by incorporating Au-nanoparticles to enhance the power conversion efficiency via scattering from surface plasmon polaritons. Size dependence of Au nanoparticle on conversion efficiency was performed in DSSC for the first time by varying the particle size from 20 to 94 nm. It was found that, the conversion efficiency is highly dependent on the size of the Au nanoparticles. For larger particles (>50 nm), the efficiency was found to be increased due to constructive interference between the transmitted and scattered waves from the Au nanoparticle while for smaller particles, the efficiency decreases due to destructive interference. Also a reduction in the V-oc was observed in general, due to the negative shifting of the TiO2 Fermi level on the adsorption of Au nanoparticle. This shift was negligible for larger particles. When 94 nm size particles were employed the conversion efficiency was doubled from 0.74% to 1.52%. This study points towards the application of the scattering effect of metal nanoparticle to enhance the conversion efficiency in DSSCs. (C) 2011 Elsevier Ltd. All rights reserved.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

REDUCED ORDER MODELLING OF COMBUSTION INSTABILITY IN A BACKWARD FACING STEP COMBUSTOR

This paper develops a fully coupled time domain Reduced Order Modelling (ROM) approach to model unsteady combustion dynamics in a backward facing step combustor The acoustic field equations are projected onto the canonical acoustic eigenmodes of the systems to obtain a coupled system of modal evolution equations. The heat release response of the flame is modelled using the G-equation approach. Vortical velocity fluctuations that arise due to shear layer rollup downstream of the step are modelled using a simplified 1D-advection equation whose phase speed is determined from a linear, local, temporal stability analysis of the shear layer just downstream of the step. The hydrodynamic stability analysis reveals a abrupt change in the value of disturbance phase speed from unity for Re < Re-crit to 0.5 for Re > Re-crit, where Remit for the present geometry was found to be approximate to 10425. The results for self-excited flame response show highly wrinkled flame shapes that are qualitatively similar to those seen in prior experiments of acoustically forced flames. The effect of constructive and destructive interference between the two contributions to flame surface wrinkling results in high amplitude wrinkles for the case when K-c -> 1.

Anonymous Authentication with Shared Secrets

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. message authentication). Yet, on the other hand privacy concerns also dictate that anonymity of a legitimate party should be preserved; that is no information concerning the identity of parties should be leaked to an outside entity eavesdropping on the communication. This conflict becomes even more acute when considering anonymity with respect to an active entity that may attempt to impersonate other parties in the system. In this work we resolve this conflict in two steps. First we formalize what it means for a system to provide both authenticity and anonymity even in the presence of an active man-in-the-middle adversary for various specific applications such as message and entity authentication using the constructive cryptography framework of Mau11, MR11]. Our approach inherits the composability statement of constructive cryptography and can therefore be directly used in any higher-level context. Next we demonstrate several simple protocols for realizing these systems, at times relying on a new type of (probabilistic) Message Authentication Code (MAC) called key indistinguishable (KI) MACs. Similar to the key hiding encryption schemes of BBDP01] they guarantee that tags leak no discernible information about the keys used to generate them.