汉江上游干支流沉积物细菌群落多样性和影响因素

为了解汉江上游干支流沉积物细菌多样性以及确定性过程和随机性过程在沉积物细菌群落构建过程中的相对重要性,基于Illumina高通量测序技术,分析了环境因子对细菌群落组成的影响,采用非度量多维尺度(NMDS)排序探究了季节之间沉积物细菌群落的差异,并结合中性群落模型和标准化随机率量化了确定性过程和随机过程对群落构建的影响。结果表明:汉江上游及其支流细菌群落主要由变形菌门(Proteobacteria)、拟杆菌门(Bacteroidetes)、蓝藻门(Cyanophyta)、浮霉菌门(Planctomycetes)和酸杆菌门(Acidobacteria)等组成；细菌群落在不同季节有显著差异；地理距离和环境因子对细菌群落结构影响较小,确定性过程并未在细菌群落组成中起到主导作用；随机过程很大程度上影响了群落在秋季和春季的组成,是沉积物细菌群落构建的主导因素。     

改进的CAGAN在虚拟试衣中的应用

针对CAGAN（Conditional Analogy GAN）换衣后效果模糊，在目标衣服与原始衣服长短不一致时效果一般，相对目标衣服保留过少的细节等问题做了相关研究并对CAGAN进行了改进，提出了新的虚拟试衣方式。经过改进的CAGAN生成一个粗糙的结果，由该结果得到目标衣服穿在模特身上改变形状后的mask，接下来利用mask对目标衣服进行变形，综合变形的衣服和第一步的结果便得到最终的试衣图像。实验结果表明，该方法解决了前面存在的问题，而且取得了非常好的效果。     

Coverage optimization algorithm based on VF-CS in mobile sensor network

A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.     

第二代高通量测序技术分析倒笃菜菌群

目的检测収酵食品倒笃菜中细菌和真菌菌群结构。方法利用第二代高通量测序对倒笃菜中的真菌和细菌菌群结构迚行测定分析。结果检测出倒笃菜产品中,细菌群落中占主要地位为假单胞菌属(Pseudomonas)、拟杆菌属(Bacteroides)和Faecalibacterium属,分别占比例为11.4%、9.3%和8.9%,而对収酵起至兲重要的芽孢乳杆菌属(Lactobacillus)仅占比例为1.1%。倒笃菜中真菌群落中占主要地位的真菌菌属为曲霉属(Aspergillus),占比为88.8%,而其余真菌占比仅为11.2%。其中,曲霉真菌属中存在可以产生真菌毒素的黄曲霉菌(A.flavus)、寄生曲霉菌(A.parasiticus)等。结论结果表明传统腌制倒笃菜产品中可能会存在一定的致病细菌与可产真菌毒素的真菌,从而有引起食品安全问题的风险,因此,应迚一步对倒笃菜微生物的安全性迚行深入检测分析。     

基于条件信息卷积生成对抗网络的图像识别

传统的图像识别方法需要大量有标签样本进行训练，且模型训练难以达到稳定。针对这些问题，结合条件生成网络和信息最大化生成网络的结构优势建立了条件信息卷积生成网络（C-Info-DCGAN）。模型增加图像的类别信息和潜在信息作为输入数据，然后利用Q网络去更好地发挥类别信息和潜在信息对训练的引导作用，并且利用深度卷积网络来加强对图像特征的提取能力。实验结果表明，该方法能够加快模型训练收敛速度，并有效提高图像识别的准确率。     

Asynchronous control for two‐dimensional hidden Markovian jump systems with partly known mode observation conditional probabilities

This study focuses on the asynchronous control problem for two‐dimensional discrete‐time hidden Markovian jump systems where the mode observation conditional probability matrix is partly known. Considering the original system modes are invisible, the observed modes emitted from an observer serve as an alternative for stability analysis and controller design where a mode observation conditional probability matrix is constructed to characterize the emission between system modes and observed modes. Specially, only partly known information of the mode observation conditional probability matrix is accessible. With the introduction of the free‐connection weighting matrices, the asymptotic mean square stability criterion is firstly derived based on Lyapunov method. This introduction provides a further degree of relaxation and less conservatism is therefore achieved. Secondly, we present synthesis conditions for asynchronous state feedback controller design given in terms of a set of interconnected linear matrix inequalities. Moreover, cluster concept based on the partitions of observed modes is adopted which helps to decrease the number of controllers and simplify the design complexity. A numerical example, regarding the cases with and without clustering of the observed modes, is presented to illustrate the effectiveness of the proposed method.     

基于改进CGANs的入侵检测方法研究

近年来,机器学习算法在入侵检测系统(IDS)中的应用获得越来越多的关注。然而,传统的机器学习算法更多的依赖于已知样本,因此需要尽可能多的数据样本来对模型进行训练。遗憾地是,随着越来越多未知攻击的出现,且用于训练的攻击样本具有不平衡性,传统的机器学习模型会遇到瓶颈。文章提出一种将改进后的条件生成对抗网络(CGANs)与深度神经网络(DNN)相结合的入侵检测模型(CGANs-DNN),通过解决样本不平衡性问题来提高检测模型对未知攻击类型或只有少数攻击样本类型的检测率。深度神经网络(DNN)具有表征数据潜在特征的能力,而经过改进后的条件CGANs,能够通过学习已知攻击样本潜在数据特征分布,来根据指定类型生成新的攻击样本。此外,与生成对抗网络(GANs)和变分自编码器(VAE)等无监督生成模型相比,CGANsDNN经过改进后加入梯度惩罚项,在训练的稳定性上有了很大地提升。通过NSL-KDD数据集对模型进行评估,与传统算法相比CGANs-DNN不仅在整体准确率、召回率和误报率等方面有更好的性能,而且对未知攻击和只有少数样本的攻击类型具有较高的检测率。     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.