Applied Mathematics Commons^™

Application Of The Two-Variable Model To Simulate A Multisensory Reaction-Time Task, Rebecca Brady, John Butler

Academic Posters Collection

To navigate the world in an efficient manner, the brain seamlessly integrates signals received across multiple sensory modalities. Behavioral studies have suggested that multisensory processing is a winner-take-all sensory response mechanism to some optimal combination of sensory signals. In addition, multiple sensory cues are not always beneficial with some studies showing maladaptive multisensory processing as an identifier of older adults prone to falls from age matched healthy controls.

A stalwart of modelling sensory decision-making is the work by (Wong &Wang, 2006) but to date almost all of this research has been focused on unisensory tasks. We extend the reduced two-variable …

Morton-Ordered Gpu Lattice Boltzmann Cfd Simulations With Application To Blood Flow, Gerald Gallagher, Fergal J. Boyle

Conference Papers

Computational fluid dynamics (CFD) is routinely used for numerically predicting cardiovascular-system medical device fluid flows. Most CFD simulations ignore the suspended cellular phases of blood due to computational constraints, which negatively affects simulation accuracy. A graphics processing unit (GPU) lattice Boltzmann-immersed boundary (LB-IB) CFD software package capable of accurately modelling blood flow is in development by the authors, focusing on the behaviour of plasma and stomatocyte, discocyte and echinocyte red blood cells during flow. Optimised memory ordering and layout schemes yield significant efficiency improvements for LB GPU simulations. In this work, comparisons of row-major-ordered Structure of Arrays (SoA) and Collected …

Factorized Runge-Kutta-Chebyshev Methods, Stephen O'Sullivan

Conference papers

The second-order extended stability Factorized Runge-Kutta-Chebyshev (FRKC2) class of explicit schemes for the integration of large systems of PDEs with diffusive terms is presented. FRKC2 schemes are straightforward to implement through ordered sequences of forward Euler steps with complex stepsizes, and easily parallelised for large scale problems on distributed architectures.

Preserving 7 digits for accuracy at 16 digit precision, the schemes are theoretically capable of maintaining internal stability at acceleration factors in excess of 6000 with respect to standard explicit Runge-Kutta methods. The stability domains have approximately the same extents as those of RKC schemes, and are a third longer …

Cryptography Using Steganography: New Algorithms And Applications, Jonathan Blackledge

Articles

Developing methods for ensuring the secure exchange of information is one of the oldest occupations in history. With the revolution in Information Technology, the need for securing information and the variety of methods that have been developed to do it has expanded rapidly. Much of the technology that forms the basis for many of the techniques used today was originally conceived for use in military communications and has since found a place in a wide range of industrial and commercial sectors. This has led to the development of certain industry standards that are compounded in specific data processing algorithms together …

Self-Authentication Of Audio Signals By Chirp Coding, Jonathan Blackledge, Eugene Coyle

Conference papers

This paper discusses a new approach to ‘watermarking’ digital signals using linear frequency modulated or ‘chirp’ coding. The principles underlying this approach are based on the use of a matched filter to provide a reconstruction of a chirped code that is uniquely robust in the case of signals with very low signal-to-noise ratios. Chirp coding for authenticating data is generic in the sense that it can be used for a range of data types and applications (the authentication of speech and audio signals, for example). The theoretical and computational aspects of the matched filter and the properties of a chirp …

Tight Lower Bound For The Sparse Travelling Salesman Problem, Fredrick Mtenzi

Conference papers

The Sparse Travelling Salesman Problem (Sparse TSP) which is a variant of the classical Travelling Salesman Problem (TSP) is the problem of finding the shortest route of the salesman when visiting cities in a region making sure that each city is visited at least once and returning home at the end. In the Sparse TSP, the distance between cities may not obey the triangle inequality; this makes the use of algorithms and formulations designed for the TSP to require modifications in order to produce near-optimal results. A lower bound for optmisation problems gives us the quality guarantee of the near-optimal …

A Covert Encryption Method For Applications In Electronic Data Interchange, Jonathan Blackledge, Dmitry Dubovitskiy

Articles

A principal weakness of all encryption systems is that the output data can be ‘seen’ to be encrypted. In other words, encrypted data provides a ‘flag’ on the potential value of the information that has been encrypted. In this paper, we provide a new approach to ‘hiding’ encrypted data in a digital image.

In conventional (symmetric) encryption, the plaintext is usually represented as a binary stream and encrypted using an XOR type operation with a binary cipher. The algorithm used is ideally designed to: (i) generate a maximum entropy cipher so that there is no bias with regard to any …

Direct Least-Squares Ellipse Fitting, Jane Courtney, Annraoi Depaor

Conference Papers

Many biological and astronomical forms can be best represented by ellipses. While some more complex curves might represent the shape more accurately, ellipses have the advantage that they are easily parameterised and define the location, orientation and dimensions of the data more clearly. In this paper, we present a method of direct least-squares ellipse fitting by solving a generalised eigensystem. This is more efficient and more accurate than many alternative approaches to the ellipse-fitting problem such as fuzzy c-shells clustering and Hough transforms. This method was developed for human body modelling as part of a larger project to design a …

Reply To "Comment On ‘Atomic Spectral Line Free-Parameter Deconvolution Procedure’”, Vladimir Milosavljevic, Goran Poparic

Articles

We do not agree with the authors of the preceding Comment [X. Nikolic, X. Ojurovic, and X. Mijatovic, Phys. Rev. E, 67, 058401, 2003]. Our numerical procedure for the deconvolution of the theoretical asymmetric convolution integral of a Gaussian and a plasma broadened spectral line profile jA,R(λ) for spectral lines enables the determination of all broadening parameters. All broadening parameters can be determined directly from the recorded line profile of a single line, with minimal assumptions or prior knowledge. Additional experimental diagnostics are not required.

Shadow Casting Phenomena At Newgrange, Frank Prendergast

Articles

A digital model of the Newgrange passage tomb and surrounding ring of monoliths known as the Great Circle is used to investigate sunrise shadow casting phenomena at the monument. Diurnal variation in shadow directions and lengths are analysed for their potential use in the Bronze Age to indicate the passage of seasonal time. Computer-aided simulations are developed from a photogrammetric survey to accurately show how three of the largest monoliths, located closest to the tomb entrance and archaeologically coded GC1, GC-1 and GC-2, cast their shadows onto the vertical face of the entrance kerbstone, coded K1. The phenomena occur at …