The application of parallel processing methods to vibrational analysis

The trend in modal extraction algorithms is to use all the available frequency response functions data to obtain a global estimate of the natural frequencies, damping ratio and mode shapes. Improvements in transducer and signal processing technology allow the simultaneous measurement of many hundreds of channels of response data. The quantity of data available and the complexity of the extraction algorithms make considerable demands on the available computer power and require a powerful computer or dedicated workstation to perform satisfactorily. An alternative to waiting for faster sequential processors is to implement the algorithm in parallel, for example on a network of Transputers. Parallel architectures are a cost effective means of increasing computational power, and a larger number of response channels would simply require more processors. This thesis considers how two typical modal extraction algorithms, the Rational Fraction Polynomial method and the Ibrahim Time Domain method, may be implemented on a network of transputers. The Rational Fraction Polynomial Method is a well known and robust frequency domain 'curve fitting' algorithm. The Ibrahim Time Domain method is an efficient algorithm that 'curve fits' in the time domain. This thesis reviews the algorithms, considers the problems involved in a parallel implementation, and shows how they were implemented on a real Transputer network.

Time complexity and convergence analysis of domain theoretic Picard method

We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.

A method of fundamental solutions for transient heat conduction

In this paper we investigate an application of the method of fundamental solutions (MFS) to transient heat conduction. In almost all of the previously proposed MFS for time-dependent heat conduction the fictitious sources are located outside the time-interval of interest. In our case, however, these sources are instead placed outside the space domain of interest in the same manner as is done for stationary heat conduction. A denseness result for this method is discussed and the method is numerically tested showing that accurate numerical results can be obtained. Furthermore, a test example with boundary singularities shows that it is advisable to remove such singularities before applying the MFS.

An integral equation method for a mixed initial boundary value problem for unsteady Stokes system in a doubly-connected domain

We present a novel numerical method for a mixed initial boundary value problem for the unsteady Stokes system in a planar doubly-connected domain. Using a Laguerre transformation the unsteady problem is reduced to a system of boundary value problems for the Stokes resolvent equations. Employing a modied potential approach we obtain a system of boundary integral equations with various singularities and we use a trigonometric quadrature method for their numerical solution. Numerical examples are presented showing that accurate approximations can be obtained with low computational cost.

Independent component analysis for domain independent watermarking

A new principled domain independent watermarking framework is presented. The new approach is based on embedding the message in statistically independent sources of the covertext to mimimise covertext distortion, maximise the information embedding rate and improve the method's robustness against various attacks. Experiments comparing the performance of the new approach, on several standard attacks show the current proposed approach to be competitive with other state of the art domain-specific methods.

Grayscale and colour image Codec based on matching pursuit in the spatio-frequency domain

This report presents and evaluates a novel idea for scalable lossy colour image coding with Matching Pursuit (MP) performed in a transform domain. The benefits of the idea of MP performed in the transform domain are analysed in detail. The main contribution of this work is extending MP with wavelets to colour coding and proposing a coding method. We exploit correlations between image subbands after wavelet transformation in RGB colour space. Then, a new and simple quantisation and coding scheme of colour MP decomposition based on Run Length Encoding (RLE), inspired by the idea of coding indexes in relational databases, is applied. As a final coding step arithmetic coding is used assuming uniform distributions of MP atom parameters. The target application is compression at low and medium bit-rates. Coding performance is compared to JPEG 2000 showing the potential to outperform the latter with more sophisticated than uniform data models for arithmetic coder. The results are presented for grayscale and colour coding of 12 standard test images.

Time domain all-optical nonlinear signal processing to enhance the performance of a RZ receiver

We have proposed a new technique of all-optical nonlinear pulse processing for use at a RZ optical receiver, which is based on an AM or any device with a similar function of temporal gating/slicing enhanced by the effect of Kerr nonlinearity in a NDF. The efficiency of the technique has been demonstrated by application to timing jitter and noise-limited RZ transmission at 40 Gbit/s. Substantial suppression of the signal timing jitter and overall improvement of the receiver performance has been demonstrated using the proposed method.

A method of fundamental solutions for two-dimensional heat conduction

We investigate an application of the method of fundamental solutions (MFS) to heat conduction in two-dimensional bodies, where the thermal diffusivity is piecewise constant. We extend the MFS proposed in Johansson and Lesnic [A method of fundamental solutions for transient heat conduction, Eng. Anal. Bound. Elem. 32 (2008), pp. 697–703] for one-dimensional heat conduction with the sources placed outside the space domain of interest, to the two-dimensional setting. Theoretical properties of the method, as well as numerical investigations, are included, showing that accurate results can be obtained efficiently with small computational cost.

A method of fundamental solutions for the one-dimensional inverse Stefan problem

We investigate an application of the method of fundamental solutions (MFS) to the one-dimensional inverse Stefan problem for the heat equation by extending the MFS proposed in [5] for the one-dimensional direct Stefan problem. The sources are placed outside the space domain of interest and in the time interval (-T, T). Theoretical properties of the method, as well as numerical investigations, are included, showing that accurate and stable results can be obtained efficiently with small computational cost.

A comparative study on applying the method of fundamental solutions to the backward heat conduction problem

We investigate an application of the method of fundamental solutions (MFS) to the backward heat conduction problem (BHCP). We extend the MFS in Johansson and Lesnic (2008) [5] and Johansson et al. (in press) [6] proposed for one and two-dimensional direct heat conduction problems, respectively, with the sources placed outside the space domain of interest. Theoretical properties of the method, as well as numerical investigations, are included, showing that accurate and stable results can be obtained efficiently with small computational cost.

A variational method and approximations of a Cauchy problem for elliptic equations

A Cauchy problem for general elliptic second-order linear partial differential equations in which the Dirichlet data in H½(?1 ? ?3) is assumed available on a larger part of the boundary ? of the bounded domain O than the boundary portion ?1 on which the Neumann data is prescribed, is investigated using a conjugate gradient method. We obtain an approximation to the solution of the Cauchy problem by minimizing a certain discrete functional and interpolating using the finite diference or boundary element method. The minimization involves solving equations obtained by discretising mixed boundary value problems for the same operator and its adjoint. It is proved that the solution of the discretised optimization problem converges to the continuous one, as the mesh size tends to zero. Numerical results are presented and discussed.

A method of fundamental solutions for transient heat conduction in layered materials

In this paper we investigate an application of the method of fundamental solutions (MFS) to transient heat conduction in layered materials, where the thermal diffusivity is piecewise constant. Recently, in Johansson and Lesnic [A method of fundamental solutions for transient heat conduction. Eng Anal Boundary Elem 2008;32:697–703], a MFS was proposed with the sources placed outside the space domain of interest, and we extend that technique to numerically approximate the heat flow in layered materials. Theoretical properties of the method, as well as numerical investigations are included.

An alternating potential based approach for a Cauchy problem for the Laplace equation in a planar domain with a cut

We consider a Cauchy problem for the Laplace equation in a bounded region containing a cut, where the region is formed by removing a sufficiently smooth arc (the cut) from a bounded simply connected domain D. The aim is to reconstruct the solution on the cut from the values of the solution and its normal derivative on the boundary of the domain D. We propose an alternating iterative method which involves solving direct mixed problems for the Laplace operator in the same region. These mixed problems have either a Dirichlet or a Neumann boundary condition imposed on the cut and are solved by a potential approach. Each of these mixed problems is reduced to a system of integral equations of the first kind with logarithmic and hypersingular kernels and at most a square root singularity in the densities at the endpoints of the cut. The full discretization of the direct problems is realized by a trigonometric quadrature method which has super-algebraic convergence. The numerical examples presented illustrate the feasibility of the proposed method.

Recovering boundary data in planar heat conduction using boundary integral equation method

We consider a Cauchy problem for the heat equation, where the temperature field is to be reconstructed from the temperature and heat flux given on a part of the boundary of the solution domain. We employ a Landweber type method proposed in [2], where a sequence of mixed well-posed problems are solved at each iteration step to obtain a stable approximation to the original Cauchy problem. We develop an efficient boundary integral equation method for the numerical solution of these mixed problems, based on the method of Rothe. Numerical examples are presented both with exact and noisy data, showing the efficiency and stability of the proposed procedure and approximations.

Governance of open content creation:a conceptualization and analysis of control and guiding mechanisms in the open content domain

The open content creation process has proven itself to be a powerful and influential way of developing text-based content, as demonstrated by the success of Wikipedia and related sites. Distributed individuals independently edit, revise, or refine content, thereby creating knowledge artifacts of considerable breadth and quality. Our study explores the mechanisms that control and guide the content creation process and develops an understanding of open content governance. The repertory grid method is employed to systematically capture the experiences of individuals involved in the open content creation process and to determine the relative importance of the diverse control and guiding mechanisms. Our findings illustrate the important control and guiding mechanisms and highlight the multifaceted nature of open content governance. A range of governance mechanisms is discussed with regard to the varied levels of formality, the different loci of authority, and the diverse interaction environments involved. Limitations and opportunities for future research are provided.