Asymptotic Recovery for Discrete-Time Systems

An asymptotic recovery design procedure is proposed for square, discrete-time, linear, time-invariant multivariable systems, which allows a state-feedback design to be approximately recovered by a dynamic output feedback scheme. Both the case of negligible processing time (compared to the sampling interval) and of significant processing time are discussed. In the former case, it is possible to obtain perfect. © 1985 IEEE.

On the domain decomposition and transmission line modelling finite element method for time-domain induction motor analysis

This paper demonstrates how a finite element model which exploits domain decomposition is applied to the analysis of three-phase induction motors. It is shown that a significant gain in cpu time results when compared with standard finite element analysis. Aspects of the application of the method which are particular to induction motors are considered: the means of improving the convergence of the nonlinear finite element equations; the choice of symmetrical sub-domains; the modelling of relative movement; and the inclusion of periodic boundary conditions. © 1999 IEEE.

Application of domain decomposition and transmission line modelling techniques to 2D, time-domain, finite element problems

In this paper a recently published finite element method, which combines domain decomposition with a novel technique for solving nonlinear magnetostatic finite element problems is described. It is then shown how the method can be extended to, and optimised for, the solution of time-domain problems. © 1999 IEEE.

Terahertz time-domain spectroscopy characterization of vertically aligned carbon nanotube films

Terahertz time-domain spectroscopy measurements were made for vertically aligned multi-walled carbon nanotube (VACNT) films. We obtained the frequency dependent complex permittivity and conductivity (on the assumption that permeability μ = 1) of several samples exhibiting Drude behaviour for lossy metals. The obtained material properties of VACNT films provide information for potential microwave and terahertz applications. © 2011 Elsevier Ltd. All rights reserved.

Representations and algorithms for finite-state bisimulations of linear discrete-time control systems

While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.

Vowel normalisation: Time-domain processing of the internal dynamics of speech

Human listeners can identify vowels regardless of speaker size, although the sound waves for an adult and a child speaking the ’same’ vowel would differ enormously. The differences are mainly due to the differences in vocal tract length (VTL) and glottal pulse rate (GPR) which are both related to body size. Automatic speech recognition machines are notoriously bad at understanding children if they have been trained on the speech of an adult. In this paper, we propose that the auditory system adapts its analysis of speech sounds, dynamically and automatically to the GPR and VTL of the speaker on a syllable-to-syllable basis. We illustrate how this rapid adaptation might be performed with the aid of a computational version of the auditory image model, and we propose that an auditory preprocessor of this form would improve the robustness of speech recognisers.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Decentralised minimal-time dynamic consensus

This paper considers a group of agents that aim to reach an agreement on individually received time-varying signals by local communication. In contrast to static network averaging problem, the consensus considered in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents tracking the average of their reference inputs asymptotically. We propose a minimal-time dynamic consensus algorithm, which only utilises a minimal number of local observations of a randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically as suggested by Olshevsky and Tsitsiklis. © 2012 AACC American Automatic Control Council).

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

A coupled hydro-mechanical analysis for prediction of hydraulic fracture propagation in saturated porous media using EFG mesh-less method

The details of the Element Free Galerkin (EFG) method are presented with the method being applied to a study on hydraulic fracturing initiation and propagation process in a saturated porous medium using coupled hydro-mechanical numerical modelling. In this EFG method, interpolation (approximation) is based on nodes without using elements and hence an arbitrary discrete fracture path can be modelled.The numerical approach is based upon solving two governing partial differential equations of equilibrium and continuity of pore water simultaneously. Displacement increment and pore water pressure increment are discretized using the same EFG shape functions. An incremental constrained Galerkin weak form is used to create the discrete system of equations and a fully implicit scheme is used for discretization in the time domain. Implementation of essential boundary conditions is based on the penalty method. In order to model discrete fractures, the so-called diffraction method is used.Examples are presented and the results are compared to some closed-form solutions and FEM approximations in order to demonstrate the validity of the developed model and its capabilities. The model is able to take the anisotropy and inhomogeneity of the material into account. The applicability of the model is examined by simulating hydraulic fracture initiation and propagation process from a borehole by injection of fluid. The maximum tensile strength criterion and Mohr-Coulomb shear criterion are used for modelling tensile and shear fracture, respectively. The model successfully simulates the leak-off of fluid from the fracture into the surrounding material. The results indicate the importance of pore fluid pressure in the initiation and propagation pattern of fracture in saturated soils. © 2013 Elsevier Ltd.

Can frequency diversity provide performance gains for WSNs at 2.4GHz for the fire hydrant to above ground channel

Wireless Sensor Networks (WSNs) which utilise IEEE 802.15.4 technology offer the potential for low cost deployment and maintenance compared with conventional wired sensor networks, enabling effective and efficient condition monitoring of aged civil engineering infrastructure. We will address wireless propagation for a below to above ground scenario where one of the wireless nodes is located in a below ground fire hydrant chamber to permit monitoring of the local water distribution network. Frequency Diversity (FD) is one method that can be used to combat the damaging effects of multipath fading and so improve the reliability of radio links. However, no quantitative investigation concerning the potential performance gains from the use of FD at 2.4GHz is available for the outlined scenario. In this paper, we try to answer this question by performing accurate propagation measurements using modified and calibrated off-the-shelf 802.15.4 based sensor nodes. These measurement results are also compared with those obtained from simulations that employ our Modified 2D Finite-Difference Time-Domain (FDTD) approach. ©2009 IEEE.

Frequency diversity measurements at 2.4 GHz for wireless sensor networks deployed in tunnels

Wireless Sensor Networks (WSNs) which utilise IEEE 802.15.4 technology operate primarily in the 2.4 GHz globally compatible ISM band. However, the wireless propagation channel in this crowded band is notoriously variable and unpredictable, and it has a significant impact on the coverage range and quality of the radio links between the wireless nodes. Therefore, the use of Frequency Diversity (FD) has potential to ameliorate this situation. In this paper, the possible benefits of using FD in a tunnel environment have been quantified by performing accurate propagation measurements using modified and calibrated off-the-shelf 802.15.4 based sensor motes in the disused Aldwych underground railway tunnel. The objective of this investigation is to characterise the performance of FD in this confined environment. Cross correlation coefficients are calculated from samples of the received power on a number of frequency channels gathered during the field measurements. The low measured values of the cross correlation coefficients indicate that applying FD at 2.4 GHz will improve link performance in a WSN deployed in a tunnel. This finding closely matches results obtained by running a computational simulation of the tunnel radio propagation using a 2D Finite-Difference Time-Domain (FDTD) method. ©2009 IEEE.