A state space based approach in non-linear hemodynamic response modeling with fMRI data

In this paper we use the modified and integrated version of the balloon model in the analysis of fMRI data. We propose a new state space model realization for this balloon model and represent it with the standard A,B,C and D matrices widely used in system theory. A second order Padé approximation with equal numerator and denominator degree is used for the time delay approximation in the modeling of the cerebral blood flow. The results obtained through numerical solutions showed that the new state space model realization is in close agreement to the actual modified and integrated version of the balloon model. This new system theoretic formulation is likely to open doors to a novel way of analyzing fMRI data with real time robust estimators. With further development and validation, the new model has the potential to devise a generalized measure to make a significant contribution to improve the diagnosis and treatment of clinical scenarios where the brain functioning get altered. Concepts from system theory can readily be used in the analysis of fMRI data and the subsequent synthesis of filters and estimators.

The application of a reinforcement learning agent to a multi-product manufacturing facility

An intelligent agent-based scheduling system, consisting of a reinforcement learning agent and a simulation model has been developed and tested on a classic scheduling problem. The production facility studied is a multiproduct serial line subject to stochastic failure. The agent goal is to minimise total production costs, through selection of job sequence and batch size. To explore state space the agent used reinforcement learning. By applying an independent inventory control policy for each product, the agent successfully identified optimal operating policies for a real production facility.

Supporting adaptive learning in hypertext environment : a high level timed Petri net based approach

One problem for hypertext-based learning application is to control learning paths for different learning activities. This paper first introduced related concepts of hypertext learning state space and Petri net, then proposed a high level timed Petri Net based approach to provide some kinds of adaptation for learning activities. Examples were given while explaining ways to realizing adaptive instructions. Possible future directions were also discussed at the end of this paper.

Supporting adaptive learning in hypertext environment : an agent based approach

One problem for hypertext-based learning application is to control learning paths for different learning activities. This paper first introduces related concepts of hypertext learning state space, then proposes an agent based approach used to provide kinds of adaptation for learning activities. Examples are given while explaining ways to realizing adaptive instructions. Possible future directions are also discussed at the end of this paper.

Lower bounds for stability margin of n-dimensional discrete systems

This paper derives lower bounds for the stability margin of n-dimensional discrete systems in the Roesser’s state space setting. The lower bounds for stability margin are derived based on the MacLaurine series expansion. Numerical examples are given to illustrate the results.

Supporting adaptive learning in hypertext environments : a high level timed Petri net-based approach

A problem for hypertext-based learning application is to control learning paths for different learning activities. This paper first introduces related concepts of hypertext learning state space and high level Petri Nets (PNs), then proposes a high level timed PN based approach used to providing kinds of adaptation for learning activities by adjusting time attributes of targeted learning state space. Examples are given while explaining ways to realising adaptive instructions. Possible future directions are also discussed at the end of this paper.

Human action recognition based on pyramid histogram of oriented gradients

Human action recognition has been attracted lots of interest from computer vision researchers due to its various promising applications. In this paper, we employ Pyramid Histogram of Orientation Gradient (PHOG) to characterize human figures for action recognition. Comparing to silhouette-based features, the PHOG descriptor does not require extraction of human silhouettes or contours. Two state-space models, i.e.; Hidden Markov Model (HMM) and Conditional Random Field (CRF), are adopted to model the dynamic human movement. The proposed PHOG descriptor and the state-space models with respect to different parameters are tested using a standard dataset. We also testify the robustness of the method with respect to various unconstrained conditions and viewpoints. Promising experimental result demonstrates the effectiveness and robustness of our proposed method.

Layered dynamic probabilistic networks for spatio-temporal modelling

In applications such as tracking and surveillance in large spatial environments, there is a need for representing dynamic and noisy data and at the same time dealing with them at different levels of detail. In the spatial domain, there has been work dealing with these two issues separately, however, there is no existing common framework for dealing with both of them. In this paper, we propose a new representation framework called the Layered Dynamic Probabilistic Network (LDPN), a special type of Dynamic Probabilistic Network (DPN), capable of handling uncertainty and representing spatial data at various levels of detail. The framework is thus particularly suited to applications in wide-area environments which are characterised by large region size, complex spatial layout and multiple sensors/cameras. For example, a building has three levels: entry/exit to the building, entry/exit between rooms and moving within rooms. To avoid the problem of a relatively large state space associated with a large spatial environment, the LDPN explicitly encodes the hierarchy of connected spatial locations, making it scalable to the size of the environment being modelled. There are three main advantages of the LDPN. First, the reduction in state space makes it suitable for dealing with wide area surveillance involving multiple sensors. Second, it offers a hierarchy of intervals for indexing temporal data. Lastly, the explicit representation of intermediate sub-goals allows for the extension of the framework to easily represent group interactions by allowing coupling between sub-goal layers of different individuals or objects. We describe an adaptation of the likelihood sampling inference scheme for the LDPN, and illustrate its use in a hypothetical surveillance scenario.

A probabilistic framework for tracking in wide-area environments

Surveillance in wide-area spatial environments is characterised by complex spatial layouts, large state space, and the use of multiple cameras/sensors. To solve this problem, there is a need for representing the dynamic and noisy data in the tracking tasks, and dealing with them at different levels of detail. This requirement is particularly suited to the Layered Dynamic Probabilistic Network (LDPN), a special type of Dynamic Probabilistic Network (DPN). In this paper, we propose the use of LDPN as the integrated framework for tracking in wide-area environments. We illustrate, with the help of a synthetic tracking scenario, how the parameters of the LDPN can be estimated from training data, and then used to draw predictions and answer queries about unseen tracks at various levels of detail.

Probabilistic models over ordered partitions with applications in document ranking and collaborative filtering

Ranking is an important task for handling a large amount of content. Ideally, training data for supervised ranking would include a complete rank of documents (or other objects such as images or videos) for a particular query. However, this is only possible for small sets of documents. In practice, one often resorts to document rating, in that a subset of documents is assigned with a small number indicating the degree of relevance. This poses a general problem of modelling and learning rank data with ties. In this paper, we propose a probabilistic generative model, that models the process as permutations over partitions. This results in super-exponential combinatorial state space with unknown numbers of partitions and unknown ordering among them. We approach the problem from the discrete choice theory, where subsets are chosen in a stagewise manner, reducing the state space per each stage significantly. Further, we show that with suitable parameterisation, we can still learn the models in linear time. We evaluate the proposed models on two application areas: (i) document ranking with the data from the recently held Yahoo! challenge, and (ii) collaborative filtering with movie data. The results demonstrate that the models are competitive against well-known rivals.

Learning from ordered sets and applications in collaborative ranking

Ranking over sets arise when users choose between groups of items. For example, a group may be of those movies deemed 5 stars to them, or a customized tour package. It turns out, to model this data type properly, we need to investigate the general combinatorics problem of partitioning a set and ordering the subsets. Here we construct a probabilistic log-linear model over a set of ordered subsets. Inference in this combinatorial space is highly challenging: The space size approaches (N!/2)6.93145N+1 as N approaches infinity. We propose a split-and-merge Metropolis-Hastings procedure that can explore the state-space efficiently. For discovering hidden aspects in the data, we enrich the model with latent binary variables so that the posteriors can be efficiently evaluated. Finally, we evaluate the proposed model on large-scale collaborative filtering tasks and demonstrate that it is competitive against state-of-the-art methods.

New frontiers in biologging science

The term ‘biologging’ refers to the use of miniaturized animal-attached tags for logging and/or relaying of data about an animal's movements, behaviour, physiology and/or environment. Biologging technology substantially extends our abilities to observe, and take measurements from, free-ranging, undisturbed subjects, providing much scope for advancing both basic and applied biological research. Here, we review highlights from the third international conference on biologging science, which was held in California, USA, from 1 to 5 September 2008. Over the last few years, considerable progress has been made with a range of recording technologies as well as with the management, visualization, integration and analysis of increasingly large and complex biologging datasets. Researchers use these techniques to study animal biology with an unprecedented level of detail and across the full range of ecological scales—from the split-second decision making of individuals to the long-term dynamics of populations, and even entire communities. We conclude our report by suggesting some directions for future research.

Intelligent traffic light control of isolated intersections using machine learning methods

Traffic congestion is one of the major problems in modern cities. This study applies machine learning methods to determine green times in order to minimize in an isolated intersection. Q-learning and neural networks are applied here to set signal light times and minimize total delays. It is assumed that an intersection behaves in a similar fashion to an intelligent agent learning how to set green times in each cycle based on traffic information. Here, a comparison between Q-learning and neural network is presented. In Q-learning, considering continuous green time requires a large state space, making the learning process practically impossible. In contrast to Q-learning methods, the neural network model can easily set the appropriate green time to fit the traffic demand. The performance of the proposed neural network is compared with two traditional alternatives for controlling traffic lights. Simulation results indicate that the application of the proposed method greatly reduces the total delay in the network compared to the alternative methods.

Model based analysis of fMRI/EEG data

This thesis addresses two major topics in neuroscience literature and drawbacks from existing literature are addressed by utilising state space models and Bayesian estimation techniques. Particle filter-based joint estimation of the physiological model for time-series analysis of fMRI data is demonstrated first in the thesis and secondly the Granger causality-based effective connectivity analysis of EEG data is investigated.