采用数据流图的故障模型生成算法及其应用

为有效地解决系统级故障注入试验建模困难问题,提出语言级生成数据流图,并以此构造动态故障树的故障模型建立方法.通过对故障过程数据流分析,找出数据依赖关系并构造了故障模型生成算法.与其他方法比较,本算法具有动态性,提高了故障覆盖率,减少了系统开销,使故障注入试验更易实现.     

Visitor-artwork network analysis using object detection with image-retrieval technique

Recent museum exhibitions are becoming a means by which to satisfy visitor demands. In order to provide visitor-centric exhibitions, artwork must be analyzed based on the behavior of visitors, and not merely according to museum professionals' points of view. This study aims to analyze the relationship between museum visitors and artwork via a network analysis based on visitor behavior using object detection techniques. Cameras installed in a museum recorded visitors, and an object detector with a content-based image-retrieval technique tracked visitors from the videos. The durations spent with different artworks were measured, and the data was converted into a bipartite graph. The relationships between different artwork types were analyzed with a visitor-centered artwork network. Based on the visitors’ behavior, significant artworks were identified and the artwork network was compared to the arrangement of the museum. The tendency of edges in the artwork network was also examined considering visitors' preferences for artworks. The method used here makes it possible to collect quantitative data, with the results possibly used as a basis and for reference when analyzing artwork in a visitor-centered approach.     

低碳能效型水利数据中心的规划与建设

围绕对低碳能效型水利数据中心的认识与理解,从数据中心基础设施规划与建设的角度,对基本内涵、设计理念、实施方法、最佳实践、核心技术等展开分析和讨论,以期在新建或改造水利数据中心的过程中发挥一定作用,满足数据中心建设绿色环保、节能减排的要求,顺应未来新一代数据中心发展的趋势。     

Approximation algorithm for coloring of dotted interval graphs

Dotted interval graphs were introduced by Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348] as a generalization of interval graphs. The problem of coloring these graphs found application in high-throughput genotyping. Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] improves the approximation ratio of Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In this work we improve the approximation ratio of Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] and Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In the exposition we develop a generalization of the problem of finding the maximum number of non-attacking queens on a triangle.     

Perceptual image preview

Image preview is a convenient way to browse large or multiple images on small displays. However, current signal-level image resampling algorithms may remove many features of interest in the preview image. In this paper, we propose perceptual image preview which retains more perceptual features such that users can inspect features of interest by viewing the preview image only and without zooming in. This technology has two components, structure enhancement and perceptual feature visualization. Structure enhancement enhances the image structure while suppressing subtle details using a gradient modulation method, thus making the succedent perceptual features more apparent. For perceptual feature visualization, features of interest detected in the picture is visualized on the structure enhanced preview image. We demonstrate with two examples of most commonly used image quality features, image blur and noise. The effectiveness of the proposed method is validated by experimental results.     

Sammi简介——基于Client/Server结构和Web结构的软件开发工具

该文介绍了一个基于Web结构和Client/Server结构的软件开发工具sammi,用于创建图型、嵌入应用程序的人机标准平台。     

语义桌面环境下一种基于概念图的文档检索方法

语义桌面作为语义Web的一个重要分支,可以为个人计算机用户提供丰富的元数据,用以记录桌面文档的各种特征。这些特征包括文件的常规属性和与用户行为相关的属性,它们为桌面文档检索提供帮助。受到"概念图"理论的启发,本文提出了一种语义桌面环境下的文档检索算法。该算法能有效地利用语义桌面提供的元数据建立一种便于快速查找的文档索引结构,迅速地确定用户查询与桌面文档之间的投影算子。实验表明,该算法的时间效率比以往的基于匹配推理的投影算法有很大的提高,可以在很大程度上满足用户对桌面文档进行快速检索的需求。     

一种基于图论的聚类算法NeiMu

提出一种新的基于图论的聚类算法NeiMu。该算法首先分析数据中的对象,寻找每个对象的k近邻,根据k近邻关系构造k近邻有向图,然后通过k近邻有向图中的k-互邻居关系构造k-聚类图,发现数据中的自然聚类。算法的特点是根据数据之间的互为k近邻关系确定数据中的自然簇,而不必引入其他方法来划分小簇,从而能够保证对象不会被错误聚类,仅会与其他小簇一起融合到一个大簇中。这一优点可以有效保证NeiMu算法的聚类质量。而且,NeiMu算法给出的这种类似自底向上的层次聚类结果还有利于用户根据渐变的结果确定最佳的k值。实验结果表明,该算法对密度变化大的数据、大小相差大的数据、任意分布形状的数据均具有很好的聚类质量,对孤立点也很健壮。     

社会网络信息的本体论建模与可视化

本体论是共享概念模型的明确的形式化规范说明,基于本体论对社会网络信息建模能够提供客观存在的本质认识,发挥本体论在信息表示与组织上的优势.提出一种针对社会网络信息的领域本体模型,将社会网络信息领域的客观存在抽象为3个主要本体:行动者、关系网络和群组,能够方便地定义各种社会网络分析与可视化方法,为社会网络信息可视化应用提供支持.着眼于社会网络结构分析中的需求,在上述模型框架下提出了基于规则对等组的群组分析方法和基于群组、角色分析的力导引布点算法.最后结合恐怖活动信息可视化实例,阐述了文中提出的领域模型与可视化方法的应用.     

非结构矢量场的特征区域可视化方法

基于特征比对的可视化方法涉及的问题主要包括,如何判断一个矢量场中是否存在另一个矢量场中的一些特定结构,如何评价两个矢量场结构间存在的相似性,如何从诸多矢量场中将这些特定的结构检测,定位并绘制出来.给出了一种基于曲线结构的矢量场特征区域可视化方法,该方法通过构造与曲线结构相关联的柱坐标系,保证了提取特征的平移、旋转和尺度不变性;采用曲线积分的Clifford Fourier变换,获取了曲线结构的频域特征并简化计算;利用多曲线结构匹配和多尺度逼近等方法,实现了区域结构的特征可视化.