全文获取类型
收费全文 | 475篇 |
免费 | 21篇 |
专业分类
管理学 | 95篇 |
人才学 | 1篇 |
人口学 | 36篇 |
丛书文集 | 2篇 |
理论方法论 | 52篇 |
综合类 | 2篇 |
社会学 | 227篇 |
统计学 | 81篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 13篇 |
2019年 | 13篇 |
2018年 | 17篇 |
2017年 | 20篇 |
2016年 | 23篇 |
2015年 | 16篇 |
2014年 | 20篇 |
2013年 | 73篇 |
2012年 | 18篇 |
2011年 | 27篇 |
2010年 | 14篇 |
2009年 | 20篇 |
2008年 | 15篇 |
2007年 | 22篇 |
2006年 | 31篇 |
2005年 | 11篇 |
2004年 | 28篇 |
2003年 | 13篇 |
2002年 | 12篇 |
2001年 | 18篇 |
2000年 | 10篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 6篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1972年 | 2篇 |
1968年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有496条查询结果,搜索用时 46 毫秒
61.
62.
63.
Benjamin Klein 《Economic inquiry》1996,34(3):444-463
Court enforcement and private enforcement are not alternative contract enforcement mechanisms, but are used jointly by transactors to define the self-enforcing range of a contractual relationship. Within this framework contract terms economize on the limited amounts of private enforcement capital possessed by transactors, either by directly controlling transactor behavior or by shifting private enforcement capital between transactors to coincide with likely future market conditions. Hold-ups occur when market conditions change sufficiently to place the relationship outside the self-enforcing range. This probabilistic view of hold-ups is contrasted with opportunism more generally and with moral hazard behavior. 相似文献
64.
65.
66.
Abstract In one-parameter (θ) families, we were not aware of explicit hypothesis testing scenarios where maximal invariant statistics failed to distinguish the models. We start with a concrete example (Sec. 2.2) to highlight such a hypothesis testing problem involving markedly different models. In this problem, because of the absence of a nontrivial uniformly most powerful invariant (UMPI) test, we briefly suggest two approaches to test the hypothesis. The first resolution (Sec. 3.1) is frequentist in nature. It utilizes a weight function on the parameter space and compares “average” distributions obtained under the null and alternative models in the sense of Wald (1947 1950). In contrast, a fully Bayesian resolution (Sec. 3.2) is also included. The note ends with a series of other interesting examples involving one-parameter families where maximal invariant statistics fail to distinguish the hypothesized models. The examples include easy-to-construct families of probability models involving only a single location or scale parameter θ. 相似文献
67.
Semiparametric estimation of plane similarities: application to fast computation of aeronautic loads
In the big data era, it is often needed to resolve the problem of parsimonious data representation. In this paper, the data under study are curves and the sparse representation is based on a semiparametric model. Indeed, we propose an original registration model for noisy curves. The model is built transforming an unknown function by plane similarities. We develop a statistical method that allows to estimate the parameters characterizing the plane similarities. The properties of the statistical procedure are studied. We show the convergence and the asymptotic normality of the estimators. Numerical simulations and a real-life aeronautic example illustrate and demonstrate the strength of our methodology. 相似文献
68.
69.
Social Indicators Research - We examine the complex relationship between money and happiness. We find that both permanent income and wealth are better predictors of life satisfaction than current... 相似文献
70.
Optimal string alignment is used to discover evolutionary relationships or mutations in DNA/RNA or protein sequences. Errors, missing parts or uncertainty in such a sequence can be covered with wild cards, so-called wild bases. This makes an alignment possible even when the data are corrupted or incomplete. The extended pairwise local alignment of wild card DNA/RNA sequences requires additional calculations in the dynamic programming algorithm and necessitates a subsequent best- and worst-case analysis for the wild card positions. In this paper, we propose an algorithm which solves the problem of input data wild cards, offers a highly flexible set of parameters and displays a detailed alignment output and a compact representation of the mutated positions of the alignment. An implementation of the algorithm can be obtained at https://github.com/sysbio-bioinf/swat+ and http://sysbio.uni-ulm.de/?Software:Swat+. 相似文献