全文获取类型
收费全文 | 20045篇 |
免费 | 344篇 |
专业分类
管理学 | 2384篇 |
民族学 | 107篇 |
人才学 | 6篇 |
人口学 | 1870篇 |
丛书文集 | 114篇 |
教育普及 | 2篇 |
理论方法论 | 1844篇 |
现状及发展 | 1篇 |
综合类 | 282篇 |
社会学 | 9812篇 |
统计学 | 3967篇 |
出版年
2023年 | 97篇 |
2021年 | 106篇 |
2020年 | 301篇 |
2019年 | 484篇 |
2018年 | 499篇 |
2017年 | 687篇 |
2016年 | 476篇 |
2015年 | 380篇 |
2014年 | 463篇 |
2013年 | 3392篇 |
2012年 | 711篇 |
2011年 | 619篇 |
2010年 | 492篇 |
2009年 | 464篇 |
2008年 | 521篇 |
2007年 | 525篇 |
2006年 | 487篇 |
2005年 | 439篇 |
2004年 | 433篇 |
2003年 | 409篇 |
2002年 | 403篇 |
2001年 | 499篇 |
2000年 | 425篇 |
1999年 | 422篇 |
1998年 | 346篇 |
1997年 | 303篇 |
1996年 | 310篇 |
1995年 | 296篇 |
1994年 | 284篇 |
1993年 | 277篇 |
1992年 | 309篇 |
1991年 | 311篇 |
1990年 | 285篇 |
1989年 | 274篇 |
1988年 | 266篇 |
1987年 | 254篇 |
1986年 | 239篇 |
1985年 | 274篇 |
1984年 | 264篇 |
1983年 | 255篇 |
1982年 | 199篇 |
1981年 | 173篇 |
1980年 | 185篇 |
1979年 | 184篇 |
1978年 | 158篇 |
1977年 | 151篇 |
1976年 | 137篇 |
1975年 | 124篇 |
1974年 | 106篇 |
1973年 | 87篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
D. V. Gribanov D. S. Malyshev P. M. Pardalos S. I. Veselov 《Journal of Combinatorial Optimization》2018,36(4):1128-1144
This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem, where one of the centers must be in P, and we solve it in \(O(n^2\log n)\) time. Second, we consider the mixed k-center problem, where m of the centers are in P, and we solve it in \(O(n^{m+O(\sqrt{k-m})})\) time. Motivated by two practical constraints, we propose two variations of the problem. Third, we present a 2-approximation algorithm and three heuristics solving the mixed k-center problem (\(k>2\)). 相似文献
942.
A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete. 相似文献
943.
Network coding is a generalization of conventional routing methods that allows a network node to code information flows before forwarding them. While it has been theoretically proved that network coding can achieve maximum network throughput, theoretical results usually do not consider the stochastic nature in information processing and transmission, especially when the capacity of each arc becomes stochastic due to failure, attacks, or maintenance. Hence, the reliability measurement of network coding becomes an important issue to evaluate the performance of the network under various system settings. In this paper, we present analytical expressions to measure the reliability of multicast communications in coded networks, where network coding is most promising. We define the probability that a multicast rate can be transmitted through a coded packet network under a total transmission cost constraint as the reliability metric. To do this, we first introduce an exact mathematical formulation to construct multicast connections over coded packet networks under a limited transmission cost. We then propose an algorithm based on minimal paths to calculate the reliability measurement of multicast connections and analyze the complexity of the algorithm. Our results show that the reliability of multicast routing with network coding improved significantly compared to the case of multicast routing without network coding. 相似文献
944.
Over the last fifteen years companies tended to formalise their innovation management activities and to establish formal jobs like the innovation officer, the network manager or the innovation manager. Knowledge of the informal role profiles of these formal roles is still rare. HR and R&D Managers do not know which informal role profile might suit them best, thus having difficulties to assign the best candidates for jobs in innovation management. Researchers cannot help to resolve the problem. Our research answers the question what innovation managers really do, by analysing their tasks, skills and traits, theoretically based on informal role theories. Furthermore, we will analyse how these characteristics change with company size. To provide answers to our research questions we choose a multiple-case study approach. We found, among others, that innovation managers fulfil the role of the relationship and process promotor or a combination of both with the champion, but we also found, that the innovation manager’s roles profile becomes fuzzier with shrinking company size. Our results have practical implications for top management and also HR and R&D managers, enabling them to better select and steer employees in innovation management. Researchers will be able to build on our results because we offer a comprehensive understanding of the informal role profiles of innovation managers based on informal role theories. 相似文献
945.
The purpose of our research is to examine the relationship between subordinate ratings of a target-leader's empathic emotion and boss ratings of performance of that target-leader. Furthermore, using hierarchical linear modeling, we assess whether the cultural background of the target-leader moderates this relationship. Our results show that leaders who are rated by their subordinates as engaging in behaviors that signal empathic emotion are perceived as better performers by their bosses. In addition, we found that the GLOBE societal culture dimension of power distance was a significant cross-level moderator of the relationship between empathic emotion and performance. Implications for leading in cross-cultural and multicultural contexts are discussed. 相似文献
946.
The leader–member exchange (LMX) theory of leadership focuses on the quality of relationships built between leaders and subordinates; LMX measures are designed to assess the quality of these relationships. Since the leader and subordinate are jointly embedded in the relationship, it is reasonable to assume that their ratings of their relationship will converge to some reasonable extent. However, leader–member convergence on the most widely used measures, the LMX-7 and SLMX-7 scales, has historically been low. To address this, we conduct two studies to investigate whether item wording and content might be a cause of poor LMX convergence. The obtained results support the conclusion that the wording and content of these measures are, in fact, introducing attributional and social desirability biases into the rating process and causing some of the poor LMX convergence that is commonly seen. Implications for extant and future LMX research are discussed. 相似文献
947.
The study of character is a legitimate and essential topic for the analysis of leadership in organizations. We undertake three key objectives in this article to stimulate meaningful dialogue. First, a brief historical overview of the extant body of literature on character is provided. Second, working definitions of character and character-based leadership are introduced. Third, new directions for organizational scholars interested in examining the role of character-based leadership in both their research and teaching domains are suggested. 相似文献
948.
949.
Explore the challenges in making performance improvement data publicly available on hospital websites, and consider some practical tips and suggestions for aligning organizational goals with community and consumer needs. 相似文献
950.