利用反射纵波评价裂缝倾角的模拟实验研究

声波全波列测井中的反射纵波可以用来评价高角度裂缝和对井周附近地质结构进行成像。目前的研究主要侧重于直接从波形资料处理出发计算裂缝的位置和倾角 ,其可靠性和准确性无从评价和校验。文中采用模拟实验的方法记录了倾角为 6 0°～80°范围内的 8种倾角裂缝的反射脉冲纵波波形 ,自行推导了反演裂缝倾角的公式 ,结合波场分离技术对实验测量波形数据进行了处理 ,计算出的裂缝倾角与实际值具有良好的一致性。本文结果表明 ,利用至少 2个深度点的纵波反射波波形资料就可以准确地反演裂缝的倾角     

Recovery of fluorocarbons in Japan as a measure for abating global warming

The objective of this study is to evaluate the potential for recovering fluorocarbons as measures for the abatement of global warming. In this study, we focused on the three different kinds of fluorocarbons: CFCs, HCFCs and HFCs, and targeted refrigerant use because of the availability of relevant data. We first estimated future fluorocarbon emissions from the targeted appliances; we next compared those emissions in the units of CO₂ equivalent to the level of CO₂ emissions in 1990 from a quantitative point of view. As the result of this study, it was found that fluorocarbon emissions in 1999 and 2010 would be equal to approximately 7 and 3% of the level of CO₂ emissions in 1990 respectively. Moreover, if we implement a 100% recovery rate in every recovery route, we can reduce a large amount of emissions which correspond to approximately 2–5% of the level of CO₂ emissions in 1990, even if we take into account the energy-related CO₂ emissions by the transportation and decomposition of fluorocarbons.     

分析型全蒸发器在啤酒挥发性成分测定中的应用

综述了分型全蒸发器技术在啤酒发酵过程中的应用状况，并介绍了分析型全蒸发器模型结构及与之配合使用的连续多分支管。     

IPv6与欧洲

在推进IPv6的问题上,亚洲表现的最为积极,这是因为亚洲各国承受着巨大的IP地址方面的压力。欧洲虽然在这方面没有这样大的压力,但在互联网方面一直落后于美国,这是欧洲所不甘心的。因此,欧洲在推进IPv6方面也做了许多工作。欧洲推进IPv6的基本策略是先移动,后固定,并实施了一系列的行动计划和项目。欧洲面临的挑战主要是已经部署了数量巨大的网元、操作系统与软件应用必须予以更新、互通或取代,需要仔细规划和大量投资。     

中国电子商务思考

网络经济持续走低，但电子商务的发展大方向是不会改变的。在中国，目前的主要问题是宽带网的重复建设、认证机构建设缺乏有效监管、电子商务立法滞后、物流配送系统不完善、标准化问题成为电子商务发展的障碍等，当前应做的主要是：政策的宏观引导、示范推广、加强对宽带网和认证机构建设的监管等。     

可拓检测的方案生成

以可拓学理论为基础，论述了可拓检测的有关定义和概念，提出了可拓检测的方案生成方法及过程，同时探讨了检测方法的优化和评价方法。     

Adaptive cell division for ray tracing

In ray tracing the two most commonly used data structures are the octree and uniform cell division. The octree structure allows efficient adaptive subdivision of space, while taking care of the spatial coherence of the objects in it; however, the tree structure locating the next node in the path of a ray is complex and time consuming. The cell structure, on the other hand, can be stored in a three-dimensional array, and each cell can be efficiently accessed by specifying three indices. However, such a uniform cell division does not take care of object coherence. The proposed data structure combines the positive features of the above data structures while minimising their disadvantages. The entire object space is implicitly assumed to be a three-dimensional grid of cells. Initially, the entire object space is a single voxel which later undergoes “adaptive cell division.” But, unlike in the octree structure, where each voxel is divided exactly at the middle of each dimension, in adaptive cell division, each voxel is divided at the nearest cell boundary. The result is that each voxel contains an integral number of cells along each axis. Corresponding to the implicit cell division we maintain a three-dimensional array, with each array element containing the voxel number which is used to index into the voxel array. The voxel array is used to store information about the structure of each voxel, in particular, the objects in each voxel. While a ray moves from one voxel to another we always keep track of the cell through which the ray is currently passing. Since only arrays are involved in accessing the next voxel in the path of the ray, the operation is very efficient.