Stereo matching cost computation based on nonsubsampled contourlet transform

A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost.     

Identification of digital technologies and digitalisation trends in the mining industry

Digitalisation in mining refers to the use of computerised or digital devices or systems and digitised data that are to reduce costs, improve business productivity, and transform mining practices. However, it remains increasingly difficult for mining companies to decide which digital technologies are most relevant to their needs and individual mines. This paper provides an overview of digital technologies currently relevant to mining companies as presented and discussed by mining journals, the media and insight reports of leading consultancy agencies. Relevant technologies were systematically identified using text-mining techniques, and network analyses established the relations between significant technologies. Results demonstrated that currently 107 different digital technologies are pursued in the mining sector. Also, an analysis of the actual implementation of digital technologies in 158 active surface and underground mines reveals a limited uptake of digital technologies in general and that the uptake increases with the run-of-mine production. Large-scale mining operations appear to select and apply digital technologies suitable to their needs, whereas operations with lower production rates do not implement the currently available digital technologies to the same extent. These minor producers may require other digital transformation solutions tailored to their capabilities and needs and applicable to their scale of operations.     

基于云概率密度分布估计的大坝监测数据分析

大坝运行监测易受自然环境和监测条件影响，存在时间和空间上的变异性，监测数据具有不确定性。以云理论的随机性和不确定性分析方法为基础，并与空间数据辐射思想相结合，建立了云滴概率密度分布估计模型，然后导出云概率密度分布函数，依据样本监测数据推求母体空间数据的分布特征，并设计了基于逆向云算法云变换的计算程序。分析陆浑水库1979~1999年测压管监测数据和位移变形数据的云概率密度分布特征和云数字特征，得出了20 a来大坝的数据分布特征和运行状态。监测数据分析结果表明，云概率密度分布估计不仅能有效合理地分析大坝的运行状态，而且能够依据云数字特征来判断监测状态和监测环境的异常变化。      

Accuracy of wind energy forecasts in Great Britain and prospects for improvement

The metric representing the wind energy forecast error, when reported as a percent, is calculated quite differently than the error metrics for electricity transmission, electricity load, or in other industries such as manufacturing when they are also reported as a percent. The resulting calculated metric is quite different from what would be reported if the method utilized elsewhere was employed. This paper examines the possible forecast assessment and operational challenges associated with this finding. Concerning the prospects for improvement, the errors reported in MW of energy have a systematic component. With this insight, we developed a model to improve accuracy.     

因素空间理论下基点分类算法研究

目前，基于因素空间理论的背景基提取算法计算过程复杂，初始化必须依赖各因素极值，基点数量提取冗余等原因，未能在应用中取得很好效果。为此，结合内点判别法和知识可继承、可扩展的思想，提出一种计算简单、初始化独立、基点数量小的改进的背景基提取算法。然后，利用改进的背景基提取算法构造出一种全新的数据分类算法-基点分类算法，基点分类算法以提取每一类样本的背景基为预测模型，再通过新定义的λ-背景基，优化预测模型。数值实验表明:基点分类算法原理简单、构造难度小、分类模型泛化能力强，预测能力准确率高，同时严格的模型限定区域又能为识别新类别提供新方法。     

一种基于Spark的不确定数据集频繁模式挖掘算法

如何在海量不确定数据集中提高频繁模式挖掘性能是目前研究的热点.传统算法大多是以期望、概率或者权重等单一指标为数据项集支持度，在大数据背景下，同时考虑概率和权重支持度的算法难以兼顾其执行效率.为此，本文提出一种基于Spark的不确定数据集频繁模式挖掘算法（UWEFP），首先，为了同时兼顾数据项的概率和权重，计算一项集的最大概率权重值并进行剪枝；然后，为了减少对数据集的多次扫描，结合Spark框架的优点，设计了一种具有FP-tree特征的新颖的UWEFP-tree结构进行模式树的构建及挖掘；最后在Spark环境下，以UCI数据集进行实验验证.实验结果表明本文的方法在保证挖掘结果的同时，提高了效率.     

测井资料在优选压裂层位中的应用

压裂是低孔、低渗油层改造的主要增产措施。根据常规测井资料、岩石物理实验分析数据及试油成果。研究储层四性关系，确定区块的低孔、低渗储层评价标准。进一步对油层进行分类，有针对性地为油层压裂提供施工层位和准确的储层参数。通过商543区块实例，阐述了选择压裂层位的方法。     

某面板堆石坝沉降观测资料反馈分析

根据某面板堆石坝施工期、蓄水初期以及几年来的沉降观测资料，对坝体填筑材料计算参数进行反馈分析，得出了能够反映坝体实际变形的弹塑性应力变形计算参数，有利于今后建立大坝变形预报模型，更准确地把握大坝实时运行状态。     

Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.