首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1546篇
  免费   45篇
  国内免费   7篇
管理学   165篇
民族学   2篇
人才学   1篇
人口学   34篇
丛书文集   27篇
理论方法论   30篇
综合类   563篇
社会学   45篇
统计学   731篇
  2024年   3篇
  2023年   6篇
  2022年   32篇
  2021年   15篇
  2020年   36篇
  2019年   39篇
  2018年   52篇
  2017年   63篇
  2016年   56篇
  2015年   68篇
  2014年   64篇
  2013年   273篇
  2012年   112篇
  2011年   74篇
  2010年   84篇
  2009年   58篇
  2008年   83篇
  2007年   66篇
  2006年   60篇
  2005年   56篇
  2004年   30篇
  2003年   39篇
  2002年   39篇
  2001年   35篇
  2000年   32篇
  1999年   24篇
  1998年   15篇
  1997年   16篇
  1996年   9篇
  1995年   7篇
  1994年   8篇
  1993年   5篇
  1992年   12篇
  1990年   4篇
  1989年   4篇
  1988年   4篇
  1987年   2篇
  1986年   3篇
  1985年   1篇
  1984年   1篇
  1983年   3篇
  1982年   1篇
  1981年   1篇
  1979年   1篇
  1977年   2篇
排序方式: 共有1598条查询结果,搜索用时 31 毫秒
101.
This article investigates circumstances under which seven important martingale properties are preserved by the following six martingale generalizations: quasimartingales, amarts, martingales in the limit, games fairer with time, progressive martingales, and eventual martingales.  相似文献   
102.
Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in computational molecular biology. At present, is the best known approximation ratio achievable in polynomial time for SBR. A very closely related problem, called Breakpoint Graph Decomposition (BGD), calls for a largest collection of edge disjoint cycles in a suitably-defined graph. It has been shown that for almost all instances SBR is equivalent to BGD, in the sense that any solution of the latter corresponds to a solution of the former having the same value. In this paper, we show how to improve the approximation ratio achievable in polynomial time for BGD, from the previously known to for any > 0. Combined with the results in (Caprara, Journal of Combinatorial Optimization, vol. 3, pp. 149–182, 1999b), this yields the same approximation guarantee for n! – O((n – 5)!) out of the n! instances of SBR on permutations with n elements. Our result uses the best known approximation algorithms for Stable Set on graphs with maximum degree 4 as well as for Set Packing where the maximum size of a set is 6. Any improvement in the ratio achieved by these approximation algorithms will yield an automatic improvement of our result.  相似文献   
103.
In this paper we show the sufficient conditions for the decomposition of the complete bipartite graphs K 2m,2n and K 2n+1,2n+1F into cycles of two different lengths 4 and 2t, t>2, where F is a 1-factor of K 2n+1,2n+1. After that we prove that the results are true for t=5 and 6. Dedicated to Frank K. Hwang on the occasion of his 65th birthday. An erratum to this article can be found at  相似文献   
104.
This paper is heavily leaned on the author's recent investigations concerning SCHUR analysis of non-negative Hermitian block matrices. The parameters of the matrix balls and the triangular choice scheme which describe a non-negative Hermitian block matrix will be interpreted in the framework of correlation theory  相似文献   
105.
GARCH model has been commonly used to describe the volatility of foreign exchange returns, which typically depends on returns many lags before, While the GARCH model provides a simple geometric decaying structure for persistence in time, it restricts tiie impact of variables to Quadratic functions. A finite nonparametric GARCH model is proposed that allows the variables' impact to be a smooth function of any form. A direct local polynomial estimation method for this finite GARCH model is proposed based on results on proportional additive model, and is applied to the German Mark (DEM)/US Dollar (USD) daily returns data. Estimators uf both the decaying rate and the impact function are obtained. Diagnostics show satisfactory out-of-sampie prediction based on the proposed model, which helps to better understand the dynamics of foreign exchange volatility.  相似文献   
106.
将双时间步法应用于叶栅级的全三维黏性非定常数值求解,讨论了分区算法中内边界条件的给定问题,本算法可保证分区边界上具有与内点相同的精度,具有很好的数值稳定性,且通量基本守恒,将该方法应用于具有弯曲导叶的涡轮级的计算可得到典型的非定常流谱,揭示了动静叶之间的相互干涉对叶片气动性能的影响,数值计算结果表明本文给出的算法是合理有效的。  相似文献   
107.
ABSTRACT. The problem of estimating the mean of a multivariate normal distribution when the parameter space allows an orthogonal decomposition is discussed. Risk functions and lower bounds for a class of shrinkage estimators that includes Stein's estimator are derived, and an improvement on Stein's estimator that takes advantage of the orthogonal decomposition is introduced. Uniform asymptotics related to Pinsker's minimax risk is derived and we give conditions for attaining the lower risk bound. Special cases including regression and analysis of variance are discussed.  相似文献   
108.
商业银行信用风险及评估方法应用述评   总被引:1,自引:0,他引:1  
信用风险是商业银行面临的最主要的风险,如何改进信用风险评估方法、提高预测精度是摆在学术界和实践界的重要课题。自20世纪30年代以来,商业银行信用风险的评估方法大致经历了比例分析、统计分析和人工智能三个阶段。在对风险、信用风险概念分析的基础上,对主要的信用风险评估方法进行述评。  相似文献   
109.
This paper studies the implementation of the coupling from the past (CFTP) method of Propp and Wilson (1996) in the set-up of two and three component mixtures with known components and unknown weights. We show that monotonicity structures can be exhibited in both cases, but that CFTP can still be costly for three component mixtures. We conclude with a simulation experiment exhibiting an almost perfect sampling scheme where we only consider a subset of the exhaustive set of starting values.  相似文献   
110.
The main models of machine learning are briefly reviewed and considered for building a classifier to identify the Fragile X Syndrome (FXS). We have analyzed 172 patients potentially affected by FXS in Andalusia (Spain) and, by means of a DNA test, each member of the data set is known to belong to one of two classes: affected, not affected. The whole predictor set, formed by 40 variables, and a reduced set with only nine predictors significantly associated with the response are considered. Four alternative base classification models have been investigated: logistic regression, classification trees, multilayer perceptron and support vector machines. For both predictor sets, the best accuracy, considering both the mean and the standard deviation of the test error rate, is achieved by the support vector machines, confirming the increasing importance of this learning algorithm. Three ensemble methods - bagging, random forests and boosting - were also considered, amongst which the bagged versions of support vector machines stand out, especially when they are constructed with the reduced set of predictor variables. The analysis of the sensitivity, the specificity and the area under the ROC curve agrees with the main conclusions extracted from the accuracy results. All of these models can be fitted by free R programs.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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