Numerical Study of Finite Element Method Based Solutions for Propagation of Wetting Fronts in Unsaturated Soil

The accurate prediction of the propagation of a wetting front in an unsaturated soil subjected to surficial infiltration is of practical importance to many geotechnical and geoenvironmental problems. The finite element method is the most common solution technique as the hydraulic soil properties are highly nonlinear. Two important issues are often found to create difficulties in such analyses. First, numerical oscillations are usually observed in the calculated pore pressures at the wetting front. Second, when a reasonable mesh size and time step are used, the elevation of the wetting front may be seriously overpredicted. This paper is focused on the second issue. The under-relaxation (UR) technique used in the iterative process within each time step is found to have a serious impact on rate of convergence with refinement in mesh size and time step. Two different techniques are typically used; the first evaluates the hydraulic conductivity using an average of heads calculated from the preceding time node and the most recent iteration of the current time node (UR1), and the second evaluates the hydraulic conductivity using the average of heads calculated from the two most recent iterations of the current time nodes (UR2). The study shows that UR1, which is adopted in programs such as SEEP/W, ensures that the solution converges rapidly to a stable solution within a time step, but may converge to the wrong wetting front at a given elapsed time unless a sufficiently refined mesh is used. UR2 converges much more slowly within a time step, but the error in the wetting front is smaller than that generated by UR1.     

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.     

AutoCAD 下非结构网格自动生成

在AutoCAD环境下，从背景网格生成和数据结构两方面对推进阵面法进行修正。采用修理后的方法，使得在流场、泥沙输移和床面冲淤数值计算的前处理过程中无须精心预设内部控制点而只需给边界一个尺度，就能自动生成适应任意复杂边界的非结构网格，从而提高网格生成、优化的效率和通用性。     

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.     

合理开发利用钨矿资源 促进钨矿业可持续发展

简述了我国钨矿业概况、现有采选技术水平及钨矿加工利用率 ;从资源配置出发 ,阐述了钨矿业发展存在的几个主要问题 ,并且针对性地提出了可持续发展的几点建议。     

Using Web resources to construct multilingual medical thesaurus for cross-language medical information retrieval

Due to the language barrier, non-English users are unable to retrieve the most updated medical information from the U.S. authoritative medical websites, such as PubMed and MedlinePlus. However, currently, there is no any cross-language medical information retrieval (CLMIR) system that can help Chinese-speaking consumers cross the language barrier in finding useful English medical information. A few CLMIR systems utilize MeSH (Medical Subject Headings) to help overcome the language barrier. Unfortunately, the traditional Chinese version of MeSH is currently unavailable.In this paper, we employ a semi-automatic term translation method to construct a Chinese–English MeSH by exploiting abundant multilingual Web resources, including Web anchor texts and search–result pages. Through this method, we have developed a Chinese–English Mesh Compilation System to assist knowledge engineers in compiling a Chinese–English medical thesaurus with more than 19,000 entries. Furthermore, this thesaurus has been used to develop a prototypical system for cross-language medical information retrieval, MMODE, which can help consumers retrieve top-quality English medical information using Chinese terms.     

平差法预计矿区导线网精度

分析了矿区导线网精度预计经典方法存在的问题 ,推导出严密平差法精度预计的数学模型 ,并编制机算程序。     

A Search for Hidden Relationships: Data Mining with Genetic Algorithms

This paper presents an algorithm that permits the search for dependencies among sets of data (univariate or multivariate time-series, or cross-sectional observations). The procedure is modeled after genetic theories and Darwinian concepts, such as natural selection and survival of the fittest. It permits the discovery of equations of the data-generating process in symbolic form. The genetic algorithm that is described here uses parts of equations as building blocks to breed ever better formulas. Apart from furnishing a deeper understanding of the dynamics of a process, the method also permits global predictions and forecasts. The algorithm is successfully tested with artificial and with economic time-series and also with cross-sectional data on the performance and salaries of NBA players during the 94–95 season.     

Computational complexity of queries based on itemsets

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.     

Non-redundant data clustering

Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice, this discovery process should avoid redundancies with existing knowledge about class structures or groupings, and reveal novel, previously unknown aspects of the data. In order to deal with this problem, we present an extension of the information bottleneck framework, called coordinated conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score subject to constraints. Algorithmically, one can apply an alternating optimization scheme that can be used in conjunction with different types of numeric and non-numeric attributes. We discuss extensions of the technique to the tasks of semi-supervised classification and enumeration of successive non-redundant clusterings. We present experimental results for applications in text mining and computer vision.