DSpace Community:
http://hdl.handle.net/2381/445
Sat, 04 Jul 2015 07:17:37 GMT
20150704T07:17:37Z
DSpace Community:
http://lra.le.ac.uk:80/retrieve/2392/mathsequation.jpg
http://hdl.handle.net/2381/445

Inequalities and eigenvalues of SturmLiouville problems near a singular boundary
http://hdl.handle.net/2381/32450
Title: Inequalities and eigenvalues of SturmLiouville problems near a singular boundary
Authors: Marletta, Marco; Everitt, W. N.; Zettl, A.
Abstract: We study the behavior of eigenvalues of SturmLiouville problems (SLP) when an endpoint of the underlying interval approaches a singularity.
Tue, 30 Jun 2015 09:16:49 GMT
http://hdl.handle.net/2381/32450
20150630T09:16:49Z

Model Reductions in Biochemical Reaction Networks
http://hdl.handle.net/2381/32442
Title: Model Reductions in Biochemical Reaction Networks
Authors: Khoshnaw, Sarbaz Hamza Abdullah
Abstract: Many complex kinetic models in the field of biochemical reactions
contain a large number of species and reactions. These models often require a
huge array of computational tools to analyse. Techniques of model reduction,
which arise in various theoretical and practical applications in systems biology,
represent key critical elements (variables and parameters) and substructures of
the original system. This thesis aims to study methods of model reduction for
biochemical reaction networks. It has three goals related to techniques of model
reduction. The primary goal provides analytical approximate solutions of such
models. In order to have this set of solutions, we propose an algorithm based on
the Duhamel iterates. This algorithm is an explicit formula that can be studied in
detail for wide regions of concentrations for optimization and parameter identification
purposes. Another goal is to simplify high dimensional models to smaller
sizes in which the dynamics of original models and reduced models should be
similar. Therefore, we have developed some techniques of model reduction such
as geometric singular perturbation method for slow and fast subsystems, and
entropy production analysis for identifying non–important reactions. The suggested
techniques can be applied to some models in systems biology including
enzymatic reactions, elongation factors EF–Tu and EF–Ts signalling pathways,
and nuclear receptor signalling. Calculating the value of deviation at each reduction
stage helps to check that the approximation of concentrations is still within
the allowable limits. The final goal is to identify critical model parameters and
variables for reduced models. We study the methods of local sensitivity in order
to find the critical model elements. The results are obtained in numerical simulations
based on Systems Biology Toolbox (SBToolbox) and SimBiology Toolbox for
Matlab. The simplified models would be accurate, robust, and easily applied by
biologists for various purposes such as reproducing biological data and functions
for the full models.
Mon, 29 Jun 2015 14:29:24 GMT
http://hdl.handle.net/2381/32442
20150629T14:29:24Z

Approximation with Random Bases: Pro et Contra
http://hdl.handle.net/2381/32428
Title: Approximation with Random Bases: Pro et Contra
Authors: Gorban, Alexander N.; Tyukin, Ivan Yu.; Prokhorov, D. V.; Sofeikov, Konstantin I.
Abstract: In this work we discuss the problem of selecting suitable approximators from families of parameterized elementary functions that are known to be dense in a Hilbert space of functions. We consider and analyze published procedures, both randomized and deterministic, for selecting elements from these families that have been shown to ensure the rate of convergence in $L_2$ norm of order $O(1/N)$, where $N$ is the number of elements. We show that both strategies are successful providing that additional information about the families of functions to be approximated is provided at the stages of learning and practical implementation. In absence of such additional information one may observe exponential growth of the number of terms needed to approximate the function and/or extreme sensitivity of the outcome of the approximation to parameters. Implications of our analysis for applications of neural networks in modeling and control are illustrated with examples.
Description: arXiv admin note: text overlap with arXiv:0905.0677 MSC classes: 41A45, 41A45, 90C59, 92B20, 68W20
Fri, 26 Jun 2015 09:00:01 GMT
http://hdl.handle.net/2381/32428
20150626T09:00:01Z

Derivative pricing in lévy driven models
http://hdl.handle.net/2381/32222
Title: Derivative pricing in lévy driven models
Authors: Kushpel, Alexander
Abstract: We consider an important class of derivative contracts written on multiple assets
which are traded on a wide range of financial markets. More specifically, we are
interested in developing novel methods for pricing financial derivatives using approximation
theoretic methods which are not wellknown to the financial engineering
community. The problem of pricing of such contracts splits into two parts.
First, we need to approximate the respective density function which depends on the
adapted jumpdiffusion model. Second, we need to construct a sequence of approximation
formulas for the price. These two parts are connected with the problem of
optimal approximation of infinitely differentiable, analytic or entire functions on
noncompact domains. We develop new methods of recovery of density functions
using sksplines (in particular, radial basis functions), Wiener spaces and complex
exponents with frequencies from special domains. The respective lower bounds obtained
show that the methods developed have almost optimal rate of convergence
in the sense of nwidths. On the basis of results obtained we develop a new theory
of pricing of basket options under Lévy processess. In particular, we introduce
and study a class of stochastic systems to model multidimensional return process,
construct a sequence of approximation formulas for the price and establish the
respective rates of convergence.
Thu, 07 May 2015 13:45:04 GMT
http://hdl.handle.net/2381/32222
20150507T13:45:04Z

Leaders do not look back, or do they?
http://hdl.handle.net/2381/32211
Title: Leaders do not look back, or do they?
Authors: Gorban, A. N.; Jarman, N.; Steur, E.; van Leeuwen, C.; Tyukin, I.
Editors: Volpert, V.
Abstract: We study the effect of adding to a directed chain of interconnected systems a
directed feedback from the last element in the chain to the first. The problem is closely related
to the fundamental question of how a change in network topology may influence the behavior of
coupled systems. We begin the analysis by investigating a simple linear system. The matrix that
specifies the system dynamics is the transpose of the network Laplacian matrix, which codes
the connectivity of the network. Our analysis shows that for any nonzero complex eigenvalue λ
of this matrix, the following inequality holds: ℑλ
ℜλ ≤ cot π
n
. This bound is sharp, as it becomes
an equality for an eigenvalue of a simple directed cycle with uniform interaction weights. The
latter has the slowest decay of oscillations among all other network configurations with the same
number of states. The result is generalized to directed rings and chains of identical nonlinear
oscillators. For directed rings, a lower bound σc for the connection strengths that guarantees
asymptotic synchronization is found to follow a similar pattern: σc =
1
1−cos(2π/n)
. Numerical
analysis revealed that, depending on the network size n, multiple dynamic regimes coexist in
the state space of the system. In addition to the fully synchronous state a rotating wave solution
occurs. The effect is observed in networks exceeding a certain critical size. The emergence of a
rotating wave highlights the importance of long chains and loops in networks of oscillators: the
larger the size of chains and loops, the more sensitive the network dynamics becomes to removal
or addition of a single connection.
Description: Mathematics Subject Classification: 34A30, 34D06, 34D45, 92B20, 92B25
Thu, 07 May 2015 11:08:33 GMT
http://hdl.handle.net/2381/32211
20150507T11:08:33Z

The center of a convex set and capital allocation
http://hdl.handle.net/2381/32091
Title: The center of a convex set and capital allocation
Authors: Grechuk, Bogdan
Abstract: A capital allocation scheme for a company that has a random total profit Y and uses a coherent risk measure ρ has been suggested. The scheme returns a unique real number Λρ*(X,Y), which determines the capital that should be allocated to company’s subsidiary with random profit X. The resulting capital allocation is linear and diversifying as defined by Kalkbrener (2005). The problem is reduced to selecting the “center” of a nonempty convex weakly compact subset of a Banach space, and the solution to the latter problem proposed by Lim (1981) has been used. Our scheme can also be applied to selecting the unique Pareto optimal allocation in a wide class of optimal risk sharing problems.
Thu, 30 Apr 2015 14:53:03 GMT
http://hdl.handle.net/2381/32091
20150430T14:53:03Z

Computational diagnosis of canine lymphoma
http://hdl.handle.net/2381/32072
Title: Computational diagnosis of canine lymphoma
Authors: Mirkes, E. M.; Alexandrakis, I.; Slater, K.; Tuli, R.; Gorban, A. N.
Editors: Vagenas, E. C.; Vlachos, D. S.
Abstract: One out of four dogs will develop cancer in their lifetime and 20% of those will be lymphoma cases. PetScreen developed a lymphoma blood test using serum samples collected from several veterinary practices. The samples were fractionated and analysed by mass spectrometry. Two protein peaks, with the highest diagnostic power, were selected and further identified as acute phase proteins, CReactive Protein and Haptoglobin. Data mining methods were then applied to the collected data for the development of an online computerassisted veterinary diagnostic tool. The generated software can be used as a diagnostic, monitoring and screening tool. Initially, the diagnosis of lymphoma was formulated as a classification problem and then later refined as a lymphoma risk estimation. Three methods, decision trees, kNN and probability density evaluation, were used for classification and risk estimation and several preprocessing approaches were implemented to create the diagnostic system. For the differential diagnosis the best solution gave a sensitivity and specificity of 83.5% and 77%, respectively (using three input features, CRP, Haptoglobin and standard clinical symptom). For the screening task, the decision tree method provided the best result, with sensitivity and specificity of 81.4% and >99%, respectively (using the same input features). Furthermore, the development and application of new techniques for the generation of risk maps allowed their userfriendly visualization.
Mon, 27 Apr 2015 14:00:05 GMT
http://hdl.handle.net/2381/32072
20150427T14:00:05Z

Adaptive discontinuous Galerkin methods for nonlinear parabolic problems
http://hdl.handle.net/2381/32041
Title: Adaptive discontinuous Galerkin methods for nonlinear parabolic problems
Authors: Metcalfe, Stephen Arthur
Abstract: This work is devoted to the study of a posteriori error estimation and adaptivity
in parabolic problems with a particular focus on spatial discontinuous Galerkin
(dG) discretisations.
We begin by deriving an a posteriori error estimator for a linear nonstationary
convectiondiffusion problem that is discretised with a backward Euler dG method.
An adaptive algorithm is then proposed to utilise the error estimator. The
effectiveness of both the error estimator and the proposed algorithm is shown
through a series of numerical experiments.
Moving on to nonlinear problems, we investigate the numerical approximation
of blowup. To begin this study, we first look at the numerical approximation
of blowup in nonlinear ODEs through standard time stepping schemes. We
then derive an a posteriori error estimator for an implicitexplicit (IMEX) dG
discretisation of a semilinear parabolic PDE with quadratic nonlinearity. An
adaptive algorithm is proposed that uses the error estimator to approach the
blowup time. The adaptive algorithm is then applied in a series of test cases to
gauge the effectiveness of the error estimator.
Finally, we consider the adaptive numerical approximation of a nonlinear
interface problem that is used to model the mass transfer of solutes through
semipermiable membranes. An a posteriori error estimator is proposed for the
IMEX dG discretisation of the model and its effectiveness tested through a series
of numerical experiments.
Wed, 22 Apr 2015 14:56:10 GMT
http://hdl.handle.net/2381/32041
20150422T14:56:10Z

Is it possible to predict longterm success with kNN? Case study of four market indices (FTSE100, DAX, HANGSENG, NASDAQ)
http://hdl.handle.net/2381/32035
Title: Is it possible to predict longterm success with kNN? Case study of four market indices (FTSE100, DAX, HANGSENG, NASDAQ)
Authors: Shi, Y.; Gorban, A. N.; Yang, T. Y.
Editors: Vagenas, E. C.; Vlachos, D. S.
Abstract: This case study tests the possibility of prediction for 'success' (or 'winner') components of four stock & shares market indices in a time period of three years from 02Jul2009 to 29Jun2012.We compare their performance ain two time frames: initial frame three months at the beginning (02/06/200930/09/2009) and the final three month frame (02/04/201229/06/2012).To label the components, average price ratio between two time frames in descending order is computed. The average price ratio is defined as the ratio between the mean prices of the beginning and final time period. The 'winner' components are referred to the top one third of total components in the same order as average price ratio it means the mean price of final time period is relatively higher than the beginning time period. The 'loser' components are referred to the last one third of total components in the same order as they have higher mean prices of beginning time period. We analyse, is there any information about the winnerlooser separation in the initial fragments of the daily closing prices logreturns time series.The LeaveOneOut CrossValidation with kNN algorithm is applied on the daily logreturn of components using a distance and proximity in the experiment. By looking at the error analysis, it shows that for HANGSENG and DAX index, there are clear signs of possibility to evaluate the probability of longterm success. The correlation distance matrix histograms and 2D/3D elastic maps generated from ViDaExpert show that the 'winner' components are closer to each other and 'winner'/'loser' components are separable on elastic maps for HANGSENG and DAX index while for the negative possibility indices, there is no sign of separation.
Tue, 21 Apr 2015 14:32:46 GMT
http://hdl.handle.net/2381/32035
20150421T14:32:46Z

Multiscale principal component analysis
http://hdl.handle.net/2381/32009
Title: Multiscale principal component analysis
Authors: Akinduko, A. A.; Gorban, Alexander N.
Editors: Vagenas, E. C.; Vlachos, D. S.
Abstract: Principal component analysis (PCA) is an important tool in exploring data. The conventional approach to PCA leads to a solution which favours the structures with large variances. This is sensitive to outliers and could obfuscate interesting underlying structures. One of the equivalent definitions of PCA is that it seeks the subspaces that maximize the sum of squared pairwise distances between data projections. This definition opens up more flexibility in the analysis of principal components which is useful in enhancing PCA. In this paper we introduce scales into PCA by maximizing only the sum of pairwise distances between projections for pairs of datapoints with distances within a chosen interval of values [l,u]. The resulting principal component decompositions in Multiscale PCA depend on point (l,u) on the plane and for each point we define projectors onto principal components. Cluster analysis of these projectors reveals the structures in the data at various scales. Each structure is described by the eigenvectors at the medoid point of the cluster which represent the structure. We also use the distortion of projections as a criterion for choosing an appropriate scale especially for data with outliers. This method was tested on both artificial distribution of data and real data. For data with multiscale structures, the method was able to reveal the different structures of the data and also to reduce the effect of outliers in the principal component analysis.
Thu, 16 Apr 2015 13:57:07 GMT
http://hdl.handle.net/2381/32009
20150416T13:57:07Z

Multiscale approach to pest insect monitoring: Random walks, pattern formation, synchronization, and networks
http://hdl.handle.net/2381/31970
Title: Multiscale approach to pest insect monitoring: Random walks, pattern formation, synchronization, and networks
Authors: Petrovskii, Sergei; Petrovskaya, N.; Bearup, Daniel
Abstract: Pest insects pose a significant threat to food production worldwide resulting in annual losses worth hundreds of billions of dollars. Pest control attempts to prevent pest outbreaks that could otherwise destroy a sward. It is good practice in integrated pest management to recommend control actions (usually pesticides application) only when the pest density exceeds a certain threshold. Accurate estimation of pest population density in ecosystems, especially in agroecosystems, is therefore very important, and this is the overall goal of the pest insect monitoring. However, this is a complex and challenging task; providing accurate information about pest abundance is hardly possible without taking into account the complexity of ecosystems' dynamics, in particular, the existence of multiple scales. In the case of pest insects, monitoring has three different spatial scales, each of them having their own scalespecific goal and their own approaches to data collection and interpretation. In this paper, we review recent progress in mathematical models and methods applied at each of these scales and show how it helps to improve the accuracy and robustness of pest population density estimation.
Fri, 10 Apr 2015 08:44:10 GMT
http://hdl.handle.net/2381/31970
20150410T08:44:10Z

Some analytical and numerical approaches to understanding trap counts resulting from pest insect immigration.
http://hdl.handle.net/2381/31969
Title: Some analytical and numerical approaches to understanding trap counts resulting from pest insect immigration.
Authors: Bearup, D.; Petrovskaya, N.; Petrovskii, Sergei
Abstract: Monitoring of pest insects is an important part of the integrated pest management. It aims to provide information about pest insect abundance at a given location. This includes data collection, usually using traps, and their subsequent analysis and/or interpretation. However, interpretation of trap count (number of insects caught over a fixed time) remains a challenging problem. First, an increase in either the population density or insects activity can result in a similar increase in the number of insects trapped (the so called "activitydensity" problem). Second, a genuine increase of the local population density can be attributed to qualitatively different ecological mechanisms such as multiplication or immigration. Identification of the true factor causing an increase in trap count is important as different mechanisms require different control strategies. In this paper, we consider a meanfield mathematical model of insect trapping based on the diffusion equation. Although the diffusion equation is a wellstudied model, its analytical solution in closed form is actually available only for a few special cases, whilst in a more general case the problem has to be solved numerically. We choose finite differences as the baseline numerical method and show that numerical solution of the problem, especially in the realistic 2D case, is not at all straightforward as it requires a sufficiently accurate approximation of the diffusion fluxes. Once the numerical method is justified and tested, we apply it to the corresponding boundary problem where different types of boundary forcing describe different scenarios of pest insect immigration and reveal the corresponding patterns in the trap count growth.
Fri, 10 Apr 2015 08:35:29 GMT
http://hdl.handle.net/2381/31969
20150410T08:35:29Z

Are time delays always destabilizing? Revisiting the role of time delays and the Allee effect
http://hdl.handle.net/2381/31968
Title: Are time delays always destabilizing? Revisiting the role of time delays and the Allee effect
Authors: Jankovic, Masha; Petrovskii, Sergei
Abstract: One of the main challenges in ecology is to determine the cause of population fluctuations. Both theoretical and empirical studies suggest that delayed density dependence instigates cyclic behavior in many populations; however, underlying mechanisms through which this occurs are often difficult to determine and may vary within species. In this paper, we consider single species population dynamics affected by the Allee effect coupled with discrete time delay. We use two different mathematical formulations of the Allee effect and analyze (both analytically and numerically) the role of time delay in different feedback mechanisms such as competition and cooperation. The bifurcation value of the delay (that results in the Hopf bifurcation) as a function of the strength of the Allee effect is obtained analytically. Interestingly, depending on the chosen delayed mechanism, even a large time delay may not necessarily lead to instability. We also show that, in case the time delay affects positive feedback (such as cooperation), the population dynamics can lead to selforganized formation of intermediate quasistationary states. Finally, we discuss ecological implications of our findings.
Fri, 10 Apr 2015 08:27:00 GMT
http://hdl.handle.net/2381/31968
20150410T08:27:00Z

On the composition of the distributions xs+ lnmx+ and xμ+
http://hdl.handle.net/2381/31949
Title: On the composition of the distributions xs+ lnmx+ and xμ+
Authors: Fisher, Brian
Abstract: Let F be a distribution and let f be a locally summable function. The distribution F(f) is defined as the neutrix limit of the sequence {Fn(f)}, where Fn(x) = F(x)*δn(x) and {δn(x)} is a certain sequence of infinitely differentiable functions converging to the Dirac deltafunction δ(x). The composition of the distributions xs + lnm x+ and xμ + is proved to exist and be equal to μmxsμ + lnm x+ for μ > 0 and s,m = 1, 2,....
Description: 2000 Mathematics Subject Classification. 46F10
Tue, 31 Mar 2015 10:48:47 GMT
http://hdl.handle.net/2381/31949
20150331T10:48:47Z

New Langevin and Gradient Thermostats for Rigid Body Dynamics
http://hdl.handle.net/2381/31940
Title: New Langevin and Gradient Thermostats for Rigid Body Dynamics
Authors: Davidchack, Ruslan L.; Ouldridge, T. E.; Tretyakov, M. V.
Abstract: We introduce two new thermostats, one of Langevin type and one of gradient (Brownian) type, for rigid body dynamics. We formulate rotation using the quaternion representation of angular coordinates; both thermostats preserve the unit length of quaternions. The Langevin thermostat also ensures that the conjugate angular momenta stay within the tangent space of the quaternion coordinates, as required by the Hamiltonian dynamics of rigid bodies. We have constructed three geometric numerical integrators for the Langevin thermostat and one for the gradient thermostat. The numerical integrators reflect key properties of the thermostats themselves. Namely, they all preserve the unit length of quaternions, automatically, without the need of a projection onto the unit sphere. The Langevin integrators also ensure that the angular momenta remain within the tangent space of the quaternion coordinates. The Langevin integrators are quasisymplectic and of weak order two. The numerical method for the gradient thermostat is of weak order one. Its construction exploits ideas of Liegroup type integrators for differential equations on manifolds. We numerically compare the discretization errors of the Langevin integrators, as well as the efficiency of the gradient integrator compared to the Langevin ones when used in the simulation of rigid TIP4P water model with smoothly truncated electrostatic interactions. We observe that the gradient integrator is computationally less efficient than the Langevin integrators. We also compare the relative accuracy of the Langevin integrators in evaluating various static quantities and give recommendations as to the choice of an appropriate integrator.
Description: AMS 2000 subject classification. 65C30, 60H35, 60H10.
Mon, 30 Mar 2015 09:07:46 GMT
http://hdl.handle.net/2381/31940
20150330T09:07:46Z

Segaltype algebraic models of ntypes
http://hdl.handle.net/2381/31938
Title: Segaltype algebraic models of ntypes
Authors: Blanc, D.; Paoli, Simona
Abstract: For each n ≥ 1, we introduce two new Segaltype models of ntypes of topological
spaces: weakly globular nfold groupoids, and a lax version of these. We show
that any ntype can be represented up to homotopy by such models via an explicit
algebraic fundamental nfold groupoid functor. We compare these models to
Tamsamani’s weak ngroupoids, and extract from them a model for (k − 1)
connected ntypes.
Description: Mathematical Subject Classification 2000
Primary: 55S45
Secondary: 18G50, 18B40
Mon, 30 Mar 2015 08:45:24 GMT
http://hdl.handle.net/2381/31938
20150330T08:45:24Z

The weakly globular double category of fractions of a category
http://hdl.handle.net/2381/31937
Title: The weakly globular double category of fractions of a category
Authors: Paoli, Simona; Pronk, D.
Abstract: This paper introduces the construction of a weakly globular double category of fractions for a category and studies its universal properties. It shows that this double category is locally small and considers a couple of concrete examples.
Description: 2010 Mathematics Subject Classification: 18D05, 18E35
Mon, 30 Mar 2015 08:34:24 GMT
http://hdl.handle.net/2381/31937
20150330T08:34:24Z

A circular order on edgecoloured trees and RNA mdiagrams
http://hdl.handle.net/2381/31820
Title: A circular order on edgecoloured trees and RNA mdiagrams
Authors: Marsh, Robert J.; Schroll, Sibylle
Abstract: We study a circular order on labelled, medgecoloured trees with k vertices, and show that the set of such trees with a fixed circular order is in bijection with the set of RNA mdiagrams of degree k, combinatorial objects which can be regarded as RNA secondary structures of a certain kind. We enumerate these sets and show that the set of trees with a fixed circular order can be characterized as an equivalence class for the transitive closure of an operation which, in the case m=3, arises as an induction in the context of interval exchange transformations. © 2013 Elsevier Inc.
Description: 2010 Mathematics Subject Classification: Primary: 05C05, 05A15; Secondary: 37B10
Mon, 09 Mar 2015 10:16:25 GMT
http://hdl.handle.net/2381/31820
20150309T10:16:25Z

Extensions in Jacobian Algebras and Cluster Categories of Marked Surfaces
http://hdl.handle.net/2381/31819
Title: Extensions in Jacobian Algebras and Cluster Categories of Marked Surfaces
Authors: Canakci, Ilke; Schroll, Sibylle
Abstract: In the context of representation theory of finite dimensional algebras, string algebras have been extensively studied and almost all aspects of their representation theory are wellunderstood. One exception to this is the classification of extensions between indecomposable modules. In this paper we explicitly describe such extensions for a class of string algebras, namely gentle algebras associated to surface triangulations. These algebras arise as Jacobian algebras of unpunctured surfaces. We give bases of their extension spaces and show that the dimensions of these extension spaces are given in terms of crossing arcs in the surface. Our approach is new and consists of interpreting snake graphs as indecomposable modules. To give a complete answer, we need to work in the associated cluster category where we explicitly calculate the middle terms of extensions and give a basis of the extension space. We note that not all extensions in the cluster category give rise to extensions for the Jacobian algebra.
Description: Generalized the results to include selfextensions, Added a new section containing an example, New abstract, Added a new result on snake graphs, Minor corrections, 31 pages, 14 figures. 2000 Mathematics Subject Classification. Primary: 13F60, 16P10, 18G15, 18E30
Mon, 09 Mar 2015 10:08:08 GMT
http://hdl.handle.net/2381/31819
20150309T10:08:08Z

Trivial Extensions of Gentle Algebras and Brauer Graph Algebras
http://hdl.handle.net/2381/31818
Title: Trivial Extensions of Gentle Algebras and Brauer Graph Algebras
Authors: Schroll, Sibylle
Abstract: We show that two wellstudied classes of tame algebras coincide: namely, the class of symmetric special biserial algebras coincides with the class of Brauer graph algebras. We then explore the connection between gentle algebras and symmetric special biserial algebras by explicitly determining the trivial extension of a gentle algebra by its minimal injective cogenerator. This is a symmetric special biserial algebra and hence a Brauer graph algebra of which we explicitly give the Brauer graph. We further show that a Brauer graph algebra gives rise, via admissible cuts, to many gentle algebras and that the trivial extension of a gentle algebra obtained via an admissible cut is the original Brauer graph algebra. As a consequence we prove that the trivial extension of a Jacobian algebra of an ideal triangulation of a Riemann surface with marked points in the boundary is isomorphic to the Brauer graph algebra with Brauer graph given by the arcs of the triangulation.
Description: Added an example. 2010 Mathematics Subject Classification. Primary 16G10, 16G20; Secondary 16S99, 13F60
Mon, 09 Mar 2015 10:05:05 GMT
http://hdl.handle.net/2381/31818
20150309T10:05:05Z

The geometry of Brauer graph algebras and cluster mutations
http://hdl.handle.net/2381/31817
Title: The geometry of Brauer graph algebras and cluster mutations
Authors: Marsh, Robert J.; Schroll, Sibylle
Abstract: In this paper we establish a connection between ribbon graphs and Brauer graphs. As
a result, we show that a compact oriented surface with marked points gives rise to a unique Brauer
graph algebra up to derived equivalence. In the case of a disc with marked points we show that a dual
construction in terms of dual graphs exists. The rotation of a diagonal in an mangulation gives rise
to a Whitehead move in the dual graph, and we explicitly construct a tilting complex on the related
Brauer graph algebras reflecting this geometrical move.
Description: MSC
primary, 16G10, 16G20, 16E35; secondary, 13F60, 14J10
Mon, 09 Mar 2015 09:51:31 GMT
http://hdl.handle.net/2381/31817
20150309T09:51:31Z

A circular order on edgecoloured trees and RNA mdiagrams
http://hdl.handle.net/2381/31816
Title: A circular order on edgecoloured trees and RNA mdiagrams
Authors: Marsh, Robert J.; Schroll, Sibylle
Abstract: We study a circular order on labelled, medgecoloured trees with k vertices, and show that the set of such trees with a fixed circular order is in bijection with the set of RNA mdiagrams of degree k , combinatorial objects which can be regarded as RNA secondary structures of a certain kind. We enumerate these sets and show that the set of trees with a fixed circular order can be characterized as an equivalence class for the transitive closure of an operation which, in the case m=3, arises as an induction in the context of interval exchange transformations.
Mon, 09 Mar 2015 09:45:40 GMT
http://hdl.handle.net/2381/31816
20150309T09:45:40Z

The Ext algebra of a Brauer graph algebra
http://hdl.handle.net/2381/31815
Title: The Ext algebra of a Brauer graph algebra
Authors: Green, Edward L.; Schroll, Sibylle; Snashall, Nicole; Taillefer, Rachel
Abstract: In this paper we study finite generation of the Ext algebra of a Brauer graph algebra by determining the degrees of the generators. As a consequence we characterize the Brauer graph algebras that are Koszul and those that are K_2.
Description: Minor changes only. 2010 Mathematics Subject Classification. 16G20, 16S37, 16E05, 16E30
Mon, 09 Mar 2015 09:37:28 GMT
http://hdl.handle.net/2381/31815
20150309T09:37:28Z

Group actions and coverings of Brauer graph algebras
http://hdl.handle.net/2381/31808
Title: Group actions and coverings of Brauer graph algebras
Authors: Green, E. L.; Schroll, Sibylle; Snashall, Nicole
Abstract: We develop a theory of group actions and coverings on Brauer graphs that parallels
the theory of group actions and coverings of algebras. In particular, we show that any Brauer
graph can be covered by a tower of coverings of Brauer graphs such that the topmost covering has
multiplicity function identically one, no loops, and no multiple edges. Furthermore, we classify
the coverings of Brauer graph algebras that are again Brauer graph algebras.
Description: 2010 Mathematics Subject Classification. Primary 05E18, 16G20; Secondary 14E20, 16W50, 58E40
Fri, 06 Mar 2015 16:08:02 GMT
http://hdl.handle.net/2381/31808
20150306T16:08:02Z

Gaussian process regression with multiple response variables
http://hdl.handle.net/2381/31763
Title: Gaussian process regression with multiple response variables
Authors: Wang, Bo; Chen, Tau
Abstract: Gaussian process regression (GPR) is a Bayesian nonparametric technology that has
gained extensive application in databased modelling of various systems, including
those of interest to chemometrics. However, most GPR implementations model only a
single response variable, due to the difficulty in the formulation of covariance function
for correlated multiple response variables, which describes not only the correlation
between data points, but also the correlation between responses. In the paper we
propose a direct formulation of the covariance function for multiresponse GPR, based
on the idea that its covariance function is assumed to be the “nominal” unioutput
covariance multiplied by the covariances between different outputs. The effectiveness
of the proposed multiresponse GPR method is illustrated through numerical examples
and response surface modelling of a catalytic reaction process.
Wed, 04 Mar 2015 15:57:18 GMT
http://hdl.handle.net/2381/31763
20150304T15:57:18Z

nFold groupoids, ntypes and ntrack categories
http://hdl.handle.net/2381/31752
Title: nFold groupoids, ntypes and ntrack categories
Authors: Blanc, David; Paoli, Simona
Abstract: For each n ≥ 1, we introduce two new Segaltype models of ntypes
of topological spaces: weakly globular nfold groupoids, and a lax version
of these. We show that any ntype can be represented up to homotopy by
such models via an explicit algebraic fundamental nfold groupoid functor.
We compare these models to Tamsamani’s weak ngroupoids, and extract from
them a model for (k − 1)connected ntypes.
Description: 1991 Mathematics Subject Classification. 55S45; 18G50, 18B40
Wed, 04 Mar 2015 11:33:24 GMT
http://hdl.handle.net/2381/31752
20150304T11:33:24Z

Minimum Distance Estimation of Milky Way Model Parameters and Related Inference
http://hdl.handle.net/2381/31616
Title: Minimum Distance Estimation of Milky Way Model Parameters and Related Inference
Authors: Banerjee, S.; Bhattacharya, S.; Basu, A.; Bose, S.; Chakrabarty, Dalia; Mukherjee, S.
Abstract: We propose a method to estimate the location of the Sun in the disk of the Milky Way using a
method based on the Hellinger distance and construct confidence sets on our estimate of the unknown
location using a bootstrap based method. Assuming the Galactic disk to be twodimensional, the
sought solar location then reduces to the radial distance separating the Sun from the Galactic center
and the angular separation of the Galactic center to Sun line, from a prefixed line on the disk. On
astronomical scales, the unknown solar location is equivalent to the location of us earthlings who
observe the velocities of a sample of stars in the neighborhood of the Sun. This unknown location
is estimated by undertaking pairwise comparisons of the estimated density of the observed set of
velocities of the sampled stars, with the density estimated using synthetic stellar velocity data
sets generated at chosen locations in the Milky Way disk. The synthetic data sets are generated
at a number of locations that we choose from within a constructed grid, at four different base
astrophysical models of the Galaxy. Thus, we work with one observed stellar velocity data and
four distinct sets of simulated data comprising a number of synthetic velocity data vectors, each
generated at a chosen location. For a given base astrophysical model that gives rise to one such
simulated data set, the chosen location within our constructed grid at which the estimated density of
the generated synthetic data best matches the density of the observed data, is used as an estimate
for the location at which the observed data was realized. In other words, the chosen location
corresponding to the highest match offers an estimate of the solar coordinates in the Milky Way
disk. The “match” between the pair of estimated densities is parameterized by the affinity measure
based on the familiar Hellinger distance. We perform a novel crossvalidation procedure to establish
a desirable “consistency” property of the proposed method.
Thu, 05 Feb 2015 14:31:58 GMT
http://hdl.handle.net/2381/31616
20150205T14:31:58Z

Inverse Bayesian Estimation of Gravitational Mass Density in Galaxies from Missing Kinematic Data
http://hdl.handle.net/2381/31604
Title: Inverse Bayesian Estimation of Gravitational Mass Density in Galaxies from Missing Kinematic Data
Authors: Chakrabarty, Dalia; Saha, P.
Abstract: In this paper, we focus on a type of inverse problem in which the data are expressed as an unknown function of
the sought and unknown model function (or its discretised representation as a model parameter vector). In particular,
we deal with situations in which training data are not available. Then we cannot model the unknown
functional relationship between data and the unknown model function (or parameter vector) with a Gaussian
Process of appropriate dimensionality. A Bayesian method based on state space modelling is advanced instead.
Within this framework, the likelihood is expressed in terms of the probability density function (pdf) of the state
space variable and the sought model parameter vector is embedded within the domain of this pdf. As the measurable
vector lives only inside an identified subvolume of the system state space, the pdf of the state space variable
is projected onto the space of the measurables, and it is in terms of the projected state space density that the
likelihood is written; the final form of the likelihood is achieved after convolution with the distribution of measurement
errors. Application motivated vague priors are invoked and the posterior probability density of the
model parameter vectors, given the data are computed. Inference is performed by taking posterior samples with
adaptive MCMC. The method is illustrated on synthetic as well as real galactic data.
Wed, 04 Feb 2015 17:07:47 GMT
http://hdl.handle.net/2381/31604
20150204T17:07:47Z

Bayesian Density Estimation via Multiple Sequential Inversions of 2D Images with Application in Electron Microscopy
http://hdl.handle.net/2381/31575
Title: Bayesian Density Estimation via Multiple Sequential Inversions of 2D Images with Application in Electron Microscopy
Authors: Chakrabarty, Dalia; Rigat, F.; Gabrielyan, N.; Beanland, R.; Paul, S.
Abstract: We present a new Bayesian methodology to learn the unknown material density of
a given sample by inverting its twodimensional images that are taken with a Scanning Electron
Microscope. An image results from a sequence of projections of the convolution of the density
function with the unknown microscopy correction function that we also learn from the data;
thus learning of the unknowns demands multiple inversions. We invoke a novel design of experiment,
involving imaging at multiple values of the parameter that controls the subsurface
depth from which information about the density structure is carried, to result in the image.
Reallife material density functions are characterized by high density contrasts and are highly
discontinuous, implying that they exhibit correlation structures that do not vary smoothly. In
the absence of training data, modeling such correlation structures of real material density functions
is not possible. So we discretize the material sample and treat values of the density function
at chosen locations inside it as independent and distributionfree parameters. Resolution
of the available image dictates the discretization length of the model; three models pertaining
to distinct resolution classes (at μm to nano metre scale lengths) are developed. We develop
priors on the material density, such that these priors adapt to the sparsity inherent in the density
function. The likelihood is defined in terms of the distance between the convolution of the unknown
functions and the image data. The posterior probability density of the unknowns given
the data is expressed using the developed priors on the density and priors on the microscopy
correction function as elicited from the Microscopy literature. We achieve posterior samples
using an adaptive MetropoliswithinGibbs inference scheme. The method is applied to learn
the material density of a 3D sample of a nanostructure, using real image data. Illustrations on
simulated image data of alloy samples are also included
Wed, 04 Feb 2015 10:02:57 GMT
http://hdl.handle.net/2381/31575
20150204T10:02:57Z

Bayesian Learning of Material Density Function by Multiple Sequential Inversions of 2D Images in Electron Microscopy
http://hdl.handle.net/2381/31574
Title: Bayesian Learning of Material Density Function by Multiple Sequential Inversions of 2D Images in Electron Microscopy
Authors: Chakrabarty, Dalia; Paul, S.
Editors: Polpo de Campos, A; Neto,; Ramos Rifo,; Stern,; Lauretto,
Abstract: We discuss a novel inverse problem in which the data is generated by the sequential contractive projections
of the convolution of two unknown functions, both of which we aim to learn. The method is illustrated
using an application that relates to the multiple inversions of image data recorded with a Scanning Electron
Microscope, with the aim of learning the density of a given material sample and the microscopy correction
function. Given the severe logistical difficulties in this application of taking multiple images at different
viewing angles, a novel imaging experiment is undertaken, resulting in expansion of information. In lieu of
training data, it is noted that the highly discontinuous material density function cannot be modelled using a
Gaussian Process (GP) as the parametrisation of the required nonstationary covariance function of such a
GP cannot be achieved without training data. Consequently, we resort to estimating values of the unknown
functions at chosen locations in their domain–locations at which an image data are available. Image data
across a range of resolutions leads to multiscale models which we use to estimate material densities from the
micrometre to nanometre length scales. We discuss applications of the method in nondestructive learning
of material density using simulated metallurgical image data, as well as perform inhomogeneity detection in
multicomponent composite on nano metre scales, by inverting real image data of a brick of nanoparticles.
Wed, 04 Feb 2015 09:51:38 GMT
http://hdl.handle.net/2381/31574
20150204T09:51:38Z

Simple Locally Finite Lie Algebras of Diagonal Type
http://hdl.handle.net/2381/31502
Title: Simple Locally Finite Lie Algebras of Diagonal Type
Authors: Baranov, Alexander
Abstract: We discuss various characterizations of simple locally finite Lie algebras of diagonal type over an algebraically closed field of characteristic zero.
Tue, 27 Jan 2015 14:38:49 GMT
http://hdl.handle.net/2381/31502
20150127T14:38:49Z

On time scale invariance of random walks in confined space.
http://hdl.handle.net/2381/31448
Title: On time scale invariance of random walks in confined space.
Authors: Bearup, Daniel; Petrovskii, Sergei
Abstract: Animal movement is often modelled on an individual level using simulated random walks. In such applications it is preferable that the properties of these random walks remain consistent when the choice of time is changed (time scale invariance). While this property is well understood in unbounded space, it has not been studied in detail for random walks in a confined domain. In this work we undertake an investigation of time scale invariance of the drift and diffusion rates of Brownian random walks subject to one of four simple boundary conditions. We find that time scale invariance is lost when the boundary condition is nonconservative, that is when movement (or individuals) is discarded due to boundary encounters. Where possible analytical results are used to describe the limits of the time scaling process, numerical results are then used to characterise the intermediate behaviour.
Tue, 20 Jan 2015 14:49:30 GMT
http://hdl.handle.net/2381/31448
20150120T14:49:30Z

Modelling biological invasions : population cycles, waves and time delays
http://hdl.handle.net/2381/31392
Title: Modelling biological invasions : population cycles, waves and time delays
Authors: Jankovic, Masha
Abstract: Biological invasions are rapidly gaining importance due to the everincreasing number
of introduced species. Alongside the plenitude of empirical data on invasive
species there exists an equally broad range of mathematical models that might be
of use in understanding biological invasions.
This thesis aims to address several issues related to modelling invasive species
and provide insight into their dynamics. Part I (Chapter 2) documents a case
study of the gypsy moth, Lymantria dispar, invasion in the US. We propose an
alternative hypothesis to explain the patchiness of gypsy moth spread entailing
the interplay between dispersal, predation or a viral infection and the Allee effect.
Using a reactiondiffusion framework we test the two models (preypredator and
susceptibleinfected) and predict qualitatively similar patterns as are observed in
natural populations. As high density gypsy moth populations cause the most
damage, estimating the spread rate would be of help in any suppression strategy.
Correspondingly, using a diffusive SI model we are able to obtain estimates of the
rate of spread comparable to historical data.
Part II (Chapters 3, 4 and 5) is more methodological in nature, and in a single
species context we examine the effect of an ubiquitous phenomenon influencing
population dynamics time delay. In Chapter 3 we show that contrary to the
general opinion, time delays are not always destabilising, using a delay differential
equation with discrete time delay. The concept of distributed delay is introduced
in Chapter 4 and studied through an integrodifferential model. Both Chapters 3
and 4 focus on temporal dynamics of populations, so we further this consideration
to include spatial effects in Chapter 5. Using two different representations of movement,
we show that the onset of spatiotemporal chaos in the wake of population
fronts is possible in a single species model.
Thu, 08 Jan 2015 12:53:35 GMT
http://hdl.handle.net/2381/31392
20150108T12:53:35Z

Special functions and generalized functions
http://hdl.handle.net/2381/30544
Title: Special functions and generalized functions
Authors: AlSirehy, Fatma.
Abstract: In 1950, Laurent Schwartz marked a convenient starting point for the theory of generalized functions as a subject in its own right. He developed and unified much of the earlier work by Hadamard, Bochner, Sobolev and others. Since then an enormous literature dealing with both theory and applications has grown up, and the subject has undergone extensive further development. The original Schwartz treatment defined a distribution as a linear continuous functional on a space of test functions.;This thesis can be considered a part of the development going in that direction. It is partly an extension of earlier contributions by Fisher, Kuribayashi, Itano and others.;After introducing the background and basic definitions in Chapter One, we developed some basic results concerning the cosine integral Ci(lambda x) and its associated functions Ci+(lambda x) and Ci(lambdax) as well as the neutrix convolution products of the cosine integral.;Chapter Three is devoted to similar results concerning the sine integral Si(lambdax).;In Chapter Four, we generalize some earlier results by Fisher and Kuribayashi concerning the product of the two dimensions xl+ and xlr+ . Moreover, other results are obtained concerning the neutrix product of xlambdar lnp x and sgn x xlambdar. Other theorems are proved about the matrix product of some other distributions such as xl+ ln x+ and xlr .;Chapter Five contains new results about the composition of distributions. It involves the applications of the neutrix limit to establish such relationships between different distributions.
Mon, 15 Dec 2014 10:40:16 GMT
http://hdl.handle.net/2381/30544
20141215T10:40:16Z

Ancient Egyptian astronomy : timekeeping and cosmography in the New Kingdom
http://hdl.handle.net/2381/30543
Title: Ancient Egyptian astronomy : timekeeping and cosmography in the New Kingdom
Authors: Symons, Sarah.
Abstract: The first part of this study analyses and discusses astronomical timekeeping methods used in the New Kingdom. Diagonal star clocks are examined first, looking at classification of sources, decan lists, and the updating of the tables over time. The date list in the Osireion at Abydos is discussed, and issues concerning its place in the history of astronomical timekeeping are raised. The final stellar timekeeping method, the Ramesside star clock, is then examined. The conventional interpretation of the observational method behind the tables is challenged by a new theory, and a system of analysing the tables is introduced. The conclusions of the previous sections are then gathered together in a discussion of the development of stellar timekeeping methods.;The small instruments known as shadow clocks, and their later relatives the sloping sundials, are also examined. The established hypothesis that the shadow clock was completed by the addition of a crossbar is challenged and refuted.;The second part of this study is based on New Kingdom representations of the sky. Two major texts and several celestial diagrams are discussed in detail, beginning with the Book of Nut, which describes the motions of the sun and stars. New translations of the vignette and dramatic text are presented and discussed. Portions of the Book of the Day describing the behaviour of the sun and circumpolar group of stars are analysed.;Finally, celestial diagrams dating from the New Kingdom are discussed. Their composition and significance is discussed and the conceptual framework behind the diagrams is recreated. By introducing new theories and analysis methods, and using a modern but sympathetic approach to the original sources, this study attempts to update and extend our knowledge of these areas of ancient astronomy..
Mon, 15 Dec 2014 10:40:15 GMT
http://hdl.handle.net/2381/30543
20141215T10:40:15Z

Data structures and implementation of an adaptive hp finite element method
http://hdl.handle.net/2381/30541
Title: Data structures and implementation of an adaptive hp finite element method
Authors: Senior, Bill.
Abstract: For a fully adaptive hp finite element programme to be implemented it is necessary to implement nirregular meshes efficiently. This requires a sufficiently flexible data structure to be implemented. Because such flexibility is required, the traditional array based approach cannot be used because of its limited applicability. In this thesis this traditional approach has been replaced by an object orientated design and implementation. This leads to an implementation that can be extended easily and safely to include other problems for which it was not originally designed.;The problems with maintaining continuity on such a diverse variety of meshes and how continuity is maintained are discussed. Then the main structure of the mesh is described in the form of domain, subdomains and elements. These are used in conjunction with constraint mappings to give a conforming approximation even with the most irregular of meshes.;There are several varieties of matrix generated by the method each with its own problems of storage. Sparse matrices, with perhaps more than 95% of zero entries, need to be used along side dense matrices. In this thesis an object oriented matrix library is implemented that enables this variety of matrices to be used.;An hp finite element algorithm is then implemented using the data structures, and is tested on a range of test problems. The method is shown to be effective on these problems.
Mon, 15 Dec 2014 10:40:15 GMT
http://hdl.handle.net/2381/30541
20141215T10:40:15Z

On finite groups of plocal rank one and a conjecture of Robinson
http://hdl.handle.net/2381/30542
Title: On finite groups of plocal rank one and a conjecture of Robinson
Authors: Eaton, Charles.
Abstract: We use the classification of finite simple groups to verify a conjecture of Robinson for finite groups G where G/Op(G) has trivial intersection Sylow psubgroups. Groups of this type are said to have plocal rank one, and it is hoped that this invariant will eventually form the basis for inductive arguments, providing reductions for the conjecture, or even a proof using the results presented here as a base. A positive outcome for Robinson's conjecture would imply Alperin's weight conjecture.;It is shown that in proving Robinson's conjecture it suffices to demonstrate only that it holds for finite groups in which Op(G) is both cyclic and central.;Part of the proof of the former result is used to complete the verification of Dade's inductive conjecture for the Ree groups of type G2.;.
Mon, 15 Dec 2014 10:40:15 GMT
http://hdl.handle.net/2381/30542
20141215T10:40:15Z

A special numerical method for solving Hamiltonian eigenproblems
http://hdl.handle.net/2381/30540
Title: A special numerical method for solving Hamiltonian eigenproblems
Authors: Maple, Carsten R.
Abstract: In this thesis we develop and implement a new algorithm for finding the solutions of linear Hamiltonian systems arising from ordinary differential equation (ODE) eigenproblems; a large source of these systems is SturmLiouville problems, and these will provide the angle of approach. The convergence properties of the algorithm will be analysed, as will the performance of the algorithm for large values of eigenparameter.;An algorithm is also proposed to find highindex eigenvalues of general SturmLiouville problems.
Mon, 15 Dec 2014 10:40:15 GMT
http://hdl.handle.net/2381/30540
20141215T10:40:15Z

Multivariate hermite interpolation in euclidean space and its unit sphere by radial basis functions
http://hdl.handle.net/2381/30539
Title: Multivariate hermite interpolation in euclidean space and its unit sphere by radial basis functions
Authors: Luo, Zuhua.
Abstract: In this thesis, we consider radial basis function interpolations in ddimensional Euclidean space Hd and the unit sphere 5d_1, where the data is generated not only by pointevaluations, but also by the derivatives, or differential/pseudodifferential operators. Some sufficient and necessary conditions for the wellposedness of the interpolations are given. The results on sensitivity and sta bility of the interpolation systems are obtained. The optimal properties of the interpolants are analysed through the variational framework and reproducing kernel Hilbert space property, the error bounds and convergence rates of the interpolants are derived. The admissible reproducing kernel Hilbert spaces are also characterised.
Mon, 15 Dec 2014 10:40:14 GMT
http://hdl.handle.net/2381/30539
20141215T10:40:14Z

On indecomposable modules over clustertilted algebras of type A
http://hdl.handle.net/2381/30538
Title: On indecomposable modules over clustertilted algebras of type A
Authors: Parsons, Mark James
Abstract: Gabriel's Theorem describes the dimension vectors of the finitely generated indecomposable modules over the path algebra of a simplylaced Dynkin quiver. It shows that they can be obtained from the expressions for the positive roots of the corresponding root system in terms of the simple roots. Here, we present a method for finding the dimension vectors of the finitely generated indecomposable modules over a clustertilted algebra of Dynkin type A.;It is known that the quiver of a clustertilted algebra of Dynkin type A is given by an exchange matrix of the corresponding cluster algebra. We define a companion basis for such a quiver to be a Z basis of roots of the integral root lattice of the corresponding root system whose associated matrix of inner products is a positive quasiCartan companion of the corresponding exchange matrix.;Our main result establishes that the dimension vectors of the finitely generated indecomposable modules over a clustertilted algebra of Dynkin type A arise from expressions for the positive roots of the corresponding root system in terms of a companion basis (for the quiver of that algebra). This can be regarded as a generalisation of part of Gabriel's Theorem in the Dynkin type A case. The proof uses the fact that the quivers of the clustertilted algebras of Dynkin type A have a particularly nice description in terms of triangulation of regular polygons.
Mon, 15 Dec 2014 10:40:14 GMT
http://hdl.handle.net/2381/30538
20141215T10:40:14Z

Anisotropic adaptive refinement for discontinuous galerkin methods
http://hdl.handle.net/2381/30536
Title: Anisotropic adaptive refinement for discontinuous galerkin methods
Authors: Hall, Edward John Cumes
Abstract: We consider both the a priori and a posteriori error analysis and hpadaptation strategies for discontinuous Galerkin interior penalty methods for secondorder partial differential equations with nonnegative characteristic form on anisotropically refined computational meshes with anisotropically enriched polynomial degrees. In particular, we discuss the question of error estimation for linear target functionals, such as the outflow flux and the local average of the solution, exploiting duality based arguments.;The a priori error analysis is carried out in two settings. In the first, full orientation of elements is allowed but only (possibly highorder) isotropic polynomial degrees considered; our analysis, therefore, extends previous results, where only finite element spaces comprising piecewise linear polynomials were considered, by utilizing techniques from tensor analysis. In the second case, anisotropic polynomial degrees are allowed, but the elements are assumed to be axiparallel; we thus apply previously known interpolation error results to the goaloriented setting.;Based on our a posteriori error bound we first design and implement an adaptive anisotropic hrefinement algorithm to ensure reliable and efficient control of the error in the prescribed functional to within a given tolerance. This involves exploiting both local isotropic and anisotropic mesh refinement, chosen on a competitive basis requiring the solution of local problems. The superiority of the proposed algorithm in comparison with a standard hisotropic mesh refinement algorithm and a Hessian based hanisotropic adaptive procedure is illustrated by a series of numerical experiments. We then describe a fully hp adaptive algorithm, once again using a competitive refinement approach, which, numerical experiments reveal, offers considerable improvements over both a standard hpisotropic refinement algorithm and an hanisotropic/pisotropic adaptive procedure.
Mon, 15 Dec 2014 10:40:14 GMT
http://hdl.handle.net/2381/30536
20141215T10:40:14Z

On the quiver and relations of the Borel Schur algebras
http://hdl.handle.net/2381/30537
Title: On the quiver and relations of the Borel Schur algebras
Authors: Liang, Degang
Abstract: Let K be an infinite field of characteristic p â‰¥ 0 and let n, r be positive integers. Let S+(n, r) be the Borel Schur algebra over K, which is a subalgebra of the Schur algebra S(n, r). We aim to give a description of the Borel Schur algebra S+ (n, r) by finding its quiver and relations. We give a complete description of the quiver and relations for S+(2, r). We also construct a family of embedding from S+(2, r) to S+(n, r + s) which induce embeddings of the corresponding quivers. This gives us some relations for S+(n, r) for n > 2.;We describe the quiver of S+( n, r) for both p = 0 and p > 0. We also describe some relations of special type for p > 0 and find all relations for p = 0.
Mon, 15 Dec 2014 10:40:14 GMT
http://hdl.handle.net/2381/30537
20141215T10:40:14Z

Uncertainty propagation and reduction in reservoir forecasting
http://hdl.handle.net/2381/30534
Title: Uncertainty propagation and reduction in reservoir forecasting
Authors: Busby, Daniel
Abstract: In this work we focus on nonparametric regression techniques based on Gaussian process, considering both the frequentist and the Bayesian approach. A new sequential experimental design strategy referred to as hierarchical adaptive experimental design is proposed and tested on synthetic functions and on realistic reservoir models using a commercial oil reservoir multiphase flow simulator. Our numerical results show that the method effectively approximate the simulators output with the required approximation accuracy using an affordable number of simulator runs. Moreover, the number of simulations necessary to reach a given approximation accuracy is sensibly reduced respect to other existing experimental designs such as maximin latin hypercubes, or other classical designs used in commercial softwares.;Once an accurate emulator of the simulator output is obtained, it can be also used to calibrate the simulator model using data observed on the real physical system. This process, referred to as history matching in reservoir forecasting, is fundamental to tune input parameters and to consequently reduce output uncertainty. An approach to model calibration using Bayesian inversion is proposed in the last part of this work. Here again a hierarchical emulator is adopted. An innovative sequential design is proposed with the objective of increasing the emulator accuracy around possible history matching solutions. The excellent performances obtained on a very complicated reservoir test case, suggest the high potential of the method to solve complicated inverse problems. The proposed methodology is about to be commercialized in an industrial environment to assist reservoir engineers in uncertainty analysis and history matching.
Mon, 15 Dec 2014 10:40:13 GMT
http://hdl.handle.net/2381/30534
20141215T10:40:13Z

Euler characteristics and cohomology for quasiperiodic projection patterns
http://hdl.handle.net/2381/30533
Title: Euler characteristics and cohomology for quasiperiodic projection patterns
Authors: Irving, Claire Louise
Abstract: This thesis investigates quasiperiodic patterns and, in particular, polytopal projection patterns, which are produced using the projection method by choosing the acceptance domain to be a polytope. Cohomology theories applicable in this setting are defined, together with the Euler characteristic.;Formulae for the Cech cohomology Hˇ* ( M P ) and Euler characteristic eP are determined for polytopal projection patterns of codimension 2 and calculations are carried out for several examples. The Euler characteristic is shown to be undefined for certain codimension 3 polytopal projection patterns. The Euler characteristic eP is proved to be always defined for a particular class of codimension n polytopal projection patterns P and a formula for eP for such patterns is given. The finiteness or otherwise of the rank of Hˇm(M P ) âŠ— Q for m â‰¥ 0 is also discussed for various classes of polytopal projection patterns. Lastly, a model for M P is considered which leads to an alternative method for computing the rank of Hˇm(M P ) âŠ— Q for P a ddimensional codimension n polytopal projection pattern with d > n..
Mon, 15 Dec 2014 10:40:13 GMT
http://hdl.handle.net/2381/30533
20141215T10:40:13Z

Efficient method for detection of periodic orbits in chaotic maps and flows
http://hdl.handle.net/2381/30535
Title: Efficient method for detection of periodic orbits in chaotic maps and flows
Authors: Crofts, Jonathan J.
Abstract: An algorithm for detecting unstable periodic orbits in chaotic systems [Phys. Rev. E, 60 (1999), pp. 61726175] which combines the set of stabilising transformations proposed by Schmelcher and Diakonos [Phys. Rev. Lett., 78 (1997), pp. 47334736] with a modified semiimplicit Euler iterative scheme and seeding with periodic orbits of neighbouring periods, has been shown to be highly efficient when applied to lowdimensional system. The difficulty in applying the algorithm to higher dimensional systems is mainly due to the fact that the number of stabilising transformations grows extremely fast with increasing system dimension. in this thesis, we propose to construct stabilising transformations based on the knowledge of the stability matrices of already detected periodic orbits (used as seeds). The advantage of our approach is in a substantial reduction of the number of transformations, which increases the efficiency of the detection algorithm, especially in the case of highdimensional systems. The dependence of the number of transformations on the dimensionality of the unstable manifold rather than on system size enables us to apply, for the first time, the method of stabilising transformations to highdimensional systems. Another important aspect of our treatment of highdimensional flows is that we do not restrict to a Poincare surface of section. This is a particularly nice feature, since the correct placement of such a section in a highdimensional phase space is a challenging problem in itself. The performance of the new approach is illustrated by its application to the fourdimensional kicked double rotor map, a sixdimensional system of three coupled Henon maps and to the KuramotoSivashinsky system in the weakly turbulent regime.
Mon, 15 Dec 2014 10:40:13 GMT
http://hdl.handle.net/2381/30535
20141215T10:40:13Z

Logic, computation and constraint satisfaction
http://hdl.handle.net/2381/30530
Title: Logic, computation and constraint satisfaction
Authors: Martin, Barnaby D.
Abstract: We study a class of nondeterministic program schemes with while loops: firstly, augmented with a priority queue for memory; secondly, augmented with universal quantification; and, thirdly, augmented with universal quantification and a stack for memory. We try to relate these respective classes of program schemes to wellknown complexity classes and logics.;We study classes of structure on which path system logic coincides with polynomial time P.;We examine the complexity of generalisations of nonuniform boolean constraint satisfaction problems, where the inputs may have a bounded number of quantifier alternations (as opposed to the purely existential quantification of the CSP). We prove, for all boundedalternation prefixes that have some universal quantifiers to the outside of some existential quantifiers (i.e. 2 and above), that this generalisation of boolean CSP respects the same dichotomy as that for the nonuniform boolean quantified constraint satisfaction problem.;We study the nonuniform QCSP, especially on digraghs, through a combinatorial analog  the alternatinghomomorphism problem  that sits in relation to the QCSP exactly as the homomorphism problem sits with the CSP. We establish a trichotomy theorem for the nonuniform QCSP when the template is restricted to antireflexive, undirected graphs with at most one cycle. Specifically, such templates give rise to QCSPs that are either tractable, NPcomplete or Pspacecomplete.;We study closure properties on templates that respect QCSP hardness or QCSP equality. Our investigation leads us to examine the properties of firstorder logic when deprived of the equality relation.;We study the nonuniform QCSP on tournament templates, deriving sufficient conditions for tractablity, NPcompleteness and Pspacecompleteness. In particular, we prove that those tournament templates that give rise to tractable CSP also give rise to tractable QCSP.
Mon, 15 Dec 2014 10:40:12 GMT
http://hdl.handle.net/2381/30530
20141215T10:40:12Z

Embeddings, fault tolerance and communication strategies in kary ncube interconnection networks
http://hdl.handle.net/2381/30532
Title: Embeddings, fault tolerance and communication strategies in kary ncube interconnection networks
Authors: Ashir, Yaagoub A.
Abstract: The kary ncube interconnection network Qkn, for k 3 and n 2, is ndimensional network with k processors in each dimension. A kary ncube parallel computer consists of kn identical processors, each provided with its own sizeable memory and interconnected with 2n other processors. The kary ncube has some attractive features like symmetry, high level of concurrency and efficiency, regularity and high potential for the parallel execution of various algorithms. It can efficiently simulate other network topologies. The kary ncube has a smaller degree than that of its equivalent hypercube (the one with at least as many nodes) and it has a smaller diameter than its equivalent mesh of processors.;In this thesis, we review some topological properties of the kary ncube Qkn and show how a Hamiltonian cycle can be embedded in Qkn using the Gray codes strategy. We also completely classify when a Qkn contains a cycle of some given length.;The problem of embedding a large cycle in a Qkn with both faulty nodes and faulty links is considered. We describe a technique for embedding a large cycle in a kary ncube Qkn with at most n faults and show how this result can be extended to obtain embeddings of meshes and tori in such a faulty kary ncube.;Embeddings of Hamiltonian cycles in faulty kary ncubes is also studied. We develop a technique for embedding a Hamiltonian cycle in a kary ncube with at most 4n5 faulty links where every node is incident with at least two healthy links. Our result is optimal as there exist kary ncubes with 4n  4 faults (and where every node is incident with at least two healthy links) not containing a Hamiltonian cycle. We show that the same technique can be easily applied to the hypercube. We also show that the general problem of deciding whether a faulty kary ncube contains a Hamiltonian cycle is NPcomplete, for all (fixed) k 3.
Mon, 15 Dec 2014 10:40:12 GMT
http://hdl.handle.net/2381/30532
20141215T10:40:12Z

On a construction of young modules
http://hdl.handle.net/2381/30531
Title: On a construction of young modules
Authors: Vernon, Marie
Abstract: Let n be a natural number and E an ndimensional vector space over a field K. The symmetric group acts by place permutation on the tensor space E âŠ—r. The Sigmarmodule EâŠ—r can be decomposed into a direct sum of permutation modules Mlambda where lambda is a composition of r into at most n parts.;Each permutation module labelled by such a composition is isomorphic to one labelled be a partition of r into at most n parts, and therefore we assume that lambda is such a partition. The indecomposable direct summands of the permutation module M lambda are called Young modules, and they are labelled by partitions of r into at most n parts.;Throughout this thesis we consider the case where E has dimension two. For lambda a twopart partition of r, we explicitly decompose the module M lambda into a direct sum of Young modules by providing spanning sets for the Young modules.;Moreover, we consider the problem of finding a basis or an algorithm for a basis for the Young modules in this case and, although we have not been able to solve this in general, we give some conjectures and examples showing in which cases we can find a basis.
Mon, 15 Dec 2014 10:40:12 GMT
http://hdl.handle.net/2381/30531
20141215T10:40:12Z

Meshfree radical basis function methods for advectiondominated diffusion problems
http://hdl.handle.net/2381/30529
Title: Meshfree radical basis function methods for advectiondominated diffusion problems
Authors: Hunt, David Patrick
Abstract: This thesis is concerned with the numerical solution of advectiondominated diffusion problems. There are essentially two key aspects to this work: the derivatives of an a priori error estimate for a semiLagrangian meshfree method using radial basis function interpolation to numerically approximate the firstorder linear transport problem; and the design and testing of a semiLagrangian meshless method to numerically solve the full parabolic advectiondiffusion problem, using radial basis function Hermite interpolation. We begin by establishing the theory of radical basis function interpolation, including new results for the stability of interpolation via the class of radial basis functions known as polyharmonic splines, as well as error estimates for interpolation by the same class of function. These results provide us with the necessary tools to prove the a priori error estimate for the semiLagrangian advection scheme, given certain assumptions on the smoothness of the solution. We then validate both the scheme and the analysis with a series of numerical experiments. By introducing the concept of Hermite interpolation, we develop and implement a new semiLagrangian method for the numerical approximation of advectiondominated diffusion problems, which is validated through two numerical experiments..
Mon, 15 Dec 2014 10:40:11 GMT
http://hdl.handle.net/2381/30529
20141215T10:40:11Z

Selfinjective algebras and the second Hochschild cohomology group
http://hdl.handle.net/2381/30528
Title: Selfinjective algebras and the second Hochschild cohomology group
Authors: AlKadi, Deena
Abstract: In this thesis we study the second Hochschild cohomology group HH 2(Lambda) of a finite dimensional algebra Lambda. In particular, we determine HH2(Lambda) where Lambda is a finite dimensional selfinjective algebra of finite representation type over an algebraically closed field K and show that this group is zero for most such Lambda; we give a basis for HH2(Lambda) in the few cases where it is not zero.;Then we consider algebras of tame representation type; more specifically, we study finite dimensional selfinjective one parametric tame algebras which are not weakly symmetric. Here we show that HH2(Lambda) is nonzero and find a nonzero element eta in HH2(Lambda) and an associative deformation Lambdaeta of Lambda.
Mon, 15 Dec 2014 10:40:11 GMT
http://hdl.handle.net/2381/30528
20141215T10:40:11Z