首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2169篇
  免费   64篇
  国内免费   38篇
管理学   442篇
民族学   1篇
人口学   1篇
丛书文集   32篇
理论方法论   4篇
综合类   690篇
社会学   8篇
统计学   1093篇
  2024年   3篇
  2023年   11篇
  2022年   30篇
  2021年   21篇
  2020年   34篇
  2019年   64篇
  2018年   68篇
  2017年   125篇
  2016年   74篇
  2015年   63篇
  2014年   71篇
  2013年   307篇
  2012年   144篇
  2011年   97篇
  2010年   85篇
  2009年   77篇
  2008年   112篇
  2007年   113篇
  2006年   106篇
  2005年   99篇
  2004年   97篇
  2003年   64篇
  2002年   50篇
  2001年   49篇
  2000年   61篇
  1999年   51篇
  1998年   37篇
  1997年   27篇
  1996年   30篇
  1995年   21篇
  1994年   17篇
  1993年   8篇
  1992年   20篇
  1991年   6篇
  1990年   5篇
  1989年   10篇
  1988年   6篇
  1987年   3篇
  1985年   2篇
  1984年   1篇
  1981年   2篇
排序方式: 共有2271条查询结果,搜索用时 62 毫秒
61.
The standard location and scale unrestricted (or unified) skew-normal (SUN) family studied by Arellano-Valle and Genton [On fundamental skew distributions. J Multivar Anal. 2005;96:93–116] and Arellano-Valle and Azzalini [On the unification of families of skew-normal distributions. Scand J Stat. 2006;33:561–574], allows the modelling of data which is symmetrically or asymmetrically distributed. The family has a number of advantages suitable for the analysis of stochastic processes such as Auto-Regressive Moving-Average (ARMA) models, including being closed under linear combinations, being able to satisfy the consistency condition of Kolmogorov’s theorem and providing the guarantee of the existence of such a SUN stochastic process. The family is able to be represented in a hierarchical form which can be used for the ease of simulation. In addition, it facilitates an EM-type algorithm to estimate the model parameters. The performances and suitability of the proposed model are demonstrated on simulations and using two real data sets in applications.  相似文献   
62.
在分析铁路货运量预测方法的基础上,针对标准BP神经网络的不足,提出改进的BP神经网络预测模型。首先,利用动态陡度因子来改变激励函数的陡峭程度,以此来得到更好的激励函数响应特征以及更好的非线性表达能力;其次,利用附加动量因子,通过对以前经验的积累,既降低了神经网络对误差曲面的局部细节敏感特性,又较好的遏制了神经网络易于限于局部最小的缺陷;最后,采取改变学习率的方法,给定一个较大的学习率初始值,在学习的过程中学习率不断减小,网络最终趋于稳定。改进BP算法既可以得到更优的解,还能够缩短训练时间。利用全国铁路货运  相似文献   
63.
Data sets with excess zeroes are frequently analyzed in many disciplines. A common framework used to analyze such data is the zero-inflated (ZI) regression model. It mixes a degenerate distribution with point mass at zero with a non-degenerate distribution. The estimates from ZI models quantify the effects of covariates on the means of latent random variables, which are often not the quantities of primary interest. Recently, marginal zero-inflated Poisson (MZIP; Long et al. [A marginalized zero-inflated Poisson regression model with overall exposure effects. Stat. Med. 33 (2014), pp. 5151–5165]) and negative binomial (MZINB; Preisser et al., 2016) models have been introduced that model the mean response directly. These models yield covariate effects that have simple interpretations that are, for many applications, more appealing than those available from ZI regression. This paper outlines a general framework for marginal zero-inflated models where the latent distribution is a member of the exponential dispersion family, focusing on common distributions for count data. In particular, our discussion includes the marginal zero-inflated binomial (MZIB) model, which has not been discussed previously. The details of maximum likelihood estimation via the EM algorithm are presented and the properties of the estimators as well as Wald and likelihood ratio-based inference are examined via simulation. Two examples presented illustrate the advantages of MZIP, MZINB, and MZIB models for practical data analysis.  相似文献   
64.
In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data.  相似文献   
65.
In this article, to reduce computational load in performing Bayesian variable selection, we used a variant of reversible jump Markov chain Monte Carlo methods, and the Holmes and Held (HH) algorithm, to sample model index variables in logistic mixed models involving a large number of explanatory variables. Furthermore, we proposed a simple proposal distribution for model index variables, and used a simulation study and real example to compare the performance of the HH algorithm with our proposed and existing proposal distributions. The results show that the HH algorithm with our proposed proposal distribution is a computationally efficient and reliable selection method.  相似文献   
66.
In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R.  相似文献   
67.
Abstract

Recently, the study of the lifetime of systems in reliability and survival analysis in the presence of several causes of failure (competing risks) has attracted attention in the literature. In this paper, series and parallel systems with exponential lifetime for each item of the system are considered. Several causes of failure independently affect lifetime distributions and observations of failure times of the systems are considered under progressive Type-II censored scheme. For series systems, the maximum likelihood estimates of parameters are computed and confidence intervals for parameters of the model are obtained using Fisher information matrix. For parallel systems, the generalized EM algorithm which uses the Newton-Raphson algorithm inside the EM algorithm is used to compute the maximum likelihood estimates of parameters. Also, the standard errors of the maximum likelihood estimates are computed by using the supplemented EM algorithm. The simulation study confirms the good performance of the introduced approach.  相似文献   
68.
朱莉  曹杰  顾珺  郑翼 《中国管理科学》2020,28(12):151-161
在以人道主义为本的应急救援活动中,不可忽视被救灾民和施救决策者们异质性行为的影响。一方面,将各灾民因救援物资需求未被及时满足而呈现的差异化心理痛苦度量成经济损失,并纳入应急救援调度的社会成本这一决策目标中;另一方面,在灾后物资调度决策中,关注具有异质性偏好的各应急决策者所展现出的不同救援态度。结合面向联合机会约束规划的动态供需平衡限制,最终构建一个考虑灾民和决策者们异质性行为的多阶段灾后救援物资分配和应急路径优化模型。采用2008年汶川地震为案例背景,应用遗传算法对模型求解和参数分析,将仿真结果与不考虑异质性行为的传统救援调度方案进行比较,得出一些结论为构建高效的应急救援体系提供有益参考。  相似文献   
69.
Motivated by a proposal of the local authority for improving the existing healthcare system in the Parana State in Brazil, this article presents an optimization-based model for developing a better system for patients by aggregating various health services offered in the municipalities of Parana into some microregions. The problem is formulated as a multi-objective partitioning of the nodes of an undirected graph (or network) with the municipalities as the nodes and the roads connecting them as the edges of the graph. Maximizing the population homogeneity in the microregions, maximizing the variety of medical procedures offered in the microregions, and minimizing the inter-microregion distances to be traveled by patients are considered as three objective functions of the problem. An integer-coded multi-objective genetic algorithm is adopted as the optimization tool, which yields a significant improvement to the existing healthcare system map of the Parana State. The results obtained may have a strong impact on the healthcare system management in Parana. The model proposed here could be a useful tool to aid the decision-making in health management, as well as for better organization of any healthcare system, including those of other Brazilian States.  相似文献   
70.
Estimation and Properties of a Time-Varying EGARCH(1,1) in Mean Model   总被引:1,自引:1,他引:0  
Time-varying GARCH-M models are commonly employed in econometrics and financial economics. Yet the recursive nature of the conditional variance makes likelihood analysis of these models computationally infeasible. This article outlines the issues and suggests to employ a Markov chain Monte Carlo algorithm which allows the calculation of a classical estimator via the simulated EM algorithm or a simulated Bayesian solution in only O(T) computational operations, where T is the sample size. Furthermore, the theoretical dynamic properties of a time-varying-parameter EGARCH(1,1)-M are derived. We discuss them and apply the suggested Bayesian estimation to three major stock markets.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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