Fatigue crack initiation and propagation from defects in aluminium welds

Fatigue crack initiation and propagation in aluminium butt welds has been investigated. It is shown that the initiation of cracks from both buried defects and. from the weld reinforcement may be quantified by predictive laws based on either linear elastic fracture mechanics, or on Neuber's rule of stress and strain ooncentrations. The former is preferable on the grounds of theoretical models of crack tip plasticity, although either may be used as the basis of an effeotive design criteria against crack initiation. Fatigue lives fol1owing initiation were found to follow predictions based on the integration of a Paris type power law. The effect of residual stresses from the welding operation on both initiation and propagation was accounted for by a Forman type equation. This incorporated the notional stress ratio produced by the residual stresses after various heat treatments. A fracture mechanics analysis was found to be useful in describing the fatigue behaviour of the weldments at increased temperatures up to 300°C. It is pointed out, however, that the complex interaction of residual stresses, frequency, and changes in fracture mode necessitate great caution in the application of any general design criteria against crack initiation and growth at elevated. temperatures.

Palette-colouring: a belief propagation approach

We consider a variation of the prototype combinatorial optimization problem known as graph colouring. Our optimization goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximize the number of different colours present in the set of nearest neighbours of each given vertex. This problem, which we pictorially call palette-colouring, has been recently addressed as a basic example of a problem arising in the context of distributed data storage. Even though it has not been proved to be NP-complete, random search algorithms find the problem hard to solve. Heuristics based on a naive belief propagation algorithm are observed to work quite well in certain conditions. In this paper, we build upon the mentioned result, working out the correct belief propagation algorithm, which needs to take into account the many-body nature of the constraints present in this problem. This method improves the naive belief propagation approach at the cost of increased computational effort. We also investigate the emergence of a satisfiable-to-unsatisfiable 'phase transition' as a function of the vertex mean degree, for different ensembles of sparse random graphs in the large size ('thermodynamic') limit.

Proposal and design of airy-based rocket pulses for invariant propagation in lossy dispersive media

A novel kind of Airy-based pulse with an invariant propagation in lossy dispersive media is proposed. The basic principle is based on an optical energy trade-off between different parts of the pulse caused by the chromatic dispersion, which is used to compensate the attenuation losses of the propagation medium. Although the ideal concept of the proposed pulses implies infinite pulse energy, the numerical simulations show that practical finite energy pulses can be designed to obtain a partially invariant propagation over a finite distance of propagation.

Using min-sum loopy belief propagation for decentralised supply chain formation

Modern business trends such as agile manufacturing and virtual corporations require high levels of flexibility and responsiveness to consumer demand, and require the ability to quickly and efficiently select trading partners. Automated computational techniques for supply chain formation have the potential to provide significant advantages in terms of speed and efficiency over the traditional manual approach to partner selection. Automated supply chain formation is the process of determining the participants within a supply chain and the terms of the exchanges made between these participants. In this thesis we present an automated technique for supply chain formation based upon the min-sum loopy belief propagation algorithm (LBP). LBP is a decentralised and distributed message-passing algorithm which allows participants to share their beliefs about the optimal structure of the supply chain based upon their costs, capabilities and requirements. We propose a novel framework for the application of LBP to the existing state-of-the-art case of the decentralised supply chain formation problem, and extend this framework to allow for application to further novel and established problem cases. Specifically, the contributions made by this thesis are: • A novel framework to allow for the application of LBP to the decentralised supply chain formation scenario investigated using the current state-of-the-art approach. Our experimental analysis indicates that LBP is able to match or outperform this approach for the vast majority of problem instances tested. • A new solution goal for supply chain formation in which economically motivated producers aim to maximise their profits by intelligently altering their profit margins. We propose a rational pricing strategy that allows producers to earn significantly greater profits than a comparable LBP-based profitmaking approach. • An LBP-based framework which allows the algorithm to be used to solve supply chain formation problems in which goods are exchanged in multiple units, a first for a fully decentralised technique. As well as multiple-unit exchanges, we also model in this scenario realistic constraints such as factory capacities and input-to-output ratios. LBP continues to be able to match or outperform an extended version of the existing state-of-the-art approach in this scenario. • Introduction of a dynamic supply chain formation scenario in which participants are able to alter their properties or to enter or leave the process at any time. Our results suggest that LBP is able to deal easily with individual occurences of these alterations and that performance degrades gracefully when they occur in larger numbers.

Band-limited airy pulses for invariant propagation in single mode fibers

By spectral analysis, and using joint time-frequency representations, we present the theoretical basis to design invariant band-limited Airy pulses with an arbitrary degree of robustness, and an arbitrary range of single mode fiber chromatic dispersion. The numerically simulated examples confirm the theoretically predicted pulse partial invariance in the propagation of the pulse in the fiber.

Decentralised supply chain formation:a belief propagation-based approach

Decentralised supply chain formation involves determining the set of producers within a network able to supply goods to one or more consumers at the lowest cost. This problem is frequently tackled using auctions and negotiations. In this paper we show how it can be cast as an optimisation of a pairwise cost function. Optimising this class of functions is NP-hard but good approximations to the global minimum can be obtained using Loopy Belief Propagation (LBP). Here we detail a LBP-based approach to the supply chain formation problem, involving decentralised message-passing between potential participants. Our approach is evaluated against a well-known double-auction method and an optimal centralised technique, showing several improvements: it obtains better solutions for most networks that admit a competitive equilibrium Competitive equilibrium as defined in [3] is used as a means of classifying results on certain networks to allow for minor inefficiencies in their auction protocol and agent bidding strategies. while also solving problems where no competitive equilibrium exists, for which the double-auction method frequently produces inefficient solutions.

Compensation of intra-channel nonlinear fibre impairments using simplified digital back-propagation algorithm

We investigate a digital back-propagation simplification method to enable computationally-efficient digital nonlinearity compensation for a coherently-detected 112 Gb/s polarization multiplexed quadrature phase shifted keying transmission over a 1,600 km link (20x80km) with no inline compensation. Through numerical simulation, we report up to 80% reduction in required back-propagation steps to perform nonlinear compensation, in comparison to the standard back-propagation algorithm. This method takes into account the correlation between adjacent symbols at a given instant using a weighted-average approach, and optimization of the position of nonlinear compensator stage to enable practical digital back-propagation.

Impact of longitudinal power budget in coherent transmission systems employing digital back-propagation

We report the impact of longitudinal signal power profile on the transmission performance of coherently-detected 112 Gb/s m-ary polarization multiplexed quadrature amplitude modulation system after compensation of deterministic nonlinear fibre impairments. Performance improvements up to 0.6 dB (Q(eff)) are reported for a non-uniform transmission link power profile. Further investigation reveals that the evolution of the transmission performance with power profile management is fully consistent with the parametric amplification of the amplified spontaneous emission by the signal through four-wave mixing. In particular, for a non-dispersion managed system, a single-step increment of 4 dB in the amplifier gain, with respect to a uniform gain profile, at similar to 2/3(rd) of the total reach considerably improves the transmission performance for all the formats studied. In contrary a negative-step profile, emulating a failure (gain decrease or loss increase), significantly degrades the bit-error rate.

Polarization multiplexed 16QAM transmission employing modified digital back-propagation

We experimentally demonstrate performance enhancements enabled by weighted digital back propagation method for 28 Gbaud PM-16QAM transmission systems, over a 250 km ultra-large area fibre, using only one back-propagation step for the entire link, enabling up to 3 dB improvement in power tolerance with respect to linear compensation only. We observe that this is roughly the same improvement that can be obtained with the conventional, computationally heavy, non-weighted digital back propagation compensation with one step per span. As a further benchmark, we analyze performance improvement as a function of number of steps, and show that the performance improvement saturates at approximately 20 steps per span, at which a 5 dB improvement in power tolerance is obtained with respect to linear compensation only. Furthermore, we show that coarse-step self-phase modulation compensation is inefficient in wavelength division multiplexed transmission.

Impact of signal-ASE four-wave mixing on the effectiveness of digital back-propagation in 112 Gb/s PM-QPSK systems

Limitations in the performance of coherent transmission systems employing digital back-propagation due to four-wave mixing impairments are reported for the first time. A significant performance constraint is identified, originating from four-wave mixing between signals and amplified spontaneous emission noise which induces a linear increase in the standard deviation of the received field with signal power, and linear dependence on transmission distance.

Digital back-propagation for spectrally efficient WDM 112 Gbit/s PM m-ary QAM transmission

We report the performance of coherently-detected nine-channel WDM transmission over high dispersion fibers, using polarization multiplexed m-ary quadrature amplitude modulation (m = 4, 16, 64, 256) at 112 Gbit/s. Compensation of fiber nonlinearities via digital back-propagation enables up to 10 dB improvement in maximum transmittable power and similar to 8 dB Q(eff) improvement which translates to a nine-fold enhancement in transmission reach for PM-256QAM, where the largest improvements are associated with higher-order modulation formats. We further demonstrate that even under strong nonlinear distortion the transmission reach only reduces by a factor of similar to 2.5 for a 2 unit increase in capacity (log(2)m) when full band DBP is employed, in proportion to the required back-to-back OSNR.