Travelling waves are a feature of many spatio-temporal series. The use of single side band filtering and the complex singular value decomposition to isolate such waves is described. As with other applications of the singular value decomposition, such as principal components, the results can be difficult to interpret. In the case of travelling waves, however, a dynamic graphical display using co...

In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n) time dynamic programming algorithm for computing the maximum circular ordering lower bound. The well-known gene order phylogeny program, GRAPPA, currently implements the brute-force exponential time algorithm and the Swap-as-yougo heuristic....

Introduction At high magnetic field strengths, travelling wave MRI can be used to solve the standing wave problem of volume resonators [1]. However, travelling wave MRI suffers from electromagnetic field-attenuation and high whole body energy deposition (SAR), so that only the distal parts of the body can be imaged. In this work we introduce a new travelling wave RF coil. The coil guides the tr...

in this paper, the modified simplest equation method is successfully implemented to find travelling wave solutions of the generalized forms $b(n,1)$ and $b(-n,1)$ of burgers equation.this method is direct, effective and easy to calculate, and it is a powerful mathematical tool for obtaining exact travelling wave solutions of the generalized forms $b(n,1)$ and $b(-n,1)$ of burgers equation and c...

Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem (TDTSP) consists in finding a Hamiltonian tour of least total duration covering the vertices of the graph. The contribution of this paper is twofold. First, we describe a lower and upper bounding procedure that requires the solution of a simpler (yet NP-hard) Asymmetric Travelling Salesman Pro...

The Vehicle Routing Problem with Time Windows (VRPTW) is a complex combinatorial optimisation problem which can be seen as a combination of two well-known sub-problems: the Travelling Salesman Problem and the Bin Packing Problem. Relevant objectives include minimising the number of vehicles and the total travelling distance for delivering demand to customers, while complying with capacity and t...