Development and evaluation of neural network freeway incident detection models using field data

This paper discusses a multi-layer feedforward (MLF) neural network incident detection model that was developed and evaluated using field data. In contrast to published neural network incident detection models which relied on simulated or limited field data for model development and testing, the model described in this paper was trained and tested on a real-world data set of 100 incidents. The model uses speed, flow and occupancy data measured at dual stations, averaged across all lanes and only from time interval t. The off-line performance of the model is reported under both incident and non-incident conditions. The incident detection performance of the model is reported based on a validation-test data set of 40 incidents that were independent of the 60 incidents used for training. The false alarm rates of the model are evaluated based on non-incident data that were collected from a freeway section which was video-taped for a period of 33 days. A comparative evaluation between the neural network model and the incident detection model in operation on Melbourne's freeways is also presented. The results of the comparative performance evaluation clearly demonstrate the substantial improvement in incident detection performance obtained by the neural network model. The paper also presents additional results that demonstrate how improvements in model performance can be achieved using variable decision thresholds. Finally, the model's fault-tolerance under conditions of corrupt or missing data is investigated and the impact of loop detector failure/malfunction on the performance of the trained model is evaluated and discussed. The results presented in this paper provide a comprehensive evaluation of the developed model and confirm that neural network models can provide fast and reliable incident detection on freeways. (C) 1997 Elsevier Science Ltd. All rights reserved.

Capillary network models for transport in packed beds: Considerations of pore aspect ratio

The conventional analysis for the estimation of the tortuosity factor for transport in porous media is modified here to account for the effect of pore aspect ratio. Structural models of the porous medium are also constructed for calculating the aspect ratio as a function of porosity. Comparison of the model predictions with the extensive data of Currie (1960) for the effective diffusivity of hydrogen in packed beds shows good agreement with a network model of randomly oriented intersecting pores for porosities upto about 50 percent, which is the region of practical interest. The predictions based on this network model are also found to be in better agreement with the data of Currie than earlier expressions developed for unconsolidated and grainy media.

Two dimensional computational fluid dynamic models for waste stabilisation ponds

Traditional waste stabilisation pond (WSP) models encounter problems predicting pond performance because they cannot account for the influence of pond features, such as inlet structure or pond geometry, on fluid hydrodynamics. In this study, two dimensional (2-D) computational fluid dynamics (CFD) models were compared to experimental residence time distributions (RTD) from literature. In one of the-three geometries simulated, the 2-D CFD model successfully predicted the experimental RTD. However, flow patterns in the other two geometries were not well described due to the difficulty of representing the three dimensional (3-D) experimental inlet in the 2-D CFD model, and the sensitivity of the model results to the assumptions used to characterise the inlet. Neither a velocity similarity nor geometric similarity approach to inlet representation in 2-D gave results correlating with experimental data. However. it was shown that 2-D CFD models were not affected by changes in values of model parameters which are difficult to predict, particularly the turbulent inlet conditions. This work suggests that 2-D CFD models cannot be used a priori to give an adequate description of the hydrodynamic patterns in WSP. (C) 1998 Elsevier Science Ltd. All rights reserved.

Metabolite mean transit times in the liver as predicted by various models of hepatic elimination

Predicted area under curve (AUC), mean transit time (MTT) and normalized variance (CV2) data have been compared for parent compound and generated metabolite following an impulse input into the liver, Models studied were the well-stirred (tank) model, tube model, a distributed tube model, dispersion model (Danckwerts and mixed boundary conditions) and tanks-in-series model. It is well known that discrimination between models for a parent solute is greatest when the parent solute is highly extracted by the liver. With the metabolite, greatest model differences for MTT and CV2 occur when parent solute is poorly extracted. In all cases the predictions of the distributed tube, dispersion, and tasks-in-series models are between the predictions of the rank and tube models. The dispersion model with mixed boundary conditions yields identical predictions to those for the distributed tube model (assuming an inverse gaussian distribution of tube transit times). The dispersion model with Danckwerts boundary conditions and the tanks-in series models give similar predictions to the dispersion (mixed boundary conditions) and the distributed tube. The normalized variance for parent compound is dependent upon hepatocyte permeability only within a distinct range of permeability values. This range is similar for each model but the order of magnitude predicted for normalized variance is model dependent. Only for a one-compartment system is the MIT for generated metabolite equal to the sum of MTTs for the parent compound and preformed metabolite administered as parent.

Response (re-)programming in aging: A kinematic analysis

Background. Age-related motor slowing may reflect either motor programming deficits, poorer movement execution, or mere strategic preferences for online guidance of movement. We controlled such preferences, limiting the extent to which movements could be programmed. Methods. Twenty-four young and 24 older adults performed a line drawing task that allowed movements to he prepared in advance in one case (i.e., cue initially available indicating target location) and not in another (i.e., no cue initially available as to target location). Participants connected large or small targets illuminated by light-emitting diodes upon a graphics tablet that sampled pen tip position at 200 Hz. Results. Older adults had a disproportionate difficulty initiating movement when prevented from programming in advance. Older adults produced slower, less efficient movements, particularly when prevented from programming under greater precision requirements. Conclusions. The slower movements of older adults do not simply reflect a preference for online control, as older adults have less efficient movements when forced to reprogram their movements. Age-related motor slowing kinematically resembles that seen in patients with cerebellar dysfunction.

Data partitioning for parallel spatial join processing

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

Evolution of three-dimensional folds for a non-Newtonian plate in a viscous medium

We derive analytical solutions for the three-dimensional time-dependent buckling of a non-Newtonian viscous plate in a less viscous medium. For the plate we assume a power-law rheology. The principal, axes of the stretching D-ij in the homogeneously deformed ground state are parallel and orthogonal to the bounding surfaces of the plate in the flat state. In the model formulation the action of the less viscous medium is replaced by equivalent reaction forces. The reaction forces are assumed to be parallel to the normal vector of the deformed plate surfaces. As a consequence, the buckling process is driven by the differences between the in-plane stresses and out of plane stress, and not by the in-plane stresses alone as assumed in previous models. The governing differential equation is essentially an orthotropic plate equation for rate dependent material, under biaxial pre-stress, supported by a viscous medium. The differential problem is solved by means of Fourier transformation and largest growth coefficients and corresponding wavenumbers are evaluated. We discuss in detail fold evolutions for isotropic in-plane stretching (D-11 = D-22), uniaxial plane straining (D-22 = 0) and in-plane flattening (D-11 = -2D(22)). Three-dimensional plots illustrate the stages of fold evolution for random initial perturbations or initial embryonic folds with axes non-parallel to the maximum compression axis. For all situations, one dominant set of folds develops normal to D-11, although the dominant wavelength differs from the Biot dominant wavelength except when the plate has a purely Newtonian viscosity. However, in the direction parallel to D-22, there exist infinitely many modes in the vicinity of the dominant wavelength which grow only marginally slower than the one corresponding to the dominant wavelength. This means that, except for very special initial conditions, the appearance of a three-dimensional fold will always be governed by at least two wavelengths. The wavelength in the direction parallel to D-11 is the dominant wavelength, and the wavelength(s) in the direction parallel to D-22 is determined essentially by the statistics of the initial state. A comparable sensitivity to the initial geometry does not exist in the classic two-dimensional folding models. In conformity with tradition we have applied Kirchhoff's hypothesis to constrain the cross-sectional rotations of the plate. We investigate the validity of this hypothesis within the framework of Reissner's plate theory. We also include a discussion of the effects of adding elasticity into the constitutive relations and show that there exist critical ratios of the relaxation times of the plate and the embedding medium for which two dominant wavelengths develop, one at ca. 2.5 of the classical Biot dominant wavelength and the other at ca. 0.45 of this wavelength. We propose that herein lies the origin of parasitic folds well known in natural examples.

Truncation errors in finite difference models for solute transport equation with first-order reaction

The truncation errors associated with finite difference solutions of the advection-dispersion equation with first-order reaction are formulated from a Taylor analysis. The error expressions are based on a general form of the corresponding difference equation and a temporally and spatially weighted parametric approach is used for differentiating among the various finite difference schemes. The numerical truncation errors are defined using Peclet and Courant numbers and a new Sink/Source dimensionless number. It is shown that all of the finite difference schemes suffer from truncation errors. Tn particular it is shown that the Crank-Nicolson approximation scheme does not have second order accuracy for this case. The effects of these truncation errors on the solution of an advection-dispersion equation with a first order reaction term are demonstrated by comparison with an analytical solution. The results show that these errors are not negligible and that correcting the finite difference scheme for them results in a more accurate solution. (C) 1999 Elsevier Science B.V. All rights reserved.

Building better wildlife-habitat models

Wildlife-habitat models are an important tool in wildlife management toda?, and by far the majority of these predict aspects of species distribution (abundance or presence) as a proxy measure of habitat quality. Unfortunately, few are tested on independent data, and of those that are, few show useful predictive st;ill. We demonstrate that six critical assumptions underlie distribution based wildlife-habitat models, all of which must be valid for the model to predict habitat quality. We outline these assumptions in a mete-model, and discuss methods for their validation. Even where all sis assumptions show a high level of validity, there is still a strong likelihood that the model will not predict habitat quality. However, the meta-model does suggest habitat quality can be predicted more accurately if distributional data are ignored, and variables more indicative of habitat quality are modelled instead.

Phase diagram for a class of spin-1/2 Heisenberg models interpolating between the square-lattice, the triangular-lattice, and the linear-chain limits

We study the spin-1/2 Heisenberg models on an anisotropic two-dimensional lattice which interpolates between the square lattice at one end, a set of decoupled spin chains on the other end, and the triangular-lattice Heisenberg model in between. By series expansions around two different dimer ground states and around various commensurate and incommensurate magnetically ordered states, we establish the phase diagram for this model of a frustrated antiferromagnet. We find a particularly rich phase diagram due to the interplay of magnetic frustration, quantum fluctuations, and varying dimensionality. There is a large region of the usual two-sublattice Neel phase, a three-sublattice phase for the triangular-lattice model, a region of incommensurate magnetic order around the triangular-lattice model, and regions in parameter space where there is no magnetic order. We find that the incommensurate ordering wave vector is in general altered from its classical value by quantum fluctuations. The regime of weakly coupled chains is particularly interesting and appears to be nearly critical. [S0163-1829(99)10421-1].

Programming internet based DAI applications in Qu-Prolog

This paper presents the unique collection of additional features of Qu-Prolog, a variant of the Al programming language Prolog, and illustrates how they can be used for implementing DAI applications. By this we mean applications comprising communicating information servers, expert systems, or agents, with sophisticated reasoning capabilities and internal concurrency. Such an application exploits the key features of Qu-Prolog: support for the programming of sound non-clausal inference systems, multi-threading, and high level inter-thread message communication between Qu-Prolog query threads anywhere on the internet. The inter-thread communication uses email style symbolic names for threads, allowing easy construction of distributed applications using public names for threads. How threads react to received messages is specified by a disjunction of reaction rules which the thread periodically executes. A communications API allows smooth integration of components written in C, which to Qu-Prolog, look like remote query threads.

Subgroup relations: A comparison of mutual intergroup differentiation and common ingroup identity models of prejudice reduction

Two studies examined relations between groups (humanities and math-science students) that implicitly or explicitly share a common superordinate category (university student). In Experiment 1, 178 participants performed a noninteractive decision-making task during which category salience was manipulated in a 2 (superordinate category salience) x 2 (subordinate category salience) between-groups design. Consistent with the mutual intergroup differentiation model, participants for whom both categories were salient exhibited the lowest levels of bias, whereas bias was strongest when the superordinate category alone was made salient. This pattern of results was replicated in Experiment 2 (N = 135). In addition, Experiment 2 demonstrated that members of subgroups that are nested within a superordinate category are more sensitive to how the superordinate category is represented than are members of subgroups that extend beyond the boundaries of the superordinate category.

Optimal release strategies for biological control agents: an application of stochastic dynamic programming to population management

1. Establishing biological control agents in the field is a major step in any classical biocontrol programme, yet there are few general guidelines to help the practitioner decide what factors might enhance the establishment of such agents. 2. A stochastic dynamic programming (SDP) approach, linked to a metapopulation model, was used to find optimal release strategies (number and size of releases), given constraints on time and the number of biocontrol agents available. By modelling within a decision-making framework we derived rules of thumb that will enable biocontrol workers to choose between management options, depending on the current state of the system. 3. When there are few well-established sites, making a few large releases is the optimal strategy. For other states of the system, the optimal strategy ranges from a few large releases, through a mixed strategy (a variety of release sizes), to many small releases, as the probability of establishment of smaller inocula increases. 4. Given that the probability of establishment is rarely a known entity, we also strongly recommend a mixed strategy in the early stages of a release programme, to accelerate learning and improve the chances of finding the optimal approach.