Biofilm Responses to Flow Regulation by Dams in Mediterranean Rivers

Dams regulate downstream hydrology and modify water quality, which in turn can impinge on the biota, especially in rivers naturally subject to large hydrological variability, such as those under Mediterranean climate. The effect of dams on biofilms was analysed in three tributaries (Cinca, Siurana and Montsant) of the Ebro River (NE Spain). We hypothesized that flow regulation would lead to lower spatial variability of biofilms on the streambed and to a decrease in their metabolic rate per unit biomass, especially during low flow periods. Biofilm characteristics were studied in five transects evenly spaced along river reaches upstream (control) and downstream (impact) of dams in each river, along with riverbed granulometry, hydraulics and water chemistry. Chlorophyll‐a, respiratory activity, photosynthetic capacity and efficiency, and extracellular enzymatic activities (β‐d ‐glucosidase, alkaline phosphatase and leucine‐amino‐peptidase) of epilithic biofilms were measured in different seasons. Spatial variability of chemical and biological variables was reduced downstream of the dams. Chlorophyll‐a concentration, photosynthetic efficiency and respiration capacity were higher in impact than in control reaches, but generally, low inorganic phosphorus concentrations resulted in comparable phosphatase activities downstream and upstream of dams. On the other hand, β‐d ‐glucosidase and leucine‐amino‐peptidase activities were higher at impact reaches. Biofilms were thicker and metabolically more active at the impact reaches, with higher ability to transform dissolved organic matter. Overall, results from this study provide evidence that dams can largely affect the structure and activity of river biofilms, with foreseeable important consequences for river ecosystem functioning. Copyright © 2014 John Wiley & Sons, Ltd.     

提升高等职业教育协同创新能力的对策选择

通过解析高等职业教育协同创新内涵,阐明高等职业教育协同创新的必要性,并从转变观念、构建现代职教体系和凸显办学特色三个方面探讨提升高等职业教育协同创新能力的对策选择。     

Memory leak detection in Plumbr

Platforms with automatic memory management, such as the JVM, are usually considered free of memory leaks. However, memory leaks can happen in such environments, as the garbage collector cannot free objects, which are not used by the application anymore, but are still referenced. Such unused objects can eventually fill up the heap and crash the application. Although this problem has been studied extensively, nevertheless, there are still many rooms for improvement in this area. This paper describes the statistical approach for memory leak detection, as an alternative, along with a commercial tool, Plumbr, which is based on the method. The tool is later analyzed with three case studies of real applications and in the process also analyzes strengths and weaknesses of the statistical approach for memory leak detection. Copyright © 2014 John Wiley & Sons, Ltd.     

Texture Mapping Real‐World Objects with Hydrographics

In the digital world, assigning arbitrary colors to an object is a simple operation thanks to texture mapping. However, in the real world, the same basic function of applying colors onto an object is far from trivial. One can specify colors during the fabrication process using a color 3D printer, but this does not apply to already existing objects. Paint and decals can be used during post‐fabrication, but they are challenging to apply on complex shapes. In this paper, we develop a method to enable texture mapping of physical objects, that is, we allow one to map an arbitrary color image onto a three‐dimensional object. Our approach builds upon hydrographics, a technique to transfer pigments printed on a sheet of polymer onto curved surfaces. We first describe a setup that makes the traditional water transfer printing process more accurate and consistent across prints. We then simulate the transfer process using a specialized parameterization to estimate the mapping between the planar color map and the object surface. We demonstrate that our approach enables the application of detailed color maps onto complex shapes such as 3D models of faces and anatomical casts.     

Computing Minimum Area Homologies

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.     

Distilled Collections from Textual Image Queries

We present a distillation algorithm which operates on a large, unstructured, and noisy collection of internet images returned from an online object query. We introduce the notion of a distilled set, which is a clean, coherent, and structured subset of inlier images. In addition, the object of interest is properly segmented out throughout the distilled set. Our approach is unsupervised, built on a novel clustering scheme, and solves the distillation and object segmentation problems simultaneously. In essence, instead of distilling the collection of images, we distill a collection of loosely cutout foreground “shapes”, which may or may not contain the queried object. Our key observation, which motivated our clustering scheme, is that outlier shapes are expected to be random in nature, whereas, inlier shapes, which do tightly enclose the object of interest, tend to be well supported by similar shapes captured in similar views. We analyze the commonalities among candidate foreground segments, without aiming to analyze their semantics, but simply by clustering similar shapes and considering only the most significant clusters representing non‐trivial shapes. We show that when tuned conservatively, our distillation algorithm is able to extract a near perfect subset of true inliers. Furthermore, we show that our technique scales well in the sense that the precision rate remains high, as the collection grows. We demonstrate the utility of our distillation results with a number of interesting graphics applications.     

一种融合多传感器信息的移动图像识别方法

多传感器数据融合作为一种特殊的数据处理手段在图像识别领域得到了较大的重视和发展, 本文提出了一种融合多传感器信息的移动图像识别方法. 首先通过在智能手机端提取带传感器信息的图像局部特征,增强局部特征的辨别能力; 其次改进了随机聚类森林的建立算法,减少了样本图像训练时间;最后使用快 速几何一致性校验对匹配结果进行检查, 保证算法的识别精度.实验结果表明,本文提出的方法能够快速 有效地识别移动图像,并具有较好的鲁棒性,同时与传统的Vocabulary tree 方法进行比较,本文方法的识别速度和精度较优,训练代价较低.     

Variable precision intuitionistic fuzzy rough set model and applications based on conflict distance

Due to the complexity and uncertainty of the physical world, as well as the limitation of human ability to comprehend, it is very difficult for any single method of uncertainty to effectively deal with the decision‐making problem that exists in real life. So, it is natural for us to think about incorporating the advantages of various theories of uncertainty to develop a more powerful hybrid method of soft decision‐making. In view of this recognition, the thought and method of intuitionistic fuzzy sets and variable precision rough sets are used to construct a novel intuitionistic fuzzy rough set model. With respect to the fact that the information system is intuitionistic fuzzy, the idea of measuring intuitionistic fuzzy similarity is used to define conflict distance. After that, this concept is combined with the variable precision rough sets so that a variable precision intuitionistic fuzzy rough set model is established, and its properties are investigated. After proposing an attribute reduction algorithm based on variable precision intuitionistic fuzzy rough sets, a case study is used to verify the feasibility and effectiveness of our novel model. The results show that our model indeed improves the classification ability of earlier models and possesses some ability to tolerate faults through adjusting the parameter λ and the confidence threshold β; it realizes the correct classification and extracts the decision rules.