全文获取类型
收费全文 | 370篇 |
免费 | 11篇 |
国内免费 | 2篇 |
专业分类
管理学 | 143篇 |
民族学 | 4篇 |
人口学 | 6篇 |
丛书文集 | 9篇 |
理论方法论 | 6篇 |
综合类 | 91篇 |
社会学 | 12篇 |
统计学 | 112篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 9篇 |
2018年 | 7篇 |
2017年 | 16篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 4篇 |
2013年 | 35篇 |
2012年 | 21篇 |
2011年 | 12篇 |
2010年 | 20篇 |
2009年 | 23篇 |
2008年 | 27篇 |
2007年 | 22篇 |
2006年 | 21篇 |
2005年 | 15篇 |
2004年 | 13篇 |
2003年 | 23篇 |
2002年 | 16篇 |
2001年 | 16篇 |
2000年 | 19篇 |
1999年 | 10篇 |
1998年 | 3篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1987年 | 3篇 |
排序方式: 共有383条查询结果,搜索用时 17 毫秒
51.
M. Hakan Satman 《统计学通讯:模拟与计算》2013,42(5):644-652
The authors introduce an algorithm for estimating the least trimmed squares (LTS) parameters in large data sets. The algorithm performs a genetic algorithm search to form a basic subset that is unlikely to contain outliers. Rousseeuw and van Driessen (2006) suggested drawing independent basic subsets and iterating C-steps many times to minimize LTS criterion. The authors 'algorithm constructs a genetic algorithm to form a basic subset and iterates C-steps to calculate the cost value of the LTS criterion. Genetic algorithms are successful methods for optimizing nonlinear objective functions but they are slower in many cases. The genetic algorithm configuration in the algorithm can be kept simple because a small number of observations are searched from the data. An R package is prepared to perform Monte Carlo simulations on the algorithm. Simulation results show that the performance of the algorithm is suitable for even large data sets because a small number of trials is always performed. 相似文献
52.
Jun Ma 《统计学通讯:理论与方法》2013,42(5):831-848
In many linear inverse problems the unknown function f (or its discrete approximation Θ p×1), which needs to be reconstructed, is subject to the non negative constraint(s); we call these problems the non negative linear inverse problems (NNLIPs). This article considers NNLIPs. However, the error distribution is not confined to the traditional Gaussian or Poisson distributions. We adopt the exponential family of distributions where Gaussian and Poisson are special cases. We search for the non negative maximum penalized likelihood (NNMPL) estimate of Θ. The size of Θ often prohibits direct implementation of the traditional methods for constrained optimization. Given that the measurements and point-spread-function (PSF) values are all non negative, we propose a simple multiplicative iterative algorithm. We show that if there is no penalty, then this algorithm is almost sure to converge; otherwise a relaxation or line search is necessitated to assure its convergence. 相似文献
53.
ABSTRACT We develop Markov chain Monte Carlo algorithms for estimating the parameters of the short-term interest rate model. Using Monte Carlo experiments we compare the Bayes estimators with the maximum likelihood and generalized method of moments estimators. We estimate the model using the Japanese overnight call rate data. 相似文献
54.
Eliane R. Rodrigues Mario H. Tarumoto Guadalupe Tzintzun 《Journal of applied statistics》2019,46(3):395-415
In this work, we assume that the sequence recording whether or not an ozone exceedance of an environmental threshold has occurred in a given day is ruled by a non-homogeneous Markov chain of order one. In order to account for the possible presence of cycles in the empirical transition probabilities, a parametric form incorporating seasonal components is considered. Results show that even though some covariates (namely, relative humidity and temperature) are not included explicitly in the model, their influence is captured in the behavior of the transition probabilities. Parameters are estimated using the Bayesian point of view via Markov chain Monte Carlo algorithms. The model is applied to ozone data obtained from the monitoring network of Mexico City, Mexico. An analysis of how the methodology could be used as an aid in the decision-making is also given. 相似文献
55.
Randeep Bhatia Sudipto Guha Samir Khuller Yoram J. Sussmann 《Journal of Combinatorial Optimization》1998,2(3):199-217
Facility location problems have always been studied with theassumption that the edge lengths in the network are static anddo not change over time. The underlying network could be used to model a city street networkfor emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to trafficcongestion the traversal time on links changes with time. Very often, we have estimates as to how the edge lengths change over time, and our objective is to choose a set of locations (vertices) ascenters, such that at every time instant each vertex has a center close to it (clearly, the center close to a vertex may change over time). We also provide approximation algorithms as well as hardness results forthe K-center problem under this model. This is the first comprehensive study regarding approximation algorithmsfor facility location for good time-invariant solutions. 相似文献
56.
Swapping the Nested Fixed Point Algorithm: A Class of Estimators for Discrete Markov Decision Models
Victor Aguirregabiria Pedro Mira 《Econometrica : journal of the Econometric Society》2002,70(4):1519-1543
This paper proposes a new nested algorithm (NPL) for the estimation of a class of discrete Markov decision models and studies its statistical and computational properties. Our method is based on a representation of the solution of the dynamic programming problem in the space of conditional choice probabilities. When the NPL algorithm is initialized with consistent nonparametric estimates of conditional choice probabilities, successive iterations return a sequence of estimators of the structural parameters which we call K–stage policy iteration estimators. We show that the sequence includes as extreme cases a Hotz–Miller estimator (for K=1) and Rust's nested fixed point estimator (in the limit when K→∞). Furthermore, the asymptotic distribution of all the estimators in the sequence is the same and equal to that of the maximum likelihood estimator. We illustrate the performance of our method with several examples based on Rust's bus replacement model. Monte Carlo experiments reveal a trade–off between finite sample precision and computational cost in the sequence of policy iteration estimators. 相似文献
57.
基于杂合遗传算法的工艺路线可变Job Shop调度研究 总被引:3,自引:3,他引:0
提出一种将遗传算法与启发式规则、模拟退火法等搜索方法结合在一起的杂合遗传算法,用于求解工艺路线可变的JobShop调度问题。通过对某双极型集成电路封装企业的JobShop调度仿真,结果表明算法是有效和可行的。 相似文献
58.
There is increasing interest in the study of globalization on whether the emergence and consolidation of global value chains (GVCs) have exacerbated inequalities within and across nations and/or how GVCs may be leveraged to mitigate them. Although power asymmetries have been identified as a central factor shaping (un)successful GVC participation, dominant discourses still disregard the links between power and inequality or use these concepts interchangeably. In this article, we provide an analytical approach to GVC-related inequalities (within, along and through value chains) and examine how they may co-evolve with different types of power (bargaining, demonstrative, institutional and constitutive). We apply this approach to the case study of the hake value chain in South Africa to illustrate how existing inequalities are manifested, challenged, mitigated or exacerbated—and draw an agenda for future research. 相似文献
59.
《Journal of Statistical Computation and Simulation》2012,82(11):1679-1699
Item response theory (IRT) comprises a set of statistical models which are useful in many fields, especially when there is an interest in studying latent variables (or latent traits). Usually such latent traits are assumed to be random variables and a convenient distribution is assigned to them. A very common choice for such a distribution has been the standard normal. Recently, Azevedo et al. [Bayesian inference for a skew-normal IRT model under the centred parameterization, Comput. Stat. Data Anal. 55 (2011), pp. 353–365] proposed a skew-normal distribution under the centred parameterization (SNCP) as had been studied in [R.B. Arellano-Valle and A. Azzalini, The centred parametrization for the multivariate skew-normal distribution, J. Multivariate Anal. 99(7) (2008), pp. 1362–1382], to model the latent trait distribution. This approach allows one to represent any asymmetric behaviour concerning the latent trait distribution. Also, they developed a Metropolis–Hastings within the Gibbs sampling (MHWGS) algorithm based on the density of the SNCP. They showed that the algorithm recovers all parameters properly. Their results indicated that, in the presence of asymmetry, the proposed model and the estimation algorithm perform better than the usual model and estimation methods. Our main goal in this paper is to propose another type of MHWGS algorithm based on a stochastic representation (hierarchical structure) of the SNCP studied in [N. Henze, A probabilistic representation of the skew-normal distribution, Scand. J. Statist. 13 (1986), pp. 271–275]. Our algorithm has only one Metropolis–Hastings step, in opposition to the algorithm developed by Azevedo et al., which has two such steps. This not only makes the implementation easier but also reduces the number of proposal densities to be used, which can be a problem in the implementation of MHWGS algorithms, as can be seen in [R.J. Patz and B.W. Junker, A straightforward approach to Markov Chain Monte Carlo methods for item response models, J. Educ. Behav. Stat. 24(2) (1999), pp. 146–178; R.J. Patz and B.W. Junker, The applications and extensions of MCMC in IRT: Multiple item types, missing data, and rated responses, J. Educ. Behav. Stat. 24(4) (1999), pp. 342–366; A. Gelman, G.O. Roberts, and W.R. Gilks, Efficient Metropolis jumping rules, Bayesian Stat. 5 (1996), pp. 599–607]. Moreover, we consider a modified beta prior (which generalizes the one considered in [3]) and a Jeffreys prior for the asymmetry parameter. Furthermore, we study the sensitivity of such priors as well as the use of different kernel densities for this parameter. Finally, we assess the impact of the number of examinees, number of items and the asymmetry level on the parameter recovery. Results of the simulation study indicated that our approach performed equally as well as that in [3], in terms of parameter recovery, mainly using the Jeffreys prior. Also, they indicated that the asymmetry level has the highest impact on parameter recovery, even though it is relatively small. A real data analysis is considered jointly with the development of model fitting assessment tools. The results are compared with the ones obtained by Azevedo et al. The results indicate that using the hierarchical approach allows us to implement MCMC algorithms more easily, it facilitates diagnosis of the convergence and also it can be very useful to fit more complex skew IRT models. 相似文献
60.