首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   362篇
  免费   13篇
管理学   82篇
民族学   5篇
人口学   18篇
理论方法论   45篇
综合类   3篇
社会学   177篇
统计学   45篇
  2022年   5篇
  2021年   3篇
  2020年   4篇
  2019年   14篇
  2018年   9篇
  2017年   17篇
  2016年   9篇
  2015年   12篇
  2014年   19篇
  2013年   77篇
  2012年   17篇
  2011年   15篇
  2010年   9篇
  2009年   11篇
  2008年   10篇
  2007年   12篇
  2006年   9篇
  2005年   4篇
  2004年   7篇
  2003年   10篇
  2002年   8篇
  2001年   4篇
  2000年   5篇
  1999年   5篇
  1998年   6篇
  1997年   4篇
  1995年   6篇
  1994年   5篇
  1993年   4篇
  1991年   3篇
  1989年   3篇
  1988年   1篇
  1986年   3篇
  1985年   3篇
  1984年   3篇
  1983年   2篇
  1982年   2篇
  1980年   4篇
  1979年   3篇
  1978年   5篇
  1977年   4篇
  1976年   3篇
  1975年   3篇
  1973年   1篇
  1971年   2篇
  1970年   1篇
  1968年   1篇
  1965年   1篇
  1963年   2篇
  1933年   1篇
排序方式: 共有375条查询结果,搜索用时 384 毫秒
91.
92.
We study the problem of (off-line) broadcast scheduling in minimizing total flow time and propose a dynamic programming approach to compute an optimal broadcast schedule. Suppose the broadcast server has k pages and the last page request arrives at time n. The optimal schedule can be computed in O(k3(n+k)k−1) time for the case that the server has a single broadcast channel. For m channels case, i.e., the server can broadcast m different pages at a time where m < k, the optimal schedule can be computed in O(nkm) time when k and m are constants. Note that this broadcast scheduling problem is NP-hard when k is a variable and will take O(nkm+1) time when k is fixed and m ≥ 1 with the straightforward implementation of the dynamic programming approach. The preliminary version of this paper appeared in Proceedings of the 11th Annual International Computing and Combinatorics Conference as “Off-line Algorithms for Minimizing the Total Flow Time in Broadcast Scheduling”.  相似文献   
93.
94.
The primary purpose of this study was to empirically examine whether or not informational impediments impair or alter decision making, with specific focus on capital budgeting decisions. Based on detailed interviews of senior corporate executives, it appears that management information systems (MIS) are less than adequate in providing the information items required to utilize the non-naive methods of capital budgeting. It is therefore suggested that the MIS concept be vastly broadened in regard to such decisions.  相似文献   
95.
96.
The authors examine alliances involving inter-firm co-operation which they term ‘multi-point alliances’. These are first defined and considered in varying degrees of complexity. A typology of multi-point alliances is produced, and interviews conducted with French and Spanish corporations followed by a two-stage questionnaire survey of France's largest corporations. The dynamics of multi-point co-operation were then examined. The results include support for the authors' research hypothesis that both business complexity (scope) and organizational complexity (structure) impact the evolution of co-operation: the higher the complexity, the more likely the co-operative arrangement will diverge from its initial objective.  相似文献   
97.
Leadership research has recently begun to emphasize the importance of examining the level of analysis (e.g., individual, dyad, group, organization) at which phenomena are hypothesized to occur. Unfortunately, however, it is still not commonplace for theory to clearly specify, and for investigations to directly test, expected and rival level-of-analysis effects. This article first selectively reviews a cross-section of theories, models, and approaches in leadership, showing generally poor alignment between theory and the level of analysis actually used in its testing. A multiple levels of analysis investigation of the Leader–Member Exchange (LMX) model is next presented. This theory has as its foundation the dyadic relationship between a supervisor and his or her subordinates. Yet, less than 10% of published LMX studies have examined level of analysis—and none has employed dyadic analysis. Using within- and between-entities analysis (WABA) and two different samples, four LMX level-of-analysis representations are tested, which involve monosource data; three of these models are then tested using heterosource data. Overall, good support is found for the LMX approach at the within-groups and between-dyads levels. Implications for aligning theory with appropriate levels of analysis in future research are considered.  相似文献   
98.
We propose a generalization of expected utility that we call generalized EU (GEU), where a decision maker’s beliefs are represented by plausibility measures and the decision maker’s tastes are represented by general (i.e., not necessarily real-valued) utility functions. We show that every agent, “rational” or not, can be modeled as a GEU maximizer. We then show that we can customize GEU by selectively imposing just the constraints we want. In particular, we show how each of Savage’s postulates corresponds to constraints on GEU.  相似文献   
99.
100.
Sororities have been identified as placing young women at risk for body image concerns due to a focus on traditional gender role norms and objectification of women. Objective: This study assessed the relationship between conformity to feminine gender role norms, self-objectification, and body image surveillance among undergraduate women. Participants: In a random sample of undergraduates, the authors examined data from sorority and nonsorority women. Methods: In a random sample of undergraduate women, the authors assessed the impact of traditional feminine gender role norms on self-objectification, body image, and feedback regarding physical appearance for sorority and nonsorority undergraduate women. Results: Three linear regressions were conducted, and only conformity to feminine gender role norms contributed significantly in each regression model. Conclusions: Regardless of sorority membership, conformity to feminine gender role norms was found to significantly contribute to increased body consciousness, negative body image, and feedback on physical appearance.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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