全文获取类型
收费全文 | 20912篇 |
免费 | 417篇 |
专业分类
管理学 | 2861篇 |
民族学 | 109篇 |
人才学 | 2篇 |
人口学 | 2080篇 |
丛书文集 | 88篇 |
教育普及 | 1篇 |
理论方法论 | 1875篇 |
现状及发展 | 1篇 |
综合类 | 461篇 |
社会学 | 9625篇 |
统计学 | 4226篇 |
出版年
2023年 | 141篇 |
2022年 | 118篇 |
2021年 | 143篇 |
2020年 | 353篇 |
2019年 | 429篇 |
2018年 | 595篇 |
2017年 | 792篇 |
2016年 | 617篇 |
2015年 | 415篇 |
2014年 | 516篇 |
2013年 | 3598篇 |
2012年 | 821篇 |
2011年 | 613篇 |
2010年 | 493篇 |
2009年 | 465篇 |
2008年 | 531篇 |
2007年 | 510篇 |
2006年 | 439篇 |
2005年 | 488篇 |
2004年 | 451篇 |
2003年 | 449篇 |
2002年 | 495篇 |
2001年 | 507篇 |
2000年 | 476篇 |
1999年 | 440篇 |
1998年 | 323篇 |
1997年 | 293篇 |
1996年 | 293篇 |
1995年 | 271篇 |
1994年 | 239篇 |
1993年 | 252篇 |
1992年 | 290篇 |
1991年 | 267篇 |
1990年 | 262篇 |
1989年 | 278篇 |
1988年 | 263篇 |
1987年 | 246篇 |
1986年 | 248篇 |
1985年 | 278篇 |
1984年 | 255篇 |
1983年 | 252篇 |
1982年 | 185篇 |
1981年 | 174篇 |
1980年 | 166篇 |
1979年 | 205篇 |
1978年 | 165篇 |
1977年 | 142篇 |
1976年 | 129篇 |
1975年 | 139篇 |
1974年 | 121篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
961.
Charlotta Sirén Pankaj C. Patel Daniel Örtqvist Joakim Wincent 《Long Range Planning》2018,51(6):953-971
Despite the possibility of burnout resulting from dynamics in firms' upper echelons, little if any work has focused on chief executive officer's (CEO's) burnout and firm performance. Drawing on managerial discretion theory, this article analyzes the influence of CEO burnout on firm performance and the moderating roles of the individual (CEO locus of control), structural power (CEO duality and CEO tenure), and organizational characteristics (size, age, and resource availability) related to managerial discretion. Using a sample of 156 CEOs in Swedish firms, we find a negative association between CEOs who report higher burnout and firm performance. Our results confirm that CEO duality and resource availability ameliorate and firm size exacerbates the negative association between CEO burnout and firm performance. Contrary to our expectations, CEO locus of control, CEO tenure, and firm age do not influence this relationship. We discuss the implications of our research for upper echelons theory and strategic leadership theory. 相似文献
962.
Work overload is a critical but understudied stressor at work, particularly for boundary-spanning positions. Recent studies have highlighted the need for more research on the identification of different predictors of the use of intimidation, a type of assertive impression management tactic. Relying on Lazarus's transactional theory, this study hypothesized and investigated a mediated moderation model that includes resilience, work overload, and its outcomes.This paper contributes to the organizational literature by examining the use of intimidation by salespeople as a reaction to stressful circumstances and the association between this tactic and salespeople's performance. The information provided by 248 employee–supervisor dyads confirmed the proposed model. Work overload has a positive association with intimidation, and the direct effect of work overload on intimidation depends on the level of an employee's resilience. Finally, the use of intimidation has a negative association with supervisor-rated performance. 相似文献
963.
In the current investigation, idiosyncratic deals (i-deals; individualized work arrangements) are modeled as differentiated resources that shape leader-member exchange (LMX) relationships in workgroups. We integrate literature on leader-member exchange (LMX) with research on i-deals to argue that employee evaluations of i-deals received from the grantor –typically the leader- enhance employee perceptions of LMX, which in turn become instrumental in generating positive performance outcomes. Furthermore, because workgroup characteristics have potential implications on the relationship between a deal grantor and the deal recipient, drawing upon social identity theory of leadership, we reason that the i-deals-LMX relationship is affected by the overall value congruence among the group members. Cross-level moderated mediation analyses on multi source data obtained from 289 employees nested in 60 workgroups showed that the mediational role of LMX in the i-deals to performance outcomes relationship was weaker in high value congruence groups. 相似文献
964.
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\)). 相似文献
965.
We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph \(G=(V,E)\) that can be solved as a linear minimum spanning tree problem. We give a characterization of such problems when G is a complete graph, which is the standard case in the QMSTP literature. We extend our characterization to a larger class of graphs that include complete bipartite graphs and cactuses, among others. Our characterization can be verified in \(O(|E|^2)\) time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in O(|E|) time. Related open problems are also indicated. 相似文献
966.
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. 相似文献
967.
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. 相似文献
968.
Francisco J. Aragón Artacho Rubén Campoy Ilias Kotsireas Matthew K. Tam 《Journal of Combinatorial Optimization》2018,35(4):1061-1085
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas–Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler’s table. 相似文献
969.
Marin Bougeret Guillerme Duvillié Rodolphe Giroudeau 《Journal of Combinatorial Optimization》2018,36(3):1059-1073
In this paper we consider the multidimensional binary vector assignment problem. An input of this problem is defined by m disjoint multisets \(V^1, V^2, \ldots , V^m\), each composed of n binary vectors of size p. An output is a set of n disjoint m-tuples of vectors, where each m-tuple is obtained by picking one vector from each multiset \(V^i\). To each m-tuple we associate a p dimensional vector by applying the bit-wise AND operation on the m vectors of the tuple. The objective is to minimize the total number of zeros in these n vectors. We denote this problem by Open image in new window , and the restriction of this problem where every vector has at most c zeros by Open image in new window . Open image in new window was only known to be Open image in new window -hard, even for Open image in new window . We show that, assuming the unique games conjecture, it is Open image in new window -hard to Open image in new window -approximate Open image in new window for any fixed Open image in new window and Open image in new window . This result is tight as any solution is a Open image in new window -approximation. We also prove without assuming UGC that Open image in new window is Open image in new window -hard even for Open image in new window . Finally, we show that Open image in new window is polynomial-time solvable for fixed Open image in new window (which cannot be extended to Open image in new window ). 相似文献
970.
Mohammed-Albarra Hassan Imed Kacem Sébastien Martin Izzeldin M. Osman 《Journal of Combinatorial Optimization》2018,36(3):1074-1101
In this paper we study the m-clique free interval subgraphs. We investigate the facial structure of the polytope defined as the convex hull of the incidence vectors associated with these subgraphs. We also present some facet-defining inequalities to strengthen the associated linear relaxation. As an application, the generalized open-shop problem with disjunctive constraints (GOSDC) is considered. Indeed, by a projection on a set of variables, the m-clique free interval subgraphs represent the solution of an integer linear program solving the GOSDC presented in this paper. Moreover, we propose exact and heuristic separation algorithms, which are exploited into a Branch-and-cut algorithm for solving the GOSDC. Finally, we present and discuss some computational results. 相似文献