首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   332篇
  免费   2篇
管理学   26篇
丛书文集   5篇
综合类   91篇
统计学   212篇
  2022年   1篇
  2020年   1篇
  2019年   7篇
  2018年   12篇
  2017年   13篇
  2016年   12篇
  2015年   5篇
  2014年   12篇
  2013年   73篇
  2012年   15篇
  2011年   11篇
  2010年   10篇
  2009年   11篇
  2008年   11篇
  2007年   12篇
  2006年   11篇
  2005年   8篇
  2004年   10篇
  2003年   8篇
  2002年   5篇
  2001年   9篇
  2000年   9篇
  1999年   9篇
  1998年   14篇
  1997年   6篇
  1996年   1篇
  1995年   1篇
  1994年   26篇
  1993年   1篇
  1992年   3篇
  1988年   1篇
  1985年   2篇
  1981年   2篇
  1977年   1篇
  1976年   1篇
排序方式: 共有334条查询结果,搜索用时 15 毫秒
61.
从特殊情况研究多项式f(x)=xn+1在有理数域上的因式分解.对于正整数,设H(n)是n的大于1的奇约数的个数.本文用初等数论和近世代数的知识证明了:多项式xn+1在有理数域上可分解为H(n)+1个不可约因式的乘积,即D(f)=H(n)+1.  相似文献   
62.
文章将利用已知的几种特殊的自然数的幂方和,研究其算法特征,进而给出并证明了自然数幂方和的一个巧妙猜想,希望这一猜想能给自然数的幂方求和寻求更简单的方法提供一些新思路.  相似文献   
63.
The important feature of the accelerated hazards (AH) model is that it can capture the gradual effect of treatment. Because of the complexity in its estimation, few discussion has been made on the variable selection of the AH model. The Bayesian non-parametric prior, called the transformed Bernstein polynomial prior, is employed for simultaneously robust estimation and variable selection in sparse AH models. We first introduce a naive lasso-type accelerated hazards model, and later, in order to reduce estimation bias and improve variable selection accuracy, we further consider an adaptive lasso AH model as a direct extension of the naive lasso-type model. Through our simulation studies, we obtain that the adaptive lasso AH model performs better than the lasso-type model with respect to the variable selection and prediction accuracy. We also illustrate the performance of the proposed methods via a brain tumour study.  相似文献   
64.
We consider semiparametric additive regression models with a linear parametric part and a nonparametric part, both involving multivariate covariates. For the nonparametric part we assume two models. In the first, the regression function is unspecified and smooth; in the second, the regression function is additive with smooth components. Depending on the model, the regression curve is estimated by suitable least squares methods. The resulting residual-based empirical distribution function is shown to differ from the error-based empirical distribution function by an additive expression, up to a uniformly negligible remainder term. This result implies a functional central limit theorem for the residual-based empirical distribution function. It is used to test for normal errors.  相似文献   
65.
The authors propose and explore new regression designs. Within a particular parametric class, these designs are minimax robust against bias caused by model misspecification while attaining reasonable levels of efficiency as well. The introduction of this restricted class of designs is motivated by a desire to avoid the mathematical and numerical intractability found in the unrestricted minimax theory. Robustness is provided against a family of model departures sufficiently broad that the minimax design measures are necessarily absolutely continuous. Examples of implementation involve approximate polynomial and second order multiple regression.  相似文献   
66.
引入了BCI-代数上多项式的概念 ,并讨论了几种BCI -代数环  相似文献   
67.
在Banach空间上,利用锥理论与迭代方法研究了一类非线性算子方程组解的再在性与唯一性,推广了文[1]的主要结果,并给出了应用。  相似文献   
68.
针对教学中学生100m跑的具体情况,采用逐步回归分析方法建立了回归方程;在此基础上,分别以各相关因素、100 m跑成绩作为因变量与自变量建立了多项式回归方程,并依据正态分布理论制定了各因素平衡发展的标准.上述方法在指导短跑教学中取得了较好的效果.  相似文献   
69.
关于中值定理“中间点”的渐近性质   总被引:1,自引:0,他引:1  
文[1]给出了当区间长度趋于无穷大时Lagrange中值定理"中间点"的渐进性质。本文首先减弱了文[1]中主要定理的条件,从而改进了文[1]中的结果,然后给出积分中值定理当区间长度趋于无穷大时"中间点"的渐近性质.  相似文献   
70.
In this paper we study the inverse problem of matroid intersection: Two matroids M 1 = (E, 1) and M 2 = (E, 2), their intersection B, and a weight function w on E are given. We try to modify weight w, optimally and with bounds, such that B becomes a maximum weight intersection under the modified weight. It is shown in this paper that the problem can be formulated as a combinatorial linear program and can be further transformed into a minimum cost circulation problem. Hence it can be solved by strongly polynomial time algorithms. We also give a necessary and sufficient condition for the feasibility of the problem. Finally we extend the discussion to the version of the problem with Multiple Intersections.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号