Path integrals for continuous-time Markov chains

This note presents a method of evaluating the distribution of a path integral for Markov chains on a countable state space.

Derivation of the probability distribution function for the local density of states of a disordered quantum wire via the replica trick and supersymmetry

We consider the statistical properties of the local density of states of a one-dimensional Dirac equation in the presence of various types of disorder with Gaussian white-noise distribution. It is shown how either the replica trick or supersymmetry can be used to calculate exactly all the moments of the local density of states.' Careful attention is paid to how the results change if the local density of states is averaged over atomic length scales. For both the replica trick and supersymmetry the problem is reduced to finding the ground state of a zero-dimensional Hamiltonian which is written solely in terms of a pair of coupled spins which are elements of u(1, 1). This ground state is explicitly found for the particular case of the Dirac equation corresponding to an infinite metallic quantum wire with a single conduction channel. The calculated moments of the local density of states agree with those found previously by Al'tshuler and Prigodin [Sov. Phys. JETP 68 (1989) 198] using a technique based on recursion relations for Feynman diagrams. (C) 2001 Elsevier Science B.V. All rights reserved.

Integrals for continuous-time Markov chains

This paper presents a method of evaluating the expected value of a path integral for a general Markov chain on a countable state space. We illustrate the method with reference to several models, including birth-death processes and the birth, death and catastrophe process. (C) 2002 Elsevier Science Inc. All rights reserved.

The design of planar gradient coils. Part I: A winding path correction method

In this work a new approach for designing planar gradient coils is outlined for the use in an existing MRI apparatus. A technique that allows for gradient field corrections inside the diameter-sensitive volume is deliberated. These corrections are brought about by making changes to the wire paths that constitute the coil windings, and hence, is called the path correction method. The existing well-known target held method is used to gauge the performance of a typical gradient coil. The gradient coil design methodology is demonstrated for planar openable gradient coils that can be inserted into an existing MRI apparatus. The path corrected gradient coil is compared to the coil obtained using the target field method. It is shown that using a wire path correction with optimized variables, winding patterns that can deliver high magnetic gradient field strengths and large imaging regions can be obtained.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 1. Methodology for residual generation

For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.

Analysis of articulatory dynamics in dysarthria following brain injury in childhood using electromagnetic articulography and electropalatography

Two physiological assessments, electromagnetic articulography (EMA) and electropalatography (EPG), were used simultaneously to investigate the articulatory dynamics in an 18-year-old male with dysarthria 9 years following traumatic brain injury (TBI). Eight words consisting of /t, s, integral, k/ in word initial and word final positions were produced up to 10 times. A nonneurologically impaired male served as a control subject. Six parameters were analyzed using EMA: velocity, acceleration, deceleration, distance, duration, and motion path of tongue movements. Using EPG, the pattern and amount of tongue-to-palate contact and the duration of the closure/constriction phase of each consonant produced were assessed. Timing disturbances in the TBI speaker's speech were highlighted in perceptual assessments in the form of prolonged phonemes and a reduced speech rate. EMA analysis revealed that the approach and release phase durations of the consonant productions were within normal limits. Kinematic strategies such as decreased velocity and decreased distances traveled by the tongue, however, may have counterbalanced each other to produce these appropriate results. EPG examination revealed significantly longer closure/constriction phase periods, which may have contributed to the prolonged phonemes and reduced speech rate observed. The implications of these findings for the development of treatment programs for dysarthria subsequent to TBI will be highlighted.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.

Approach to site, C House, Cooparoo

Looking uphill towards house from road.

A two-phase approach for detecting recombination in nucleotide sequences

Genetic recombination can produce heterogeneous phylogenetic histories within a set of homologous genes. Delineating recombination events is important in the study of molecular evolution, as inference of such events provides a clearer picture of the phylogenetic relationships among different gene sequences or genomes. Nevertheless, detecting recombination events can be a daunting task, as the performance of different recombination-detecting approaches can vary, depending on evolutionary events that take place after recombination. We recently evaluated the effects of post-recombination events on the prediction accuracy of recombination-detecting approaches using simulated nucleotide sequence data. The main conclusion, supported by other studies, is that one should not depend on a single method when searching for recombination events. In this paper, we introduce a two-phase strategy, applying three statistical measures to detect the occurrence of recombination events, and a Bayesian phylogenetic approach in delineating breakpoints of such events in nucleotide sequences. We evaluate the performance of these approaches using simulated data, and demonstrate the applicability of this strategy to empirical data. The two-phase strategy proves to be time-efficient when applied to large datasets, and yields high-confidence results.

Exploring Change in Neanderthal Behavioural Complexity: An Innovative Approach to the Study of Neanderthal Behaviour

Diachronic approaches provide potential for a more sophisticated framework within which to examine change in Neanderthal behavioural complexity using archaeological proxies such as symbolic artefacts, faunal assemblages and technology. Analysis of the temporal appearance and distribution of such artefacts and assemblages provide the basis for identifying changes in Neanderthal behavioural complexity in terms of symbolism, faunal extraction and technology respectively. Although changes in technology and faunal extraction were examined in the wider study, only the results of the symbolic study are presented below to illustrate the potential of the approach.

Calculation of line integrals in boundary integral methods

We propose quadrature rules for the approximation of line integrals possessing logarithmic singularities and show their convergence. In some instances a superconvergence rate is demonstrated.

Measurement Function Design for Visual Tracking Applications

Extracting human postural information from video sequences has proved a difficult research question. The most successful approaches to date have been based on particle filtering, whereby the underlying probability distribution is approximated by a set of particles. The shape of the underlying observational probability distribution plays a significant role in determining the success, both accuracy and efficiency, of any visual tracker. In this paper we compare approaches used by other authors and present a cost path approach which is commonly used in image segmentation problems, however is currently not widely used in tracking applications.

Periodic or Bounded Solutions of Carathéodory Systems of Ordinary Differential Equations

In this paper we extend the guiding function approach to show that there are periodic or bounded solutions for first order systems of ordinary differential equations of the form x1 =f(t,x), a.e. epsilon[a,b], where f satisfies the Caratheodory conditions. Our results generalize recent ones of Mawhin and Ward.

A finite integral transform technique for solving the diffusion-reaction equation with Michaelis-Menten kinetics

An approximate analytical technique employing a finite integral transform is developed to solve the reaction diffusion problem with Michaelis-Menten kinetics in a solid of general shape. A simple infinite series solution for the substrate concentration is obtained as a function of the Thiele modulus, modified Sherwood number, and Michaelis constant. An iteration scheme is developed to bring the approximate solution closer to the exact solution. Comparison with the known exact solutions for slab geometry (quadrature) and numerically exact solutions for spherical geometry (orthogonal collocation) shows excellent agreement for all values of the Thiele modulus and Michaelis constant.

The Learning Tourism Destination: The potential of a learning organisation approach for improving the sustainability of tourism destinations

Globalisation, increasing complexity, and the need to address triple-bottom line sustainability has seen the proliferation of Learning Organisations (LO) who, by definition, have the capacity to anticipate environmental changes and economic opportunities and adapt accordingly. Such organisations use system dynamics modelling (SDM) for both strategic planning and the promotion of organisational learning. Although SDM has been applied in the context of tourism destination management for predictive reasons, the current literature does not analyse or recognise how this could be used as a foundation for an LO. This study introduces the concept of the Learning Tourism Destinations (LTD) and discusses, on the basis of a review of 6 case studies, the potential of SDM as a tool for the implementation and enhancement of collective learning processes. The results reveal that SDM is capable of promoting communication between stakeholders and stimulating organisational learning. It is suggested that the LTD approach be further utilised and explored.