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.     

基于RISC架构的多串口网口通信管理装置

介绍了一种工控行业基于精简指令集计算机（RISC）架构的多串口网口通信管理装置在水电厂计算机监控系统中的设计及应用。阐述了该装置的硬件结构、软件结构、功能设置和实际应用等方面的内容,可以根据编程规范对该装置进行二次开发,具有一定工程有效性。     

基于Hyperion数据的铜矿信息直接和间接提取方法研究

针对不同的地表覆盖条件,研究基于Hyperion星载高光谱数据的砂页岩型铜矿信息提取方法。首先对Hyperion L1级数据进行波段筛选、坏线修复、大气纠正和几何纠正等预处理,然后分别针对不同的植被覆盖情况使用不同的信息提取方法。在岩石裸露区,直接使用光谱角制图法;在植被覆盖区,使用铜金属离子的积累导致的植被生理异常作为间接标志来识别铜矿信息,生理异常使用高光谱植被指数来计算。结果表明,综合使用这两种方法的互补信息能够便于提取复杂地表覆盖情况下的铜矿信息。     

基于强化学习的自适应多Agent系统的构造

自适应系统所处的环境往往是不确定的,其变化事先难以预测,如何支持这种环境下复杂自适应系统的开发已经成为软件工程领域面临的一项重要挑战.强化学习是机器学习领域中的一个重要分支,强化学习系统能够通过不断试错的方式,学习环境状态到可执行动作的最优对应策略.本文针对自适应系统环境不确定的问题,将Agent技术与强化学习技术相结...     

面向对象有限元并行计算框架PANDA的多物理场耦合服务

针对结构分析软件面向多物理场的应用,分析讨论面向对象有限元并行计算框架PANDA的多物理场耦合服务设计,即多物理场分析类型的扩充能力、不同物理场间的数据传递和多物理场耦合分析的求解策略.在PANDA提供的多物理场耦合服务的基础上,开展热-力耦合分析功能的程序开发,实现热弹性分析功能.热弹性分析算例计算结果与ANSYS的...     

Retrieving ocean surface current by 4-D variational assimilation of sea surface temperature images

In this article we propose a new method to estimate ocean mesoscale structures of the surface current velocity by processing sea surface satellite images. Assuming that the intensity level can be described by a transport-diffusion equation, the proposed approach is based on variational assimilation of image observations within a simple transport-diffusion model. This approach permits to retrieve the current velocity field from a sequence of satellite images. Results of processing synthetic data and real NOAA-AVHRR satellite images are presented and commented.     

A fast and fully automatic registration approach based on point features for multi-source remote-sensing images

Automatic registration of multi-source remote-sensing images is a difficult task as it must deal with the varying illuminations and resolutions of the images, different perspectives and the local deformations within the images. This paper proposes a fully automatic and fast non-rigid image registration technique that addresses those issues. The proposed technique performs a pre-registration process that coarsely aligns the input image to the reference image by automatically detecting their matching points by using the scale invariant feature transform (SIFT) method and an affine transformation model. Once the coarse registration is completed, it performs a fine-scale registration process based on a piecewise linear transformation technique using feature points that are detected by the Harris corner detector. The registration process firstly finds in succession, tie point pairs between the input and the reference image by detecting Harris corners and applying a cross-matching strategy based on a wavelet pyramid for a fast search speed. Tie point pairs with large errors are pruned by an error-checking step. The input image is then rectified by using triangulated irregular networks (TINs) to deal with irregular local deformations caused by the fluctuation of the terrain. For each triangular facet of the TIN, affine transformations are estimated and applied for rectification. Experiments with Quickbird, SPOT5, SPOT4, TM remote-sensing images of the Hangzhou area in China demonstrate the efficiency and the accuracy of the proposed technique for multi-source remote-sensing image registration.     

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.