Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes

We present methods to generate rendering sequences for triangle meshes which preserve mesh locality as much as possible. This is useful for maximizing vertex reuse when rendering the mesh using a FIFO vertex buffer, such as those available in modern 3D graphics hardware. The sequences are universal in the sense that they perform well for all sizes of vertex buffers, and generalize to progressive meshes. This has been verified experimentally.     

从《左传》录诗看孔子是否删诗

孔子是否删诗，这是一个历史遗留问题。司马迁首言在前，孔颖达怀疑在后。宋之后，争议遂起，延至近代。今人夏传才先生断日：孔子是否删诗，“在没有发掘出新史料的情况下，哪怕再争论八百年，也是搞不清楚的”。以此止息纷争。话虽不错，但问题并没有解决。我认为，在没有发掘出新史料的情况下，可以从《左传》入手，来考察孔子是否删诗。     

Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem

It is proved that, for any r ∈ { 2n, 2n + 1,…, 3n−2} and only for such r, the polytope of a three-index axial assignment problem of order n, n ≥ 2, contains completely r-noninteger vertices (r-CNVs), i.e., vertices such that all their positive components are fractional and their number equals r. For each r ∈ {2n, 2n + 1,…, 3n −2}, all the types of r-CNVs are characterized and the combinatorial properties of completely r-noninteger vertices of the polytope are studied. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 33–44, January–February 2007.     

Linux下高效存储优化的研究

随着数据的指数性增长,存储技术成为信息产业发展的核心动力,存储系统在一定程度上比计算系统和通信系统更加重要。如何高效地存储和优化存储空间,是存储系统急需解决的问题。本文介绍高效存储技术中的RAID技术、重复数据删除技术、数据压缩技术等,并在Linux环境下设计与实现具有高效存储优化特点的应用程序。试验表明该应用程序实现了软件RAID,删除了重复性数据,提高了存储空间利用率,降低了存储能耗。     

旋转固体火箭发动机统一流场计算

为了进一步研究旋转对固体火箭发动机工作的影响,采用RSM湍流模型对内孔燃烧、内孔与端面同时燃烧管状装药旋转固体火箭发动机统一流场进行了仿真。采用UDF编程给出质量入口边界,获得了旋转条件下发动机内流场结构参数特点,并给予理论说明。计算结果表明,内孔燃烧装药发动机切向速度流场类似于典型的Rankine涡,端面和内孔同时燃烧装药发动机切向速度流场呈现出Rankine涡和由端面燃烧引起的强迫涡的复杂组合涡;在发动机前封头和喷管喉部涡核切向速度峰值非常大,使燃烧室前封头和喷管喉部工作环境显著恶化;旋转使发动机燃烧室压力沿径向逐渐增大,强迫涡附近的压力梯度远大于推进剂表面的压力梯度。     

基于特征迭代的云存储数据即时确定性删除方法

传统数据删除方法易受到云存储环境中大量近似特征的影响,产生冗余数据,导致加解密时间过长、密钥可用率较低,为此提出一种基于特征迭代的云存储数据即时确定性删除方法。首先,提取云存储数据中的冗余数据特征,对云存储下冗余数据进行分类,迭代直至收敛,实现冗余数据高性能删除;其次,采用加密机制实现云存储数据在网络用户间的安全共享,将原始数据密文切分为剩余密文和采样密文;最后,把不完整的剩余数据密文上传至云端,同时引入可信任第三方对取样密文进行保存,通过销毁取样密文实现数据即时确定性删除。实验结果表明,所提方法的数据密文拆分所用时间较短,且密钥可用率较高,可达90%,说明其方法能够有效满足云存储系统中对冗余数据或过期数据的确定性删除要求。     

Depth-based complexity traces of graphs

In this paper we aim to characterize graphs in terms of a structural measure of complexity. Our idea is to decompose a graph into layered substructures of increasing size, and then to measure the information content of these substructures. To locate dominant substructures within a graph, we commence by identifying a centroid vertex which has the minimum shortest path length variance to the remaining vertices. For each graph a family of centroid expansion subgraphs is derived from the centroid vertex in order to capture dominant structural characteristics of the graph. Since the centroid vertex is identified through a global analysis of the shortest path length distribution, the expansion subgraphs provide a fine representation of a graph structure. We then show how to characterize graphs using depth-based complexity traces. Here we explore two different strategies. The first strategy is to measure how the entropies on the centroid expansion subgraphs vary with the increasing size of the subgraphs. The second strategy is to measure how the entropy differences vary with the increasing size of the subgraphs. We perform graph classification in the principal component space of the complexity trace vectors. Experiments on graph datasets abstracted from some bioinformatics and computer vision databases demonstrate the effectiveness and efficiency of the proposed graph complexity traces. Our methods are competitive to state of the art methods.     

基于STL文件的Laplacian网格优化算法

针对直接重构得到且以STL文件格式存储的网格模型质量不高的问题, 提出了一种基于Laplacian坐标的网格模型全局优化算法。该算法在提高三角面片质量的同时可以很好地保持原网格模型的局部几何特征, 其核心思想是通过在最小二乘意义下求解由权重控制的包含顶点位置和拉普拉斯坐标双重约束的线性系统来对网格顶点进行重新定位。从实验结果可以看出, 该算法较以往的Lapacian优化算法在对网格细节特征的保持上有一定优势。     

A dual-affinity gene fusion system to express small recombinant proteins in a soluble form: expression and characterization of protein A deletion mutants

A novel gene fusion system to express and purify small recombinantproteins in Escherichia coli has been constructed. The conceptallows for affinity purification of soluble gene products bysequential albumin- and Zn²+-affinity chromatography. The dual-affinitysystem is well suited for expression of unstable proteins asonly full-length protein is obtained after purification andproteins gain proteolytic stability in the fusion protein. Herewe show that the dual-affinity approach can be used for theexpression of various unstable derivatives of a single IgG-bindingdomain based on staphylococcal protein A. Analysis of the proteolyticstabilities and the IgG-binding properties of the differentmutant proteins suggest that the model for the structure ofan IgG-binding domain must be re-evaluated.