首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1691篇
  免费   101篇
管理学   157篇
民族学   21篇
人口学   247篇
丛书文集   1篇
理论方法论   122篇
综合类   31篇
社会学   796篇
统计学   417篇
  2024年   4篇
  2023年   36篇
  2022年   27篇
  2021年   37篇
  2020年   89篇
  2019年   104篇
  2018年   146篇
  2017年   158篇
  2016年   140篇
  2015年   72篇
  2014年   118篇
  2013年   335篇
  2012年   137篇
  2011年   49篇
  2010年   44篇
  2009年   36篇
  2008年   42篇
  2007年   30篇
  2006年   18篇
  2005年   19篇
  2004年   19篇
  2003年   17篇
  2002年   11篇
  2001年   10篇
  2000年   9篇
  1999年   6篇
  1998年   11篇
  1997年   6篇
  1996年   6篇
  1995年   7篇
  1993年   1篇
  1992年   6篇
  1991年   4篇
  1990年   4篇
  1989年   4篇
  1988年   1篇
  1987年   2篇
  1986年   4篇
  1985年   4篇
  1984年   4篇
  1982年   2篇
  1981年   3篇
  1980年   1篇
  1978年   1篇
  1975年   2篇
  1972年   1篇
  1971年   2篇
  1968年   2篇
  1967年   1篇
排序方式: 共有1792条查询结果,搜索用时 484 毫秒
201.
An appropriate alignment between business strategy, manufacturing strategic objectives and manufacturing capabilities reportedly influences business performance positively. However, few papers empirically analyse this proposition for the case of Porter's generic strategies of cost leadership and differentiation, and none jointly considers all four elements. This paper integrates strategies, capabilities and performance in a single model and proposes that both manufacturing competitive priorities and capabilities, articulated in terms of cost and flexibility, are essential for explaining the link between generic business strategies and business commercial and financial performance. Within this analytic framework, we test whether companies that emphasize one business strategy rather than another achieve a better alignment and superior performance. The analyses conducted with a sample of 148 Spanish manufacturers provide general support for these propositions and contribute to a deeper understanding of the role played by functional strategies in understanding the outcomes of business strategy.  相似文献   
202.
203.
In this paper we obtain several influence measures for the multivariate linear general model through the approach proposed by Muñoz-Pichardo et al. (1995), which is based on the concept of conditional bias. An interesting charasteristic of this approach is that it does not require any distributional hypothesis. Appling the obtained results to the multivariate regression model, we obtain some measures proposed by other authors. Nevertheless, on the results obtained in this paper, we emphasize two aspects. First, they provide a theoretical foundation for measures proposed by other authors for the mul¬tivariate regression model. Second, they can be applied to any linear model that can be formulated as a particular case of the multivariate linear general model. In particular, we carry out an application to the multivariate analysis of covariance.  相似文献   
204.
In this article power divergences statistics based on sample quantiles are transformed in order to introduce new goodness-of-fit tests. Quantiles of the distribution of proposed statistics are calculated under uniformity, normality, and exponentiality. Several power comparisons are performed to show that the new tests are generally more powerful than the original ones.  相似文献   
205.
206.
Patriota and Lemonte [24] introduced a quite general multivariate normal regression model. This model considers that the mean vector and the covariance matrix share the same vector of parameters. In this paper we present some influence assessment for this model, such as the local influence, total local influence of an individual and generalized leverage which are discussed. Additionally, the normal curvatures for local influence studies are derived under some perturbation schemes.  相似文献   
207.
208.
Semi-on-line algorithms for the bin-packing problem allow, in contrast to pure on-line algorithms, the use of certain types of additional operations for each step. Examples include repacking, reordering or lookahead before packing the items. Here we define and analyze a semi-on-line algorithm where for each step at most k items can be repacked, for some positive integer k. We prove that the upper bound for the asymptotic competitive ratio of the algorithm is a decreasing function of k, which tends to 3/2 as k goes to infinity. We also establish lower bounds for this ratio and show that the gap between upper and lower bounds is relatively small.  相似文献   
209.
210.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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