一种基于一元插值的网格化方法

针对地质数据点的空间分布特点，提出了一种一元网格化方法，探讨了几种常用一元插值方法的应用，并与Ｎ－Ｐ法进行了对比，说明了一元网格化方法的特点．     

左截断右删失下核密度估计的L1距离的界

本文在左截断右删失数据下获得了概论密度的核估计的L1距离的一个上界．     

浅议物理实验教学环节改革

为进一步提高大学物理实验的教学质量，本文就实验课的预习、操作、实验报告的撰写及考核方法进行了探讨。     

农村电网远程监测系统的设计

介绍了农村电网远程监测系统的设计方案,阐述了其系统结构及总体功能,重点介绍了用于该系统的嵌入式网络服务器的设计及通信软件的设计以及该系统所涉及的数据采集技术、实时网络通信技术等。     

Recent developments in the statistical processing of textual data

Statisticians are accustomed to processing numerical, ordinal or nominal data. In many circumstances, such as socio-economic, epidemiologic sample surveys and documentary data bases, this data is juxtaposed with textual data (for example, responses to open questions in surveys). This article presents a series of language-independent procedures based upon applying multivariate techniques (such as correspondence analysis and clustering) to sets of generalized lexical profiles. The generalized lexical profile of a text is a vector whose components are the frequencies of each word (graphical form) or ‘repeated segment’ (sequence of words appearing with a significant frequency in the text). The processing of such large (and often sparse) vectors and matrices requires special algorithms. The main outputs are the following: (1) printouts of the characteristic words and characteristic responses for each category of respondent (these categories are generally derived from available nominal variables); (2) graphical displays of the proximities between words or segments and categories of respondents; (3) when analysing a combination of several texts: graphical displays of proximities between words or segments and each text, or between words or segments and groupings of texts. The systematic use of ‘repeated segments’ provides a valuable help in interpreting the results from a semantic point of view.     

光盘阵列系统的一种性能优化方法

提出了一种用低性能驱动器组建高性能光盘阵列系统性能的优化方法。针对传统的低性能光盘驱动器(驱动器内部数据传输率及接口速率均较低),提出了一种新型的数据传输模式。采用此优化方法可以使光盘阵列系统的整体性能得到较大地提高。同时还可以提高系统整体的性价比。     

知识库中精确知识的判定算法

研究了知识库中挖掘它所包含的精确知识的方法，给出知识库的相关概念及精确知识的定义，讨论了一种在所定义的知识库中提取并判定精确知识的算法．     

Validating DEA as a ranking tool: An application of DEA to assess performance in higher education

There is a general interest in ranking schemes applied to complex entities described by multiple attributes. Published rankings for universities are in great demand but are also highly controversial. We compare two classification and ranking schemes involving universities; one from a published report, ‘Top American Research Universities’ by the University of Florida's TheCenter and the other using DEA. Both approaches use the same data and model. We compare the two methods and discover important equivalences. We conclude that the critical aspect in classification and ranking is the model. This suggests that DEA is a suitable tool for these types of studies.     

Reformulation of the support set selection problem in the logical analysis of data

The paper is concerned with the problem of binary classification of data records, given an already classified training set of records. Among the various approaches to the problem, the methodology of the logical analysis of data (LAD) is considered. Such approach is based on discrete mathematics, with special emphasis on Boolean functions. With respect to the standard LAD procedure, enhancements based on probability considerations are presented. In particular, the problem of the selection of the optimal support set is formulated as a weighted set covering problem. Testable statistical hypothesis are used. Accuracy of the modified LAD procedure is compared to that of the standard LAD procedure on datasets of the UCI repository. Encouraging results are obtained and discussed.     

The Method of Virtual Experts in Mathematical Diagnostics

Mathematical Diagnostics (MD) deals with identification problems arising in different practical areas. Some of these problems can be described by mathematical models where it is required to identify points belonging to two or more sets of points. Most of the existing tools provide some identification rule (a classifier) by means of which a given point is assigned (attributed) to one of the given sets. Each classifier can be viewed as a virtual expert. If there exist several classifiers (experts), the problem of evaluation of experts’ conclusions arises. In the paper for the case of supervised classification the method of virtual experts (the VE-method) is described. Based on this method, a generalized VE method is proposed where each of the classifiers can be chosen from a given family of classifiers. As a result, a new optimization problem with a discontinuous functional is stated. Examples illustrating the proposed approach are provided. The work of the second author was supported by the Russian Foundation for Fundamental Studies (RFFI) under Grant No 03-01-00668.