首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2221篇
  免费   145篇
  国内免费   55篇
管理学   162篇
劳动科学   4篇
民族学   27篇
人口学   31篇
丛书文集   237篇
理论方法论   95篇
综合类   1354篇
社会学   74篇
统计学   437篇
  2024年   22篇
  2023年   60篇
  2022年   72篇
  2021年   67篇
  2020年   77篇
  2019年   63篇
  2018年   85篇
  2017年   84篇
  2016年   72篇
  2015年   76篇
  2014年   204篇
  2013年   250篇
  2012年   193篇
  2011年   195篇
  2010年   156篇
  2009年   119篇
  2008年   101篇
  2007年   106篇
  2006年   88篇
  2005年   66篇
  2004年   51篇
  2003年   55篇
  2002年   34篇
  2001年   31篇
  2000年   19篇
  1999年   28篇
  1998年   11篇
  1997年   6篇
  1996年   4篇
  1995年   7篇
  1994年   2篇
  1993年   5篇
  1992年   4篇
  1990年   3篇
  1988年   3篇
  1986年   1篇
  1982年   1篇
排序方式: 共有2421条查询结果,搜索用时 15 毫秒
91.
随着商品经济的发展和市场竞争的加剧,发达的商品经济以其高雅文化的面貌征服了人们的情感,表现为一种双赢的商品交易与极具亲和力的现代营销——“人文营销”。它使企业以人文要素为中心展开营销活动,通过营销整合,营造强烈的人文氛围,重视企业与企业之间、企业与消费者之间的良性沟通及人文关怀,强化竞争及交易双方的亲和力,从而实现有效营销。  相似文献   
92.
93.
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing   总被引:1,自引:1,他引:1  
With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Internet routing protocol (IRP). Traffic flow is routed along shortest paths, splitting flow at nodes with several outgoing links on a shortest path to the destination IP address. Link weights are assigned by the network operator. A path length is the sum of the weights of the links in the path. The OSPF weight setting (OSPFWS) problem seeks a set of weights that optimizes network performance. We study the problem of optimizing OSPF weights, given a set of projected demands, with the objective of minimizing network congestion. The weight assignment problem is NP-hard. We present a genetic algorithm (GA) to solve the OSPFWS problem. We compare our results with the best known and commonly used heuristics for OSPF weight setting, as well as with a lower bound of the optimal multi-commodity flow routing, which is a linear programming relaxation of the OSPFWS problem. Computational experiments are made on the AT&T Worldnet backbone with projected demands, and on twelve instances of synthetic networks.  相似文献   
94.
回顾农村20年的制度变迁及改革创造的巨大绩效,以家庭联产承包制、乡镇企业和村民自治为主线,可以寻见改革存在路径,即:扩大农民自主权。从经济社会系统的“复杂性”理论角度看,“扩大自主权”这一基层进化的经验经由系统的作用形成了自下而上的组织创新,有助于组织群体的系统转换具有路径依赖性,并以路径效应──政府与农民的互动(自下而上的自发创造与自上而下的自觉选择的互动发展)──拓展积聚了由农民个体自主权扩增而导致的农村社会整体发展效应。现实地看,这一路径必将成为实现农村、农业、农民“三农”现代化的最动态的增效源泉。  相似文献   
95.
黄河源区草地生态环境的恶化趋势,并没有因近几年政策的投入而得到遏制.因此,有必要对其形成原因及治理的制度结构进行分析,以厘清此类地区实现可持续发展所必需的制度创新.以黄河源区的玛曲县近三十年过牧历史为案例,对高寒牧区制度变迁中的路径依赖和锁定问题进行了新的阐释,并对可持续性的制度框架进行了设计.  相似文献   
96.
在1921年7月到1927年7月的毛泽东思想萌芽时期,瞿秋白提出中国革命必须以武装斗争--"革命战争"为主要形式;必须建立革命军队、党指挥枪、进行土地革命;必须建立"农民政权"--实际上就是建立农村革命根据地,以"农村包围城市"思想的萌芽.瞿秋白对中国革命道路理论的前所未有的探索是开拓性的贡献.瞿秋白是探索中国革命道路的先驱.  相似文献   
97.
Vallerand et al. (2003) have proposed that individuals can have two distinct types of passion toward an activity. Harmonious passion, an internal force leading one to choose to engage in the activity, is proposed to be associated with positive consequences. Obsessive passion, an internal pressure forcing one to engage in an activity, is posited to be associated with negative consequences. The present study sought to determine the role of the two types of passion in various cognitive and affective states associated with dependence and problems with gambling. Participants (n = 412) were recruited at the Montréal Casino and given a questionnaire measuring passion toward gambling, as well as consequences associated with dependence and problem gambling. Results showed that obsessive passion for gambling predicted poorer vitality and concentration in daily tasks, as well as increased rumination, anxiety, negative mood, guilt, and problem gambling. These relations were not found for harmonious passion for gambling. Results are discussed in light of the motivational approach to passion (Vallerand et al., 2003).  相似文献   
98.
Summary: We describe depth–based graphical displays that show the interdependence of multivariate distributions. The plots involve one–dimensional curves or bivariate scatterplots, so they are easier to interpret than correlation matrices. The correlation curve, modelled on the scale curve of Liu et al. (1999), compares the volume of the observed central regions with the volume under independence. The correlation DD–plot is the scatterplot of depth values under a reference distribution against depth values under independence. The area of the plot gives a measure of distance from independence. Correlation curve and DD-plot require an independence model as a baseline: Besides classical parametric specifications, a nonparametric estimator, derived from the randomization principle, is used. Combining data depth and the notion of quadrant dependence, quadrant correlation trajectories are obtained which allow simultaneous representation of subsets of variables. The properties of the plots for the multivariate normal distribution are investigated. Some real data examples are illustrated. *This work was completed with the support of Ca Foscari University.  相似文献   
99.
This paper proposes an optimization model and shows that most inverse combinatorial optimization problems so far discussed can be fit into this model as special cases. We propose a Newton-type algorithm for this model under l norm. This algorithm can solve the model in strongly polynomial time if the subproblem involved is solvable in strongly polynomial time for any fixed value of the parameter appearing in the subproblem, and it is shown that most particular inverse optimization problems encountered are this kind. Therefore, through this paper we show that a large group of inverse optimization problems can be handled in a uniform way and solved in strongly polynomial time.  相似文献   
100.
"诚信"是市场经济对大学生的基本道德要求。在当前大学生"诚信"道德现状堪忧的情况下,"诚信"道德教育势在必行。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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