关于有限群的可解性

利用极大子群的几乎正规的概念得到了有限群为可解群的若干充要条件．     

关于有限群的超可解性

利用弱拟正规和广义中心元概念得到有限群为超可解群的若干充要条件,推广了现有的结果.     

A fast splitting procedure for classification trees

This paper provides a faster method to find the best split at each node when using the CART methodology. The predictability index is proposed as a splitting rule for growing the same classification tree as CART does when using the Gini index of heterogeneity as an impurity measure. A theorem is introduced to show a new property of the index : the for a given predictor has a value not lower than the for any split generated by the predictor. This property is used to make a substantial saving in the time required to generate a classification tree. Three simulation studies are presented in order to show the computational gain in terms of both the number of splits analysed at each node and the CPU time. The proposed splitting algorithm can prove computational efficiency in real data sets as shown in an example.     

Consistent Probabilistic Social Choice

Two fundamental axioms in social choice theory are consistency with respect to a variable electorate and consistency with respect to components of similar alternatives. In the context of traditional non‐probabilistic social choice, these axioms are incompatible with each other. We show that in the context of probabilistic social choice, these axioms uniquely characterize a function proposed by Fishburn (1984). Fishburn's function returns so‐called maximal lotteries, that is, lotteries that correspond to optimal mixed strategies in the symmetric zero‐sum game induced by the pairwise majority margins. Maximal lotteries are guaranteed to exist due to von Neumann's Minimax Theorem, are almost always unique, and can be efficiently computed using linear programming.     

Stochastic correlation coefficient ensembles for variable selection

In this paper, we propose a novel Max-Relevance and Min-Common-Redundancy criterion for variable selection in linear models. Considering that the ensemble approach for variable selection has been proven to be quite effective in linear regression models, we construct a variable selection ensemble (VSE) by combining the presented stochastic correlation coefficient algorithm with a stochastic stepwise algorithm. We conduct extensive experimental comparison of our algorithm and other methods using two simulation studies and four real-life data sets. The results confirm that the proposed VSE leads to promising improvement on variable selection and regression accuracy.     

逐步生物等效性t检验及在药物效能评价中的应用

在医学领域中,一种新药投产前,必须确定给人服用的安全剂量和它的毒性大小;有时又需要对两种药的药效进行比较。用均值等效二次单侧检验方法,并对其逐步推广,从而对处理组与对照组进行检验,确定是否等效。逐步等效性t检验也可用在确定仿制药的食用安全区间、比较药效等等。     

Researches on the Distribution Domains of G(4) G(4)的分布域之研究

讨论了有固定的最大度△=4和n个顶点的一类无自环,无向、连通平面图G(△)的异构类的分布域R(v,n)(圈秩v=1---n+1)的三种情况,从而获得R(v,n)的A型、B型和C型的分布定理,并举例说明分布域在图论和碳氢化合物上的应用。     

G（3）的存在性定理及其结构规律

给出了３度平面图的两个存在性定理的简洁证明，以矩阵列举法迅速得到所有的异构类，并举例说明结论的意义．     

关于极大η-单调映象的完全广义Fuzzy隐拟变分包含

本文介绍了一类关于极大,η-单调映象的完全广义拟变分包含问题,利用预解算子技巧研究了这类变分包含解的迭代算逼近,证明了解的存在性以及由算法生成的迭代序列的收敛性。     

Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.