Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

聚类混合型数据的密度峰值改进算法

聚类混合型数据，通常是依据样本属性类别的不同分别进行评价。但这种将样本属性划分到不同子空间中分别度量的方式，割裂了样本属性原有的统一性；导致对样本个体的相似性评价产生了非一致的度量偏差。针对这一问题，提出以二进制编码样本属性，再由海明差异对属性编码施行统一度量的新的聚类算法。新算法通过在统一的框架内对混合型数据实施相似性度量，避免了对样本属性的切割，在此基础上又根据不同属性的性质赋予其不同的权重，并以此评价样本个体之间的相似程度。实验结果表明，新算法能够有效地聚类混合型数据；与已有的其他聚类算法相比较，表现出更好的聚类准确率及稳定性。     

基于大数据分析的分布式MOLAP技术研究

在计算机系统运行以及研究环节中,会存在大量的规模效应,此类状况难以避免,要想有效解决此类问题,就需要利用分布式的处理方式,开展对文件系统的分析。文章对分布式多维联机分析过程(MOLAP)的数据模型进行了分析,从维编码的算法、映射归约(MapReduce)算法的实现、分析维的遍历算法等方面作深入探讨。     

高等级生物安全实验室通风空调系统冗余设计原则探讨

对比分析了国内外标准有关高等级生物安全实验室通风空调系统冗余设计的要求。结合我国已有高等级生物安全实验室,重点分析了送风机、排风机、排风高效过滤器冗余设计的具体实施形式和存在的问题,给出了冗余设计原则建议。     

不同含量低污染水对人工湿地中细菌的影响研究

探究水平流人工湿地(HFCW)系统处理低污染水过程中,相同COD/ρ(TN)下不同碳氮含量对细菌群落结构的影响。结果表明,进水为较高碳氮含量的HFCW(HF1)和进水为较低碳氮含量的HFCW(HF2)对COD和TN的去除效率具有一定的差异,HF1和HF2对COD的去除效率分别为48.26%和28.89%,对TN的去除率分别为79.06%和81.87%。HF1中细菌的丰富度和多样性均高于HF2,HF1中富集的优势细菌为Chloroflexaceae、Comamonadaceae和Rhodocyclaceae,均具有异养反硝化功能,HF2中富集的优势细菌为Xanthomonadaceae和Rhodocyclaceae,其中Xanthomonadaceae具有自养反硝化功能。COD、NH4^+-N和NO3^--N对HF1中细菌群落的影响大于对HF2中细菌群落的影响,HF1中COD对细菌群落的影响大于NH4^+-N和NO3^--N。     

Sub-band coding of hexagonal images

According to the circle-packing theorem, the packing efficiency of a hexagonal lattice is higher than an equivalent square tessellation. Consequently, in several contexts, hexagonally sampled images compared to their Cartesian counterparts are better at preserving information content. In this paper, novel mapping techniques alongside the wavelet compression scheme are presented for hexagonal images. Specifically, we introduce two tree-based coding schemes, referred to as SBHex (spirally-mapped branch-coding for hexagonal images) and BBHex (breadth-first block-coding for hexagonal images). Both of these coding schemes respect the geometry of the hexagonal lattice and yield better compression results. Our empirical results show that the proposed algorithms for hexagonal images produce better reconstruction quality at low bits per pixel representations compared to the tree-based coding counterparts for the Cartesian grid.     

Two-Phase Bidirectional Dual-Relay Selection Strategy for Wireless Relay Networks

In this article, we introduce a new bi-directional dual-relay selection strategy with its bit error rate (BER) performance analysis. During the first step of the proposed strategy, two relays out of a set of N relay-nodes are selected in a way to optimize the system performance in terms of BER, based on the suggested algorithm which checks if the selected relays using the max-min criterion are the best ones. In the second step, the chosen relay-nodes perform an orthogonal space-time coding scheme using the two-phase relaying protocol to establish a bi-directional communication between the communicating terminals, leading to a significant improvement in the achievable coding and diversity gain. To further improve the overall system performance, the selected relay-nodes apply also a digital network coding scheme. Furthermore, this paper discusses the analytical approximation of the BER performance of the proposed strategy, where we prove that the analytical results match almost perfectly the simulated ones. Finally, our simulation results show that the proposed strategy outperforms the current state-of-the-art ones.     

The three Rs of river ecosystem resilience: Resources,recruitment, and refugia

Resilience in river ecosystems requires that organisms must persist in the face of highly dynamic hydrological and geomorphological variations. Disturbance events such as floods and droughts are postulated to shape life history traits that support resilience, but river management and conservation would benefit from greater understanding of the emergent effects in communities of river organisms. We unify current knowledge of taxonomic‐, phylogenetic‐, and trait‐based aspects of river communities that might aid the identification and quantification of resilience mechanisms. Temporal variations in river productivity, physical connectivity, and environmental heterogeneity resulting from floods and droughts are highlighted as key characteristics that promote resilience in these dynamic ecosystems. Three community‐wide mechanisms that underlie resilience are (a) partitioning (competition/facilitation) of dynamically varying resources, (b) dispersal, recolonization, and recruitment promoted by connectivity, and (c) functional redundancy in communities promoted by resource heterogeneity and refugia. Along with taxonomic and phylogenetic identity, biological traits related to feeding specialization, dispersal ability, and habitat specialization mediate organism responses to disturbance. Measures of these factors might also enable assessment of the relative contributions of different mechanisms to community resilience. Interactions between abiotic drivers and biotic aspects of resource use, dispersal, and persistence have clear implications for river conservation and management. To support these management needs, we propose a set of taxonomic, phylogenetic, and life‐history trait metrics that might be used to measure resilience mechanisms. By identifying such indicators, our proposed framework can enable targeted management strategies to adapt river ecosystems to global change.     

Self-learning residual model for fast intra CU size decision in 3D-HEVC

As an extension of the High Efficiency Video Coding (HEVC) standard, 3D-HEVC requires to encode multiple texture views and depth maps, which inherits the same quad-tree coding structure as HEVC. Due to the distinct properties of texture views and depth maps, existing fast intra prediction approaches were presented for the coding of texture views and depth maps, respectively. To further reduce the coding complexity of 3D-HEVC, a self-learning residual model-based fast coding unit (CU) size decision approach is proposed for the intra coding of both texture views and depth maps. Residual signal, which is defined as the difference between the original luminance pixel and the optimal prediction luminance pixel, is firstly extracted from each CU. Since residue signal is strongly correlated with the optimal CU partition, it is used as the feature of each CU. Then, a self-learning residual model is established by intra feature learning, which iteratively learns the features of the previously encoded coding tree unit (CTU) generated by itself. Finally, a binary classifier is developed with the self-learning residual model to early terminate CU size decision of both texture views and depth maps. Experimental results show the proposed fast intra CU size decision approach achieves 33.3% and 49.3% encoding time reduction on average for texture views and depth maps with negligible loss of overall video quality, respectively.