Effect of sampling density on the measurement of stream condition indicators in two lowland Australian streams

There is widespread application of indicators to the assessment of environmental condition of streams. These indicators are intended for use by managers in making various comparative and absolute assessments and often have a role in resource allocation and performance assessment. Therefore, the problem of formally defining confidence in the results is important but difficult because the sampling strategies used are commonly based on a compromise between the requirements of statistical rigour and the pragmatic issues of access and resources. It is rare to see this compromise explicitly considered and consequently there is seldom quantification of the uncertainty that could affect the confidence a manager has in an indicator. In this paper, we present a method for quantitatively assessing the tradeoffs between sampling density and uncertainty in meeting various monitoring objectives. Assessments using judgement‐based representative reaches are shown to be unreliable; instead a sampling approach is recommended based on the random selection of measuring sites. A detailed dataset was collected along two streams in Victoria, Australia, and the effect of sampling density was assessed by subsampling from this dataset with precision related to the number of sites assessed per reach length and the intensity of the sampling at each site. The sampling scheme to achieve a given precision is shown to depend on the monitoring objective. In particular, three objectives were considered: (1) making a baseline assessment of current condition; (2) change detection; and (3) detection of a critical threshold in condition. Change detection is shown to be more demanding than assessing baseline condition with additional sampling effort required to achieve the same precision. Sampling to detect a critical threshold depends on nominating acceptable values of Type I and II error and the size of the effect to be detected. Copyright © 2006 John Wiley & Sons, Ltd.     

A stochastic realization algorithm via block LQ decomposition in Hilbert space

A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification.     

A new approach to model reference adaptive control

In classical model reference adaptive control, the goal is to design a controller to make the closed-loop system act like a prespecified reference model in the face of significant plant uncertainty. Typically, the controller consists of an identifier (or tuner) which is used to adjust the parameters of a linear time-invariant (LTI) compensator, and under suitable assumptions on the plant model uncertainty it is proven that asymptotic matching is achieved. However, the controller is typically highly nonlinear, and the closed loop system can exhibit undesirable behavior, such as large transients or a large control signal, especially if the initial parameter estimates are poor. Furthermore, its ability to tolerate time-varying parameters is typically limited. Here, we propose an alternative approach. Rather than estimating the plant or compensator parameters, instead we estimate what the control signal would be if the plant parameters and plant state were known and the "ideal LTI compensator" were applied. We end up with a linear periodic controller. Our assumptions are reasonably natural extensions of the classical ones to the time-varying setting; we allow rapid parameter variations, although we add a compactness requirement. We prove that we can obtain arbitrarily good tracking, explore the benefits and limitations of the approach, and provide a simulation study.     

Pedestrian detection and tracking at crossroads

This paper presents a system that can perform pedestrian detection and tracking using vision-based techniques. A very important issue in the field of intelligent transportation system is to prevent pedestrians from being hit by vehicles. Recently, a great number of vision-based techniques have been proposed for this purpose. In this paper, we propose a vision-based method, which combines the use of a pedestrian model as well as the walking rhythm of pedestrians to detect and track walking pedestrians. Through integrating some spatial and temporal information grabbed by a vision system, we are able to develop a reliable system that can be used to prevent traffic accidents happened at crossroads. In addition, the proposed system can deal with the occlusion problem. Experimental results obtained by executing some real world cases have demonstrated that the proposed system is indeed superb.     

An immune oriented multi-agent system for biological image processing

In this article, we present a parallel image processing system based on the concept of reactive agents. Our system lies in the oRis language, which allows to describe finely and simply the agents’ behaviors to detect image features. We also present a method of segmentation using a multi-agent system, and two biological applications made with oRis. The stopping of this multi-agent system is implemented through a technique issued from immunology: the apoptosis.     

A distributed adverse drug reaction detection system using intelligent agents with a fuzzy recognition‐primed decision model

Discovering unknown adverse drug reactions (ADRs) in postmarketing surveillance as early as possible is highly desirable. Nevertheless, current postmarketing surveillance methods largely rely on spontaneous reports that suffer from serious underreporting, latency, and inconsistent reporting. Thus these methods are not ideal for rapidly identifying rare ADRs. The multiagent systems paradigm is an emerging and effective approach to tackling distributed problems, especially when data sources and knowledge are geographically located in different places and coordination and collaboration are necessary for decision making. In this article, we propose an active, multiagent framework for early detection of ADRs by utilizing electronic patient data distributed across many different sources and locations. In this framework, intelligent agents assist a team of experts based on the well‐known human decision‐making model called Recognition‐Primed Decision (RPD). We generalize the RPD model to a fuzzy RPD model and utilize fuzzy logic technology to not only represent, interpret, and compute imprecise and subjective cues that are commonly encountered in the ADR problem but also to retrieve prior experiences by evaluating the extent of matching between the current situation and a past experience. We describe our preliminary multiagent system design and illustrate its potential benefits for assisting expert teams in early detection of previously unknown ADRs. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 827–845, 2007.     

Frequency domain identification of Wiener models

This paper proposes a frequency domain algorithm for Wiener model identifications based on exploring the fundamental frequency and harmonics generated by the unknown nonlinearity. The convergence of the algorithm is established in the presence of white noise. No a priori knowledge of the structure of the nonlinearity is required and the linear part can be nonparametric.