Mathematical model to identify nitrogen variability in large rivers

The river Swale in Yorkshire, northern England has been the subject of many studies concerning water quality. This paper builds on existing data resources and previous 1D river water quality modelling applications at daily resolution (using QUESTOR) to provide a different perspective on understanding pollution, through simulation of the short‐term dynamics of nutrient transport along the river. The two main objectives are (1) building, calibration and evaluation of a detailed mathematical model (Advection‐Dispersion Model: ADModel), for nutrient transport under unsteady flow conditions and (2) the development of methods for estimating key parameters characterizing pollutant transport (velocity, dispersion coefficient and transformation rates) as functions of hydrological parameters and/or seasonality. The study of ammonium and nitrate has highlighted temporal variability in processes, with maximum nitrification and denitrification rates during autumn. Results show that ADModel is able to predict the main trend of measured concentration with reasonable accuracy and accounts for temporal changes in water flow and pollutant load along the river. Prediction accuracy could be improved through more detailed modelling of transformation processes by taking into account the variability of factors for which existing data were insufficient to allow representation. For example, modelling indicates that interactions with bed sediment may provide an additional source of nutrients during high spring flows. Copyright © 2010 John Wiley & Sons, Ltd.     

Impoverishment of YOY‐fish assemblages by intense commercial navigation in a large Lowland river

Navigation‐induced physical forces have been suggested to modify the structure of riverine fish assemblages by impeding especially the recruitment of littoral bound species. To investigate the effect of vessel frequency on fish, we compared the composition and seasonal succession of young‐of‐the‐year (YOY) fish assemblages in three similarly degraded river reaches differing in average vessel passages (2, 6 and 41 per day). Fish were caught by electrofishing biweekly between May and September. Multivariate tests were used to analyse differences between YOY‐fish assemblages and hurdle regression models applied to determine abiotic factors predicting fish occurrence and abundance. Roach (Rutilus rutilus) and perch (Perca fluviatilis) densities were compared. Roach larvae remain in the littoral zone while perch larvae shift to the pelagic zone immediately after hatch. YOY‐fish assemblage structure substantially changed along the traffic intensity gradient. In the high traffic intensity reach, species number and total fish density were markedly reduced compared to the other reaches. Roach densities were lowest in the high traffic intensity reach whereas perch densities did not decline along the gradient. Hurdle regressions confirmed a stronger effect of commercial navigation traffic intensity on roach than on perch. The total zooplankton biomass was highest in the high traffic intensity reach. Our results provide empirical evidence that intensive commercial navigation impoverishes fish assemblages in width‐restricted waterways. They underlined that in particular those species that have their first nursery habitats in shoreline areas were more affected by intensive commercial navigation than species whose larvae live predominantly pelagic. The results indicate that the negative effect of intensive navigation on riverine fish results primarily from the navigation‐induced hydraulic disturbances along the banks. Therefore, mitigation of navigation‐induced hydraulic forces is required to prevent degradation of fish communities in waterways. Copyright © 2010 John Wiley & Sons, Ltd.     

Validation of GOES and MODIS active fire detection products using ASTER and ETM+ data

In this study we implemented a comprehensive analysis to validate the MODIS and GOES satellite active fire detection products (MOD14 and WFABBA, respectively) and characterize their major sources of omission and commission errors which have important implications for a large community of fire data users. Our analyses were primarily based on the use of 30 m resolution ASTER and ETM+ imagery as our validation data. We found that at the 50% true positive detection probability mark, WFABBA requires four times more active fire area than is necessary for MOD14 to achieve the same probability of detection, despite the 16× factor separating the nominal spatial resolutions of the two products. Approximately 75% and 95% of all fires sampled were omitted by the MOD14 and WFABBA instantaneous products, respectively; whereas an omission error of 38% was obtained for WFABBA when considering the 30-minute interval of the GOES data. Commission errors for MOD14 and WFABBA were found to be similar and highly dependent on the vegetation conditions of the areas imaged, with the larger commission errors (approximately 35%) estimated over regions of active deforestation. Nonetheless, the vast majority (> 80%) of the commission errors were indeed associated with recent burning activity where scars could be visually confirmed in the higher resolution data. Differences in thermal dynamics of vegetated and non-vegetated areas were found to produce a reduction of approximately 50% in the commission errors estimated towards the hours of maximum fire activity (i.e., early-afternoon hours) which coincided with the MODIS/Aqua overpass. Lastly, we demonstrate the potential use of temporal metrics applied to the mid-infrared bands of MODIS and GOES data to reduce the commission errors found with the validation analyses.     

Exaggerating Character Motions Using Sub‐Joint Hierarchy

Motion capture cannot generate cartoon‐style animation directly. We emulate the rubber‐like exaggerations common in traditional character animation as a means of converting motion capture data into cartoon‐like movement. We achieve this using trajectory‐based motion exaggeration while allowing the violation of link‐length constraints. We extend this technique to obtain smooth, rubber‐like motion by dividing the original links into shorter sub‐links and computing the positions of joints using Bézier curve interpolation and a mass‐spring simulation. This method is fast enough to be used in real time.     

Raycasting of Light Field Galleries from Volumetric Data

The paper describes a technique to generate high‐quality light field representations from volumetric data. We show how light field galleries can be created to give unexperienced audiences access to interactive high‐quality volume renditions. The proposed light field representation is lightweight with respect to storage and bandwidth capacity and is thus ideal as exchange format for visualization results, especially for web galleries. The approach expands an existing sphere‐hemisphere parameterization for the light field with per‐pixel depth. High‐quality paraboloid maps from volumetric data are generated using GPU‐based ray‐casting or slicing approaches. Different layers, such as isosurfaces, but not restricted to, can be generated independently and composited in real time. This allows the user to interactively explore the model and to change visibility parameters at run‐time.     

Tensor Clustering for Rendering Many‐Light Animations

Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation.     

A Hidden‐picture Puzzles Generator

A hidden‐picture puzzle contains objects hidden in a background image, in such a way that each object fits closely into a local region of the background. Our system converts image of the background and objects into line drawing, and then finds places in which to hide transformed versions of the objects using rotation‐invariant shape context matching. During the hiding process, each object is subjected to a slight deformation to enhance its similarity to the background. The results were assessed by a panel of puzzle‐solvers.     

Camera Control in Computer Graphics

Recent progress in modelling, animation and rendering means that rich, high fidelity virtual worlds are found in many interactive graphics applications. However, the viewer's experience of a 3D world is dependent on the nature of the virtual cinematography, in particular, the camera position, orientation and motion in relation to the elements of the scene and the action. Camera control encompasses viewpoint computation, motion planning and editing. We present a range of computer graphics applications and draw on insights from cinematographic practice in identifying their different requirements with regard to camera control. The nature of the camera control problem varies depending on these requirements, which range from augmented manual control (semi‐automatic) in interactive applications, to fully automated approaches. We review the full range of solution techniques from constraint‐based to optimization‐based approaches, and conclude with an examination of occlusion management and expressiveness in the context of declarative approaches to camera control.     

Model driven middleware: A new paradigm for developing distributed real-time and embedded systems

Distributed real-time and embedded (DRE) systems have become critical in domains such as avionics (e.g., flight mission computers), telecommunications (e.g., wireless phone services), tele-medicine (e.g., robotic surgery), and defense applications (e.g., total ship computing environments). These types of system are increasingly interconnected via wireless and wireline networks to form systems of systems. A challenging requirement for these DRE systems involves supporting a diverse set of quality of service (QoS) properties, such as predictable latency/jitter, throughput guarantees, scalability, 24x7 availability, dependability, and security that must be satisfied simultaneously in real-time. Although increasing portions of DRE systems are based on QoS-enabled commercial-off-the-shelf (COTS) hardware and software components, the complexity of managing long lifecycles (often ∼15-30 years) remains a key challenge for DRE developers and system integrators. For example, substantial time and effort is spent retrofitting DRE applications when the underlying COTS technology infrastructure changes.This paper provides two contributions that help improve the development, validation, and integration of DRE systems throughout their lifecycles. First, we illustrate the challenges in creating and deploying QoS-enabled component middleware-based DRE applications and describe our approach to resolving these challenges based on a new software paradigm called Model Driven Middleware (MDM), which combines model-based software development techniques with QoS-enabled component middleware to address key challenges faced by developers of DRE systems — particularly composition, integration, and assured QoS for end-to-end operations. Second, we describe the structure and functionality of CoSMIC (Component Synthesis using Model Integrated Computing), which is an MDM toolsuite that addresses key DRE application and middleware lifecycle challenges, including partitioning the components to use distributed resources effectively, validating software configurations, assuring multiple simultaneous QoS properties in real-time, and safeguarding against rapidly changing technology.     

Matrix Interpretations for Proving Termination of Term Rewriting

We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every rewrite step causes a decrease, but instead of the usual natural numbers we use vectors of natural numbers, ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by linear mappings represented by matrices. This method allows us to prove termination and relative termination. A modification of the latter, in which strict steps are only allowed at the top, turns out to be helpful in combination with the dependency pair transformation. By bounding the dimension and the matrix coefficients, the search problem becomes finite. Our implementation transforms it to a Boolean satisfiability problem (SAT), to be solved by a state-of-the-art SAT solver.