全文获取类型
收费全文 | 27190篇 |
免费 | 513篇 |
国内免费 | 15篇 |
专业分类
管理学 | 3694篇 |
民族学 | 187篇 |
人才学 | 2篇 |
人口学 | 3840篇 |
丛书文集 | 176篇 |
教育普及 | 1篇 |
理论方法论 | 2158篇 |
综合类 | 1017篇 |
社会学 | 13265篇 |
统计学 | 3378篇 |
出版年
2023年 | 80篇 |
2021年 | 132篇 |
2020年 | 260篇 |
2019年 | 325篇 |
2018年 | 1999篇 |
2017年 | 2191篇 |
2016年 | 1440篇 |
2015年 | 364篇 |
2014年 | 419篇 |
2013年 | 2762篇 |
2012年 | 903篇 |
2011年 | 1702篇 |
2010年 | 1482篇 |
2009年 | 1206篇 |
2008年 | 1328篇 |
2007年 | 1496篇 |
2006年 | 567篇 |
2005年 | 704篇 |
2004年 | 651篇 |
2003年 | 587篇 |
2002年 | 473篇 |
2001年 | 428篇 |
2000年 | 377篇 |
1999年 | 352篇 |
1998年 | 259篇 |
1997年 | 232篇 |
1996年 | 267篇 |
1995年 | 232篇 |
1994年 | 214篇 |
1993年 | 212篇 |
1992年 | 244篇 |
1991年 | 237篇 |
1990年 | 223篇 |
1989年 | 218篇 |
1988年 | 220篇 |
1987年 | 226篇 |
1986年 | 204篇 |
1985年 | 210篇 |
1984年 | 223篇 |
1983年 | 190篇 |
1982年 | 183篇 |
1981年 | 159篇 |
1980年 | 148篇 |
1979年 | 164篇 |
1978年 | 137篇 |
1977年 | 109篇 |
1976年 | 131篇 |
1975年 | 144篇 |
1974年 | 107篇 |
1971年 | 77篇 |
排序方式: 共有10000条查询结果,搜索用时 93 毫秒
951.
Corinna Gottschalk Hendrik Lüthen Britta Peis Andreas Wierz 《Journal of Combinatorial Optimization》2018,36(3):861-870
In 1984, Gabow and Tarjan provided a very elegant and fast algorithm for the following problem: given a matroid defined on a red and blue colored ground set, determine a basis of minimum cost among those with k red elements, or decide that no such basis exists. In this paper, we investigate extensions of this problem from ordinary matroids to the more general notion of poset matroids which take precedence constraints on the ground set into account. We show that the problem on general poset matroids becomes -hard, already if the underlying partially ordered set (poset) consists of binary trees of height two. On the positive side, we present two algorithms: a pseudopolynomial one for integer polymatroids, i.e., the case where the poset consists of disjoint chains, and a polynomial algorithm for the problem to determine a minimum cost ideal of size l with k red elements, i.e., the uniform rank-l poset matroid, on series-parallel posets. 相似文献
952.
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. 相似文献
953.
In the facility location game on a line, there are some agents who have fixed locations on the line where an obnoxious facility will be placed. The objective is to maximize the social welfare, e.g., the sum of distances from the facility to all agents. On collecting location information, agents may misreport the locations so as to stay far away from the obnoxious facility. In this paper, strategy-proof mechanisms are designed and the approximation ratio is used to measure the performances of the strategy-proof mechanisms. Two objective functions, maximizing the sum of squares of distances (maxSOS) and maximizing the sum of distances (maxSum), have been considered. For maxSOS, a randomized 5/3-approximated strategy-proof mechanism is proposed, and the lower bound of the approximation ratio is proved to be at least 1.042. For maxSum, the lower bound of the approximation ratio of the randomized strategy-proof mechanism is proved to be 1.077. Moreover, a general model is considered that each agent may have multiple locations on the line. For the objective functions maxSum and maxSOS, both deterministic and randomized strategy-proof mechanisms are investigated, and the deterministic mechanisms are shown to be best possible. 相似文献
954.
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g. in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete graph that allows to represent the topology of this graph as a vertex-colored tree. Here, we are interested in the structure and the complexity of certain combinatorial problems resulting from considerations based on symbolic ultrametrics, and on algorithms to solve them.This includes, the characterization of symbolic ultrametrics that additionally distinguishes between edges and non-edges of arbitrary edge-colored graphs G and thus, yielding a tree representation of G, by means of so-called cographs. Moreover, we address the problem of finding “closest” symbolic ultrametrics and show the NP-completeness of the three problems: symbolic ultrametric editing, completion and deletion. Finally, as not all graphs are cographs, and hence, do not have a tree representation, we ask, furthermore, what is the minimum number of cotrees needed to represent the topology of an arbitrary non-cograph G. This is equivalent to find an optimal cograph edge k-decomposition \(\{E_1,\dots ,E_k\}\) of E so that each subgraph \((V,E_i)\) of G is a cograph. We investigate this problem in full detail, resulting in several new open problems, and NP-hardness results.For all optimization problems proven to be NP-hard we will provide integer linear program formulations to solve them. 相似文献
955.
A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S is adjacent from at least one vertex in S. The domination number of D, denoted by \(\gamma (D)\), is the minimum cardinality of a dominating set of D. The Slater number \(s\ell (D)\) is the smallest integer t such that t added to the sum of the first t terms of the non-increasing out-degree sequence of D is at least as large as the order of D. For any digraph D of order n with maximum out-degree \(\Delta ^+\), it is known that \(\gamma (D)\ge \lceil n/(\Delta ^++1)\rceil \). We show that \(\gamma (D)\ge s\ell (D)\ge \lceil n/(\Delta ^++1)\rceil \) and the difference between \(s\ell (D)\) and \(\lceil n/(\Delta ^++1)\rceil \) can be arbitrarily large. In particular, for an oriented tree T of order n with \(n_0\) vertices of out-degree 0, we show that \((n-n_0+1)/2\le s\ell (T)\le \gamma (T)\le 2s\ell (T)-1\) and moreover, each value between the lower bound \(s\ell (T)\) and the upper bound \(2s\ell (T)-1\) is attainable by \(\gamma (T)\) for some oriented trees. Further, we characterize the oriented trees T for which \(s\ell (T)=(n-n_0+1)/2\) hold and show that the difference between \(s\ell (T)\) and \((n-n_0+1)/2\) can be arbitrarily large. Some other elementary properties involving the Slater number are also presented. 相似文献
956.
Matthew J. Slater Martin J. Turner Andrew L. Evans Marc V. Jones 《The Leadership Quarterly》2018,29(3):379-388
The influence of relational identification (RI) on leadership processes and the effects of social identity leadership on followers' responses to stress have received scant theoretical and research attention. The present research advances theoretical understanding by testing the assertion that high RI with the leader drives follower mobilization of effort and psychophysiological responses to stress. Two experimental scenario studies (Study 1 and Study 2) support the hypothesis that being led by an individual with whom followers perceive high RI increases follower intentional mobilization. Study 2 additionally showed that high (vs. low) RI increases follower resource appraisals and cognitive task performance. A laboratory experiment (Study 3) assessing cardiovascular (CV) reactivity showed that, compared to neutral (i.e., non-affiliated) leadership, being led by an individual with whom participants felt low RI elicited a maladaptive (i.e., threat) response to a pressurized task. In addition, relative to the low RI and neutral conditions, high RI with the leader did not engender greater challenge or threat reactivity. In conclusion, advancing social identity leadership and challenge and threat theory, findings suggest that leaders should be mindful of the deleterious effects (i.e., reduced mobilization and greater threat state) of low RI to optimize follower mobilization of effort and psychophysiological responses to stress. 相似文献
957.
Siham Lekchiri Barbara. A. W. Eversole Robert. G. Hamlin Cindy. L. Crowder 《Human Resource Development International》2018,21(4):340-361
The purpose of this research was to determine what behaviourally distinguishes effective and ineffective managers within a Moroccan Higher Education Institution (HEI). The critical incident technique (CIT) was the methodology deployed to collect data from participants in terms of how they perceive managers as either effective or ineffective. The collected data (CIs) were subjected to content and thematic analysis that resulted in derived positive and negative behavioural statements (BSs). A total of 42 participants/informants were interviewed and revealed a total of 418 CIs, of which 189 were positive CIs and 229 were negative. The analysis revealed a total of 49 BSs, of which 19 were positive and 30 were negative behavioural indicators. The findings of this investigation bring empirical evidence to understand what and how managers are perceived as effective or ineffective in the Moroccan academic context and, therefore, adds to the literature. The information obtained can also provide rich information/knowledge that can be used as a basis to address the behavioural developmental needs of managers in HEIs. This research adds value by following by following two previous replication studies in a French and a Hungarian HEI; moreover, this study is the first to be conducted in the Moroccan/North African region. 相似文献
958.
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 ). 相似文献
959.
An oriented graph \(G^\sigma \) is a digraph without loops or multiple arcs whose underlying graph is G. Let \(S\left( G^\sigma \right) \) be the skew-adjacency matrix of \(G^\sigma \) and \(\alpha (G)\) be the independence number of G. The rank of \(S(G^\sigma )\) is called the skew-rank of \(G^\sigma \), denoted by \(sr(G^\sigma )\). Wong et al. (Eur J Comb 54:76–86, 2016) studied the relationship between the skew-rank of an oriented graph and the rank of its underlying graph. In this paper, the correlation involving the skew-rank, the independence number, and some other parameters are considered. First we show that \(sr(G^\sigma )+2\alpha (G)\geqslant 2|V_G|-2d(G)\), where \(|V_G|\) is the order of G and d(G) is the dimension of cycle space of G. We also obtain sharp lower bounds for \(sr(G^\sigma )+\alpha (G),\, sr(G^\sigma )-\alpha (G)\), \(sr(G^\sigma )/\alpha (G)\) and characterize all corresponding extremal graphs. 相似文献
960.
Because of its application in the field of security in wireless sensor networks, k-path vertex cover (\(\hbox {VCP}_k\)) has received a lot of attention in recent years. Given a graph \(G=(V,E)\), a vertex set \(C\subseteq V\) is a k-path vertex cover (\(\hbox {VCP}_k\)) of G if every path on k vertices has at least one vertex in C, and C is a connected k-path vertex cover of G (\(\hbox {CVCP}_k\)) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for \(\hbox {MinCVCP}_k\) on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the time-complexity, but also simplifies the analysis by a large amount. 相似文献