16:30
Forthcoming events in this series
16:30
16:30
14:15
15:30
Beyond Navier-Strokes: hydrodynamic models for hypersonic and microscale gas flows.
16:30
A teleparallel reformulation of Dirac's equation or quantum electrodynamics for dummies
Abstract
spinor --> coframemakes the Dirac equation nonlinear. The morale of the talk is that, in our opinion, it is more natural to view the Dirac equation as a nonlinear equation for the unknown coframe rather than a linear equation for the unknown spinor.
16:30
A law of motion for spiral waves in the complex Ginzburg-Landeau equation
16:30
16:30
Statistical and fractal aspects of the contact of rough surfaces
16:30
Layer solutions in a half-space for boundary reactions
16:30
16:30
Bumps, breathers and waves in a neural network with threshold accommodation
Abstract
/notices/events/abstracts/differential-equations/ht06/Coombes.shtml
16:30
Multi-pulse steady-states for the FitzHugh-Nagymo system and a problem in combinatorial geometry
16:30
16:30
16:30
16:30
Why some genetic switches operate through bistability : the lac operon a case study
16:30
Some properties of a class of zeta-like functions
Abstract
The Riemann zeta function involves, for Re s>1, the summation of the inverse s-th powers of the integers. A class of zeta-like functions is obtained if the s-th powers of integers which contain specified digits are omitted from the summation. The numerical summation of such series, their convergence properties and analytic continuation are considered in this lecture.
16:30
Equation-free computation for complex/multiscale systems
16:30
Optimising Routes in Ad-Hoc TDD-CDMA Communication Systems
Abstract
In this talk, a network topology is presented that allows both peer-to-peer and non-local traffic in a cellular based TDD-CDMA system known as opportunity driven multiple access (ODMA). The key to offering appropriate performance of peer-to-peer communication in such a system relies on the use of a routing algorithm which minimises interference. This talk will discuss the constraints and limitations on the capacity of such a system using a variety of routing techniques. A congestion based routing algorithm will be presented that attempts to minimize the overall power of the system as well as providing a measure of feasibility. This technique provides the lowest required transmit power in all circumstances, and the highest capacity in nearly all cases studied. All of the routing algorithms considered allocate TDD time slots on a first come first served basis according to a set of pre-defined rules. This fact is utilised to enable the development of a combined routing and resource allocation algorithm for TDD-CDMA relaying. A novel method of time slot allocation according to relaying requirements is then developed.
Two measures of assessing congestion are presented based on matrix norms. One is suitable for a current interior point solution, the other is more elegant but is not currently suitable for efficient minimisation and thus practical implementation.
16:30
16:15
16:30
Compact Source and Dipole Representation of Solutions of the Wave Equation in Irregular Regions
Abstract
Moving hydrodynamic boundaries (waves and bubbles, for example) produce acoustic signatures.
16:30
Can one count the shape of a drum?
Abstract
It is by now well known that one cannot HEAR the shape of a
drum: There are many known examples of isospectral yet not isometric "drums". Recently we discovered that the sequences of integers formed by counting the nodal domains of successive eigenfunctions encode geometrical information, which can also be used to resolve spectral ambiguities. I shall discuss these sequences and indicate how the information stored in the nodal sequences can be deciphered.