Optimization of grid-drilling using computer simulation

A computer simulation method has been developed to find efficient drilling grids for mineral deposits. A well-known ore deposit is used as a model to develop an efficient pattern for undiscovered ore bodies in the same area or in other prospects where similar geometry is suspected. The model for this study is the Austinville, Virginia deposit, a Mississippi Valley-type deposit composed of 17 ore bodies totaling 34 million short tons (30 million metric tons). The method employs a computer program that simulates drilling the model deposit with different patterns, including various levels of follow-up drilling. Follow-up holes are drilled in fences at one half the original spacing around holes in the grid that show ore-grade mineralization. Each pattern is drilled 100 times from random starting locations to provide a range of outcomes of drilling, including the best, worst, and most likely. For this study, patterns of 100 drill holes were composed of 10 fences spaced 1000–5000 feet (305–1524 m) apart, each with 10 holes spaced 200–1000 feet (61–305 m) apart. In all, 25 grids were used with zero to three levels of follow-up drilling. The 600/2000 grid, with drill holes spaced 600 feet (183 m) apart in fences spaced 2000 feet (610 m) apart, was compared with the 200/5000 grid because they represented contrasting outcomes. The 600/2000 grid penetrated many ore bodies consistently but with few multiple hits to individual ore bodies; whereas the 200/5000 grid inconsistently penetrated few ore bodies with many multiple hits. The 600/2000 grid was more efficient than the 200/5000 grid at hitting large ore bodies of 1,000,000 short tons or greater (900,000 metric tons or greater) and was made more effective by adding one cycle of follow-up drilling. The 600/2000 grid had a 97% chance of hitting one or more large ore bodies with at least one drill hole per ore body, and the 200/5000 grid had a 64% chance. Once hit, there was an 82% chance that the largest ore body would be penetrated by three or more holes when using the 600/2000 grid and an 88% chance using the 200/5000 grid.     

基于DSP的水下图像传输系统研究

本文研究了基于高性能的DSP芯片TMS320C549的水下图像传输系统，并采用Goertzel算法进行信源编码和MFSK调制方式、运用Turbo码进行信道的编、解码，来实现水下视频图像高速数据传输的目的。     

Boussinesq-type modelling using an unstructured finite element technique

A model for solving the two-dimensional enhanced Boussinesq equations is presented. The model equations are discretised in space using an unstructured finite element technique. The standard Galerkin method with mixed interpolation is applied. The time discretisation is performed using an explicit three-step Taylor–Galerkin method. The model is extended to the surf and swash zone by inclusion of wave breaking and a moving boundary at the shoreline. Breaking is treated by an existing surface roller model, but a new procedure for the detection of the roller thickness is devised. The model is verified using four test cases and the results are compared with experimental data and results from an existing finite difference Boussinesq model.     

角度格式转换过程中可靠算法研究

提出了一种可靠算法是将原始度.分秒加上一个与之同符号,且不影响计算精度的有效微小量ｅ,然后再进行格式转换,能有效减少工程返工和损失。     

遗传算法与单纯形法组合的影像纹理分类方法

提出遗传算法(简称GA)与单纯形法组合的影像纹理分类方法(简称GASPX)。单纯形法是一种局部搜索方法，它通过反射，扩张，收缩操作，求得新的单纯形点，组成新单纯形，新单纯形比前一个单纯形更接近局部最优解。这种寻优方法收敛速度快，它与GA组合起来可以改善单独使用GA收敛速度慢的缺陷。由于在组合算法中是多个单纯形的局部区域的并行搜索，避免GA优化过程中过早收敛于局部最优解的现象出现。通过5种不同类别航空影像纹理识别的试验，并与GA的结果作对比，结果表明GASPX法优于GA法。     

无拓扑矢量数据快速压缩算法的研究与实现

首先论述传统矢量数据压缩算法：道格拉斯—普克法，分析将其应用于多边形边界数据压缩所造成的图形失真现象，在此基础上提出一种针对无拓扑矢量数据的快速压缩算法，并在MapInfo环境中实现该算法。     

遗传算法在上地幔速度结构研究中的应用

遗传算法是近年来发展较快的一种求解非线性优化问题的有效方法。本文通过对遗传算法基本原理的介绍，对该方法的特点进行了分析。我们采用ＷＫＢＪ理论地震图作正演，遗传算法作反演，对用体波波形反演上地幔速度结构的方法进行了研究。在ＷＫＢＪ理论地震图的计算中，通过计算主要射线的平均吸收特征时间，考虑了衰减随距离的变化，通过对不同震源引入不同的虚拟界面，同时对多个地震的波形记录进行反演。探讨了观测误差对反演结果的影响。对理论记录的反演表明，用遗传算法研究上地幔速度结构具有较好的效果。     

柿竹园钨锡钼铋矿床合理的勘探方法及储量比例探讨

本文剖析了柿竹园钨锡钼铋矿床地勘阶段地质观察粗浅，勘探投入超前，探明储量积压、Ｂ＋Ｃ级储量比例偏大等不合理的勘查工作及其原因。在此基础上，探讨矿区合理的勘探程度，储量比例及由此带来的经济效益。