全文获取类型
收费全文 | 1939篇 |
免费 | 9篇 |
国内免费 | 19篇 |
专业分类
管理学 | 300篇 |
民族学 | 15篇 |
人口学 | 381篇 |
丛书文集 | 13篇 |
理论方法论 | 100篇 |
综合类 | 190篇 |
社会学 | 738篇 |
统计学 | 230篇 |
出版年
2023年 | 2篇 |
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 30篇 |
2017年 | 51篇 |
2016年 | 86篇 |
2015年 | 27篇 |
2014年 | 14篇 |
2013年 | 53篇 |
2012年 | 175篇 |
2011年 | 134篇 |
2010年 | 33篇 |
2009年 | 17篇 |
2008年 | 22篇 |
2007年 | 22篇 |
2006年 | 20篇 |
2005年 | 564篇 |
2004年 | 285篇 |
2003年 | 154篇 |
2002年 | 46篇 |
2001年 | 85篇 |
2000年 | 36篇 |
1999年 | 2篇 |
1998年 | 10篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1991年 | 10篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 7篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 5篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 3篇 |
1966年 | 2篇 |
1964年 | 1篇 |
排序方式: 共有1967条查询结果,搜索用时 836 毫秒
251.
In this paper, we introduce non-centered and partially non-centered MCMC algorithms for stochastic epidemic models. Centered
algorithms previously considered in the literature perform adequately well for small data sets. However, due to the high dependence
inherent in the models between the missing data and the parameters, the performance of the centered algorithms gets appreciably
worse when larger data sets are considered. Therefore non-centered and partially non-centered algorithms are introduced and
are shown to out perform the existing centered algorithms. 相似文献
252.
Abdissa?NegassaEmail author Antonio?Ciampi Michal?Abrahamowicz Stanley?Shapiro Jean-Fran?ois?Boivin 《Statistics and Computing》2005,15(3):231-239
The performance of computationally inexpensive model selection criteria in the context of tree-structured subgroup analysis is investigated. It is shown through simulation that no single model selection criterion exhibits a uniformly superior performance over a wide range of scenarios. Therefore, a two-stage approach for model selection is proposed and shown to perform satisfactorily. Applied example of subgroup analysis is presented. Problems associated with tree-structured subgroup analysis are discussed and practical solutions are suggested. 相似文献
253.
The banks have been accumulating huge data bases for many years and are increasingly turning to statistics to provide insight
into customer behaviour, among other things. Credit risk is an important issue and certain stochastic models have been developed
in recent years to describe and predict loan default. Two of the major models currently used in the industry are considered
here, and various ways of extending their application to the case where a loan is repaid in installments are explored. The
aspect of interest is the probability distribution of the total loss due to repayment default at some time. Thus, the loss
distribution is determined by the distribution of times to default, here regarded as a discrete-time survival distribution.
In particular, the probabilities of large losses are to be assessed for insurance purposes. 相似文献
254.
In the presence of covariate information, the proportional hazards model is one of the most popular models. In this paper,
in a Bayesian nonparametric framework, we use a Markov (Lévy-driven) process to model the baseline hazard rate. Previous Bayesian
nonparametric models have been based on neutral to the right processes, which have a number of drawbacks, such as discreteness
of the cumulative hazard function. We allow the covariates to be time dependent functions and develop a full posterior analysis
via substitution sampling. A detailed illustration is presented. 相似文献
255.
An auxiliary variable method based on a slice sampler is shown to provide an attractive simulation-based model fitting strategy for fitting Bayesian models under proper priors. Though broadly applicable, we illustrate in the context of fitting spatial models for geo-referenced or point source data. Spatial modeling within a Bayesian framework offers inferential advantages and the slice sampler provides an algorithm which is essentially off the shelf. Further potential advantages over importance sampling approaches and Metropolis approaches are noted and illustrative examples are supplied. 相似文献
256.
In biomedical studies, interest often focuses on the relationship between patients characteristics or some risk factors and both quality of life and survival time of subjects under study. In this paper, we propose a simultaneous modelling of both quality of life and survival time using the observed covariates. Moreover, random effects are introduced into the simultaneous models to account for dependence between quality of life and survival time due to unobserved factors. EM algorithms are used to derive the point estimates for the parameters in the proposed model and profile likelihood function is used to estimate their variances. The asymptotic properties are established for our proposed estimators. Finally, simulation studies are conducted to examine the finite-sample properties of the proposed estimators and a liver transplantation data set is analyzed to illustrate our approaches. 相似文献
257.
Andersen EW 《Lifetime data analysis》2005,11(3):333-350
In this paper register based family studies provide the motivation for studying a two-stage estimation procedure in copula models for multivariate failure time data. The asymptotic properties of the estimators in both parametric and semi-parametric models are derived, generalising the approach by Shih and Louis (Biometrics vol. 51, pp. 1384–1399, 1995b) and Glidden (Lifetime Data Analysis vol. 6, pp. 141–156, 2000). Because register based family studies often involve very large cohorts a method for analysing a sampled cohort is also derived together with the asymptotic properties of the estimators. The proposed methods are studied in simulations and the estimators are found to be highly efficient. Finally, the methods are applied to a study of mortality in twins. 相似文献
258.
Biplane projection imaging is one of the primary methods for imaging and visualizing the cardiovascular system in medicine. A key problem in such a technique is to determine the imaging geometry (i.e., the relative rotation and translation) of two projections so that the 3-D structure can be accurately reconstructed. Based on interesting observations and efficient geometric techniques, we present in this paper new algorithmic solutions for this problem. Comparing with existing optimization-based approaches, our techniques yield better accuracy and have bounded execution time, thus is more suitable for on-line applications. Our techniques can easily detect outliers to further improve the accuracy.This research was supported in part by NIH under USPHS grant numbers HL52567. 相似文献
259.
Tsan-Sheng?Hsu Kuo-Hui?Tsai Da-Wei?WangEmail author D.?T.?Lee 《Journal of Combinatorial Optimization》2005,9(1):101-120
Given a set S of starting vertices and a set T of terminating vertices in a graph G = (V,E) with non-negative weights on edges, the minimum Steiner network problem is to find a subgraph of G with the minimum total edge weight. In such a subgraph, we require that for each vertex s
S and t
T, there is a path from s to a terminating vertex as well as a path from a starting vertex to t. This problem can easily be proven NP-hard. For solving the minimum Steiner network problem, we first present an algorithm that runs in time and space that both are polynomial in n with constant degrees, but exponential in |S|+|T|, where n is the number of vertices in G. Then we present an algorithm that uses space that is quadratic in n and runs in time that is polynomial in n with a degree O(max {max {|S|,|T|}–2,min {|S|,|T|}–1}). In spite of this degree, we prove that the number of Steiner vertices in our solution can be as large as |S|+|T|–2. Our algorithm can enumerate all possible optimal solutions. The input graph G can either be undirected or directed acyclic. We also give a linear time algorithm for the special case when min {|S|,|T|} = 1 and max {|S|,|T|} = 2.The minimum union paths problem is similar to the minimum Steiner network problem except that we are given a set H of hitting vertices in G in addition to the sets of starting and terminating vertices. We want to find a subgraph of G with the minimum total edge weight such that the conditions required by the minimum Steiner network problem are satisfied as well as the condition that every hitting vertex is on a path from a starting vertex to a terminating vertex. Furthermore, G must be directed acyclic. For solving the minimum union paths problem, we also present algorithms that have a time and space tradeoff similar to algorithms for the minimum Steiner network problem. We also give a linear time algorithm for the special case when |S| = 1, |T| = 1 and |H| = 2.An extended abstract of part of this paper appears in Hsu et al. (1996).Supported in part by the National Science Foundation under Grants CCR-9309743 and INT-9207212, and by the Office of Naval Research under Grant No. N00014-93-1-0272.Supported in part by the National Science Council, Taiwan, ROC, under Grant No. NSC-83-0408-E-001-021. 相似文献
260.
In the broadcasting of ad hoc wireless networks, energy conservation is a critical issue. Three heuristic algorithms were proposed in Wieselthier et al.(2001) for finding approximate minimum-energy broadcast routings: MST(minimum spanning tree), SPT(shortest-path tree), and BIP(broadcasting incremental power). Wan et al.(2001) characterized their performance in terms of approximation ratios. This paper points out some mistakes in the result of Wan et al.(2001), and proves that the upper bound of sum of squares of lengths of the edges in Euclidean MST in unit disk can be improved to 10.86, thus improves the approximation ratios of MST and BIP algorithm.Supported by Natural Science Foundation of China (60223004, 603210022) 相似文献