综采工作面粉尘防治问题分析与技术改进

针对新桥煤矿2301综采工作面机载喷雾系统喷雾效果差、喷雾耗水量大造成煤质含水量超标、喷嘴雾化程度不高、喷嘴容易发生堵塞等问题,提出了高压喷雾系统设计方案,选择了1.2mm的锥形引射喷嘴和1.5mm的扇形引射喷嘴。采用固定水泵供水方式,结合工作面实际情况,计算出喷雾总用水量247.5L/min,提高了喷雾射程,提升了除尘效果。     

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

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

分类挖掘技术在高校人事管理中的应用

探讨分类挖掘技术在高校实际工作中的应用方式与应用领域。以高校人事管理为模型，应用数据挖掘中决策树算法，对高校人力资源数据源中的信息进行分析，发现其中有价值的数据模式，寻找其中存在的关系和规则，对高校人才规划提供比较客观的决策支持。     

基于数据挖掘的OLAP分析技术及应用

数据仓库和数据挖掘技术是目前信息技术研究的热点问题之一,介绍了数据挖掘(data mining)、数据仓库(datawarehouse)及联机分析处理(OLAP)技术。并以零售业决策支持系统为例,介绍了该系统的体系结构、数据仓库的设计、系统实现关键技术及各子系统功能,着重论述了如何利用OLAP技术实现企业决策支持系统。     

USERS' TWO-DIMENSIONAL INTEREST AND ITS STORAGE METHOD

The users' interest can be mined from the web cache and can be used widely. The interest can be specialized by the two-tuple (term, weight) in the simple interest model, in which the association relations are not mined, and then the interest cannot be associated in expressing the users' interest. Based on analyzing the WWW cache model, this letter brings forward a two-dimensional interest model and gives the interrelated methods on how to store the two-dimensional interest model effectively.     

USERS’ TWO-DIMENSIONAL INTEREST AND ITS STORAGE METHOD

The users‘ interest can be mined from the web cache and can be used widely.The interest can be specialized by the two-tuple(term,weight) in the simple interest model,in which the association relations are not mined.and then interest cannot be associated in expressing the users‘interest.Based on analyzing the WWW cache model,this letter brings forward a twodimensional interest model and gives the interrelated methods on how to store the two-dimensional interest model effectively.     

矿业可持续发展理论及应用

在简要回顾我国矿业发展现状及其在环境破坏污染和资源浪费损失的基础上，提出矿业可持纽发展的概念与内涵，论述矿业可持续发展的动态２特征，并就如何实施矿业可持结发展战略进行了思考。     

FindOut: Finding Outliers in Very Large Datasets

Finding the rare instances or the outliers is important in many KDD (knowledge discovery and data-mining) applications, such as detecting credit card fraud or finding irregularities in gene expressions. Signal-processing techniques have been introduced to transform images for enhancement, filtering, restoration, analysis, and reconstruction. In this paper, we present a new method in which we apply signal-processing techniques to solve important problems in data mining. In particular, we introduce a novel deviation (or outlier) detection approach, termed FindOut, based on wavelet transform. The main idea in FindOut is to remove the clusters from the original data and then identify the outliers. Although previous research showed that such techniques may not be effective because of the nature of the clustering, FindOut can successfully identify outliers from large datasets. Experimental results on very large datasets are presented which show the efficiency and effectiveness of the proposed approach. Received 7 September 2000 / Revised 2 February 2001 / Accepted in revised form 31 May 2001 Correspondence and offprint requests to: A. Zhang, Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA. Email: azhang@cse.buffalo.eduau     

Ranking Pages by Topology and Popularity within Web Sites

We compare two link analysis ranking methods of web pages in a site. The first, called Site Rank, is an adaptation of PageRank to the granularity of a web site and the second, called Popularity Rank, is based on the frequencies of user clicks on the outlinks in a page that are captured by navigation sessions of users through the web site. We ran experiments on artificially created web sites of different sizes and on two real data sets, employing the relative entropy to compare the distributions of the two ranking methods. For the real data sets we also employ a nonparametric measure, called Spearman's footrule, which we use to compare the top-ten web pages ranked by the two methods. Our main result is that the distributions of the Popularity Rank and Site Rank are surprisingly close to each other, implying that the topology of a web site is very instrumental in guiding users through the site. Thus, in practice, the Site Rank provides a reasonable first order approximation of the aggregate behaviour of users within a web site given by the Popularity Rank.