Bound volume of work submitted for the degree of Doctor of Science (also one book and five paper-back reports included)

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Conversion of a chirped Gaussian pulse to a soliton or a bound multisoliton state in quasi-lossless and lossy optical fiber spans

The formation of single-soliton or bound-multisoliton states from a single linearly chirped Gaussian pulse in quasi-lossless and lossy fiber spans is examined. The conversion of an input-chirped pulse into soliton states is carried out by virtue of the so-called direct Zakharov-Shabat spectral problem, the solution of which allows one to single out the radiative (dispersive) and soliton constituents of the beam and determine the parameters of the emerging bound state(s). We describe here how the emerging pulse characteristics (the number of bound solitons, the relative soliton power) depend on the input pulse chirp and amplitude. © 2007 Optical Society of America.

Bound state vector solitons with locked and precessing states of polarization

We report experimental observation of new tightly and loosely bound state vector solitons with locked and precessing states of polarization in a carbon nanotube mode locked fiber laser in the anomalous dispersion regime. ©2013 Optical Society of America.

Developing solid particulate vaccine adjuvants:surface bound antigen favouring a humoural response, whereas entrapped antigen shows a tendency for cell mediated immunity

This present study compares the efficacy of microsphere formulations, and their method of antigen presentation, for the delivery of the TB sub-unit vaccine antigen, Ag85B-ESAT-6. Microspheres based on poly(lactide-co-glycolide) (PLGA) and chitosan incorporating dimethyldioctadecylammonium bromide (DDA) were prepared by either the w/o/w double emulsion method (entrapped antigen) or the o/w single emulsion method (surface bound antigen), and characterised for their physico-chemical properties and their ability to promote an immune response to Ag85B-ESAT-6. The method of preparation, and hence method of antigen association, had a pronounced effect on the type of immune response achieved from the microsphere formulations, with surface bound antigen favouring a humoural response, whereas entrapped antigen favoured a cellular response.

Pair breaking and bound states in disordered superconductors

We study the effects of inhomogeneous pairing interactions and impurities in short-coherence-length superconductors. Within the Born approximation, the effects of pairing disorder and magnetic impurities are identical. The T-matrices for pairing disorder sites with and without an impurity give rise to bound states within the BCS (Bardeen-Cooper-Schrieffer) gap, consistent with scanning tunnelling microscopy results on Bi2Sr2CaCu2O8+δ with Zn or Ni impurities.

Large-scale molecular dynamics simulations of HLA-A*0201 complexed with a tumor-specific antigenic peptide:can the α3 and β2m domains be neglected?

Large-scale massively parallel molecular dynamics (MD) simulations of the human class I major histo-compatibility complex (MHC) protein HLA-A*0201 bound to a decameric tumor-specific antigenic peptide GVY-DGREHTV were performed using a scalable MD code on high-performance computing platforms. Such computational capabilities put us in reach of simulations of various scales and complexities. The supercomputing resources available Large-scale massively parallel molecular dynamics (MD) simulations of the human class I major histocompatibility complex (MHC) protein HLA-A*0201 bound to a decameric tumor-specific antigenic peptide GVYDGREHTV were performed using a scalable MD code on high-performance computing platforms. Such computational capabilities put us in reach of simulations of various scales and complexities. The supercomputing resources available for this study allow us to compare directly differences in the behavior of very large molecular models; in this case, the entire extracellular portion of the peptide–MHC complex vs. the isolated peptide binding domain. Comparison of the results from the partial and the whole system simulations indicates that the peptide is less tightly bound in the partial system than in the whole system. From a detailed study of conformations, solvent-accessible surface area, the nature of the water network structure, and the binding energies, we conclude that, when considering the conformation of the α1–α2 domain, the α3 and β2m domains cannot be neglected. © 2004 Wiley Periodicals, Inc. J Comput Chem 25: 1803–1813, 2004

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

On the Exponential Bound of the Cutoff Resolvent

A simpler proof of a result of Burq [1] is presented.

Cramer-Rao bound analysis of location estimation in multi-hop wireless sensor networks

Location estimation is important for wireless sensor network (WSN) applications. In this paper we propose a Cramer-Rao Bound (CRB) based analytical approach for two centralized multi-hop localization algorithms to get insights into the error performance and its sensitivity to the distance measurement error, anchor node density and placement. The location estimation performance is compared with four distributed multi-hop localization algorithms by simulation to evaluate the efficiency of the proposed analytical approach. The numerical results demonstrate the complex tradeoff between the centralized and distributed localization algorithms on accuracy, complexity and communication overhead. Based on this analysis, an efficient and scalable performance evaluation tool can be designed for localization algorithms in large scale WSNs, where simulation-based evaluation approaches are impractical. © 2013 IEEE.

Pulse-to-pulse spectral evolution of breathing bound solitons in a mode-locked fiber laser

We make first direct observation of breathing bound solitons in mode-locked laser. We measure pulse-to-pulse spectrum evolution and reveal internal interactions between bound solitons in real-time. © OSA 2015.

An Improvement to the Achievement of the Griesmer Bound

We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose of this paper is to determine nq(k, d) for d = dk as nq(k, d) = gq(k, d) + 1 for q ≥ k with 3 ≤ k ≤ 8 except for (k, q) = (7, 7), (8, 8), (8, 9).

Note on an Improvement of the Griesmer Bound for q-ary Linear Codes

Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k and d with k ≥ 3, 1 ≤ d ≤ q^(k−1) and a prime or a prime power q. The purpose of this note is to show that there exists a series of the functions h3,q, h4,q, ..., hk,q such that nq(k, d) can be expressed.

Digitization of Old Mathematical Periodicals Published by the Institute of Mathematics and Informatics, Bulgarian Academy of Sciences

The digitization practice for retro-converting of the mathematical periodicals, published by the Institute of Mathematics and Informatics, Bulgarian Academy of Sciences (IMI-BAS) and the followed benefits for long-term preserving and assuring open access to these materials is discussed in the article.