Adaptive estimation of HMM transition probabilities

This paper presents new schemes for recursive estimation of the state transition probabilities for hidden Markov models (HMM's) via extended least squares (ELS) and recursive state prediction error (RSPE) methods. Local convergence analysis for the proposed RSPE algorithm is shown using the ordinary differential equation (ODE) approach developed for the more familiar recursive output prediction error (RPE) methods. The presented scheme converges and is relatively well conditioned compared with the ...

On adaptive HMM state estimation

In this paper new online adaptive hidden Markov model (HMM) state estimation schemes are developed, based on extended least squares (ELS) concepts and recursive prediction error (RPE) methods. The best of the new schemes exploit the idempotent nature of Markov chains and work with a least squares prediction error index, using a posterior estimates, more suited to Markov models then traditionally used in identification of linear systems.

Adaptive estimation of hidden semi-Markov chains with parameterised transition probabilities and exponential decaying states

This paper develops maximum likelihood (ML) estimation schemes for finite-state semi-Markov chains in white Gaussian noise. We assume that the semi-Markov chain is characterised by transition probabilities of known parametric from with unknown parameters. We reformulate this hidden semi-Markov model (HSM) problem in the scalar case as a two-vector homogeneous hidden Markov model (HMM) problem in which the state consist of the signal augmented by the time to last transition. With this reformulation we apply the expectation Maximumisation (EM ) algorithm to obtain ML estimates of the transition probabilities parameters, Markov state levels and noise variance. To demonstrate our proposed schemes, motivated by neuro-biological applications, we use a damped sinusoidal parameterised function for the transition probabilities.

Adaptive finite element analysis of elliptic problems based on bubble-type local mesh generation

A new mesh adaptivity algorithm that combines a posteriori error estimation with bubble-type local mesh generation (BLMG) strategy for elliptic differential equations is proposed. The size function used in the BLMG is defined on each vertex during the adaptive process based on the obtained error estimator. In order to avoid the excessive coarsening and refining in each iterative step, two factor thresholds are introduced in the size function. The advantages of the BLMG-based adaptive finite element method, compared with other known methods, are given as follows: the refining and coarsening are obtained fluently in the same framework; the local a posteriori error estimation is easy to implement through the adjacency list of the BLMG method; at all levels of refinement, the updated triangles remain very well shaped, even if the mesh size at any particular refinement level varies by several orders of magnitude. Several numerical examples with singularities for the elliptic problems, where the explicit error estimators are used, verify the efficiency of the algorithm. The analysis for the parameters introduced in the size function shows that the algorithm has good flexibility.

Scale adaptive tracking using mean shift and efficient feature matching

The mean shift tracker has achieved great success in visual object tracking due to its efficiency being nonparametric. However, it is still difficult for the tracker to handle scale changes of the object. In this paper, we associate a scale adaptive approach with the mean shift tracker. Firstly, the target in the current frame is located by the mean shift tracker. Then, a feature point matching procedure is employed to get the matched pairs of the feature point between target regions in the current frame and the previous frame. We employ FAST-9 corner detector and HOG descriptor for the feature matching. Finally, with the acquired matched pairs of the feature point, the affine transformation between target regions in the two frames is solved to obtain the current scale of the target. Experimental results show that the proposed tracker gives satisfying results when the scale of the target changes, with a good performance of efficiency.

Adaptive online gradient descent

We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori knowledge of the lower bound on the second derivatives of the observed functions. We then provide an algorithm, Adaptive Online Gradient Descent, which interpolates between the results of Zinkevich for linear functions and of Hazan et al for strongly convex functions, achieving intermediate rates between [square root T] and [log T]. Furthermore, we show strong optimality of the algorithm. Finally, we provide an extension of our results to general norms.

Toward the adaptive generation of bespoke game content

In this chapter, we explore methods for automatically generating game content—and games themselves—adapted to individual players in order to improve their playing experience or achieve a desired effect. This goes beyond notions of mere replayability and involves modeling player needs to maximize their enjoyment, involvement, and interest in the game being played. We identify three main aspects of this process: generation of new content and rule sets, measurement of this content and the player, and adaptation of the game to change player experience. This process forms a feedback loop of constant refinement, as games are continually improved while being played. Framed within this methodology, we present an overview of our recent and ongoing research in this area. This is illustrated by a number of case studies that demonstrate these ideas in action over a variety of game types, including 3D action games, arcade games, platformers, board games, puzzles, and open-world games. We draw together some of the lessons learned from these projects to comment on the difficulties, the benefits, and the potential for personalized gaming via adaptive game design.

Adaptive compliance control of a multi‐legged stair‐climbing robot based on proprioceptive data

Purpose – The purpose of this paper is to describe an innovative compliance control architecture for hybrid multi‐legged robots. The approach was verified on the hybrid legged‐wheeled robot ASGUARD, which was inspired by quadruped animals. The adaptive compliance controller allows the system to cope with a variety of stairs, very rough terrain, and is also able to move with high velocity on flat ground without changing the control parameters. Design/methodology/approach – The paper shows how this adaptivity results in a versatile controller for hybrid legged‐wheeled robots. For the locomotion control we use an adaptive model of motion pattern generators. The control approach takes into account the proprioceptive information of the torques, which are applied on the legs. The controller itself is embedded on a FPGA‐based, custom designed motor control board. An additional proprioceptive inclination feedback is used to make the same controller more robust in terms of stair‐climbing capabilities. Findings – The robot is well suited for disaster mitigation as well as for urban search and rescue missions, where it is often necessary to place sensors or cameras into dangerous or inaccessible areas to get a better situation awareness for the rescue personnel, before they enter a possibly dangerous area. A rugged, waterproof and dust‐proof corpus and the ability to swim are additional features of the robot. Originality/value – Contrary to existing approaches, a pre‐defined walking pattern for stair‐climbing was not used, but an adaptive approach based only on internal sensor information. In contrast to many other walking pattern based robots, the direct proprioceptive feedback was used in order to modify the internal control loop, thus adapting the compliance of each leg on‐line.

Integrated decoupling and matching network incorporated in the ground plane of a compact monopole array

Compact arrays enable various applications such as antenna beam-forming and multi-input, multi-output (MIMO) schemes on limited-size platforms. The reduced element spacing in compact arrays introduces high levels of mutual coupling which can affect the performance of the adaptive array. This coupling causes a mismatch at the input ports, which disturbs the performance of the individual elements in the array and affects the implementation of beam steering. In this article, a reactive decoupling network for a 3-element monopole array is used to establish port isolation while simultaneously matching input impedance at each port to the system impendence. The integrated decoupling and matching network is incorporated in the ground plane of the monopole array, providing further development scope for beamforming using phase shifters and power splitters in double-layered circuits.

Not learning from the past: Adaptive governance challenges for Australian natural resource management

Australia’s governance arrangements for NRM have evolved considerably over the last thirty years. The impact of changes in governance on NRM planning and delivery requires assessment. We undertake a multi-method program evaluation using adaptive governance principles as an analytical frame and apply this to Queensland to assess the impacts of governance change on NRM planning and governance outcomes. Data to inform our analysis includes: 1) a systematic review of sixteen audits/evaluations of Australian NRM over a fifteen-year period; 2) a review of Queensland’s first generation NRM Plans; and 3) outputs from a Queensland workshop on NRM planning. NRM has progressed from a bottom-up grassroots movement into a collaborative regional NRM model that has been centralised by the Australian Government. We found that while some adaptive governance challenges have been addressed, others remained unresolved. Results show that collaboration and elements of multi-level governance under the regional model were positive moves, but also that NRM arrangements contained structural deficiencies across multiple governance levels in relation to public involvement in decision-making and knowledge production for problem responsiveness. These problems for adaptive governance have been exacerbated since 2008. We conclude that the adaptive governance framework for NRM needs urgent attention so that important environmental management problems can be addressed.

Can social resilience inform SA/SIA for adaptive planning for climate change in vulnerable regions?

This book represents a landmark effort to probe and analyze the theory and empirics of designing water disaster management policies. It consists of seven chapters that examine, in-depth and comprehensively, issues that are central to crafting effective policies for water disaster management. The authors use historical surveys, institutional analysis, econometric investigations, empirical case studies, and conceptual-theoretical discussions to clarify and illuminate the complex policy process. The specific topics studied in this book include a review and analysis of key policy areas and research priority areas associated with water disaster management, community participation in disaster risk reduction, the economics and politics of ‘green’ flood control, probabilistic flood forecasting for flood risk management, polycentric governance and flood risk management, drought management with the aid of dynamic inter-generational preferences, and how social resilience can inform SA/SIA for adaptive planning for climate change in vulnerable areas. A unique feature of this book is its analysis of the causes and consequences of water disasters and efforts to address them successfully through policy-rich, cross-disciplinary and transnational papers. This book is designed to help enrich the sparse discourse on water disaster management policies and galvanize water professionals to craft creative solutions to tackle water disasters efficiently, equitably, and sustainably. This book should also be of considerable use to disaster management professionals, in general, and natural resource policy analysts.

Analysis of distributed beamforming in cooperative communications network with phase shifter based smart antenna nodes

This research study investigates the application of phase shifter-based smart antenna system in distributed beamforming. It examines the way to optimise the transmit power by jointly maximising the directivity of the array antennas and the weight vector for distributed beamforming. This research study concludes that maximising directivity can lead to better transmit power minimisation compared to maximising field intensity. This study also concludes that signal to noise power ratio maximisation subject to a power constraint and power minimisation subject to a signal to noise power ratio constraint yield the same results.