三轴应力下盐岩声发射特征研究（研究生论坛稿件）

利用MTS815 Flex Test GT岩石力学试验系统和PCI–2声发射(AE)三维定位实时监测系统,开展不同围压下盐岩的三轴压缩声发射定位试验,探讨盐岩轴向加载过程中声发射特征的围压效应。研究结果表明：盐岩AE定位点多少与振铃计数率大小、能率高低具有良好的一致性。声发射高计数、高能率、定位点集聚段等随围压增加而滞后。低围压下,盐岩发生剪切破坏,高计数、高能率、AE定位点集聚段主要出现在屈服阶段和峰值应力前阶段;高围压下,盐岩呈塑性大变形特征,高计数、高能率、AE定位点集聚段主要在峰值阶段及峰后阶段出现。围压增加,累计计数和定位点的总量呈减少趋势;最大能率和累计能量随围压增加而减小,5MPa约分别为30MPa的43倍和22倍。     

无理数字典码的测试数据压缩方案

提出了一种无理数字典码的测试数据压缩方案,能有效地压缩芯片测试数据。方案利用无理数序列建立字典,编码时只需进行相容性检查,无需填充无关位,简化了操作步骤;同时,选择局部压缩率最大的一组数据作为最终编码结果,保证压缩效果可以达到局部最优。对ISCAS 89标准电路Mintest集的实验结果显示,该方案的压缩效果优于传统压缩方法,如Golomb码、FDR码、混合定变长码等。     

Hadoop平台下的分形图像压缩编码

借助Hadoop平台实现了分形图像压缩编码,并将其应用于云渲染中对渲染后的图像进行压缩并传至用户阶段。采用4台PC机搭建Hadoop平台,并在此基础上进行分形图像压缩编码,实验结果表明,采用4台PC机的Hadoop平台并行压缩时间不到单台PC机压缩时间的30%,证实了该方案的现实有效性。采用分形压缩编码将云渲染后的图像传给用户具有压缩比大、传输时间短、解压缩快等特点,对改善云渲染用户体验具有重要意义。     

规模储氢技术及其研究进展

介绍了几种常用的储氢技术如高压压缩储氢技术、吸氢物质强化压缩储氢技术、液化储氢技术和金属氢化物储氢技术的研究进展,并对规模储氢技术的发展前景进行了预测和展望,指出规模储氢技术目前急待解决的问题是提高储氢密度、储氢安全性和降低储氢成本。     

基于GM（1，1）和线性回归模型在印刷包衬压缩变形中的数据预测研究

运用线性回归对预测数据进行分析,剔除异常数据,用GM（1,1）模型进行预测,有效降低了数据相对误差,提高了预测数据的精度。选用印刷包衬压缩变形的压缩变形量值,用线性回归进行数据分析并剔除异常数据后用GM（1,1）进行预测,使得预测数据具有更高的准确性和适应性。实验及仿真结果表明,经过前期数据分析整理后的灰色预测模型,其预测期望值远优于单纯的回归模型和GM（1,1）模型。     

基于JPEG标准静止图像压缩算法的分析与研究

介绍了JPEG标准、JPEG2000标准及其相比JPEG标准的改进和优点。通过对JPEG标准压缩流程及算法的分析与研究,得到JPEG标准压缩的基本原理：利用人类的视觉特点对亮度分量的精度敏感,而对色度分量的精度迟钝,将RGB颜色模式转换为YCrCb颜色模式;基于视觉特点来抑制高频部分使用离散余弦变换和量化来实现;应用完全可逆的熵编码即霍夫曼编码使比特序列更小。     

基于CT扫描的致密砂岩脆性破坏裂纹扩展规律研究

岩石在荷载作用下产生宏观破坏,其破裂面细观形态变化可以直接地反映出结构破坏特征。目前,常采用扫描电镜法、透镜法和CT扫描技术对岩石细观结构进行表征。运用CT扫描技术对典型脆性岩样单轴压缩破坏后破裂面及全断面进行扫描,获取全断面的细观形态,分析和总结了典型脆性岩样破坏细观裂纹扩展的发展规律:每一条独立裂纹都以一恒定曲率半径系数K随层位向试样内部扩展,直至裂纹曲率半径趋近于无穷。此时若无其他因素影响,其曲率半径则不会再随层位继续扩展;并通过分析定义出岩石脆性破坏状态时裂纹的聚集域和非聚集域,同时根据能量守恒定律得出了衍生裂纹及新次生裂纹产生的判据。     

Robust Treatment of Degenerate Elements in Interactive Corotational FEM Simulations

We address the problem of robust and efficient treatment of element collapse and inversion in corotational FEM simulations of deformable objects in two and three dimensions, and show that existing degeneration treatment methods have previously unreported flaws that seriously threaten robustness and physical plausibility in interactive applications. We propose a new method that avoids such flaws, yields faster and smoother degeneration recovery and extends the range of well‐behaved degenerate configurations without adding significant complexity or computational cost to standard explicit and quasi‐implicit solvers.     

Automatic 3D Indoor Scene Updating with RGBD Cameras

Since indoor scenes are frequently changed in daily life, such as re‐layout of furniture, the 3D reconstructions for them should be flexible and easy to update. We present an automatic 3D scene update algorithm to indoor scenes by capturing scene variation with RGBD cameras. We assume an initial scene has been reconstructed in advance in manual or other semi‐automatic way before the change, and automatically update the reconstruction according to the newly captured RGBD images of the real scene update. It starts with an automatic segmentation process without manual interaction, which benefits from accurate labeling training from the initial 3D scene. After the segmentation, objects captured by RGBD camera are extracted to form a local updated scene. We formulate an optimization problem to compare to the initial scene to locate moved objects. The moved objects are then integrated with static objects in the initial scene to generate a new 3D scene. We demonstrate the efficiency and robustness of our approach by updating the 3D scene of several real‐world scenes.     

On‐the‐fly generation and rendering of infinite cities on the GPU

In this paper, we present a new approach for shape‐grammar‐based generation and rendering of huge cities in real‐time on the graphics processing unit (GPU). Traditional approaches rely on evaluating a shape grammar and storing the geometry produced as a preprocessing step. During rendering, the pregenerated data is then streamed to the GPU. By interweaving generation and rendering, we overcome the problems and limitations of streaming pregenerated data. Using our methods of visibility pruning and adaptive level of detail, we are able to dynamically generate only the geometry needed to render the current view in real‐time directly on the GPU. We also present a robust and efficient way to dynamically update a scene's derivation tree and geometry, enabling us to exploit frame‐to‐frame coherence. Our combined generation and rendering is significantly faster than all previous work. For detailed scenes, we are capable of generating geometry more rapidly than even just copying pregenerated data from main memory, enabling us to render cities with thousands of buildings at up to 100 frames per second, even with the camera moving at supersonic speed.