全文获取类型
收费全文 | 11521篇 |
免费 | 42篇 |
国内免费 | 4篇 |
专业分类
管理学 | 1595篇 |
民族学 | 110篇 |
人才学 | 1篇 |
人口学 | 2446篇 |
丛书文集 | 135篇 |
理论方法论 | 542篇 |
综合类 | 730篇 |
社会学 | 4604篇 |
统计学 | 1404篇 |
出版年
2023年 | 7篇 |
2022年 | 14篇 |
2021年 | 23篇 |
2020年 | 25篇 |
2019年 | 28篇 |
2018年 | 1692篇 |
2017年 | 1682篇 |
2016年 | 1095篇 |
2015年 | 74篇 |
2014年 | 78篇 |
2013年 | 162篇 |
2012年 | 378篇 |
2011年 | 1205篇 |
2010年 | 1113篇 |
2009年 | 841篇 |
2008年 | 876篇 |
2007年 | 1070篇 |
2006年 | 48篇 |
2005年 | 288篇 |
2004年 | 286篇 |
2003年 | 245篇 |
2002年 | 118篇 |
2001年 | 34篇 |
2000年 | 31篇 |
1999年 | 29篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 34篇 |
1995年 | 5篇 |
1994年 | 9篇 |
1993年 | 4篇 |
1992年 | 9篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1988年 | 10篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
691.
Many Americans endorse a colorblind racial ideology, meaning they strive to “not see race” and emphasize sameness and equal distribution of resources across racial lines. Currently, there is an absence of studies examining the personality and individual difference correlates of racial colorblindness. The current study investigated the association between three different aspects of racial colorblindness (unawareness of racial privilege, unawareness of institutional discrimination, and unawareness of blatant racism) and the Big 5, empathy, and aggression in white undergraduates. Our results revealed two divergent patterns. Unawareness of racial privilege was related to lower openness and perspective taking, but more empathic concern, whereas unawareness of blatant racism and unawareness of institutional discrimination were related to lower agreeableness, perspective taking, and empathic concern. These results are discussed in relation to the broader literature on prejudice and personality. 相似文献
692.
693.
Vicky Mak-Hau 《Journal of Combinatorial Optimization》2017,33(1):35-59
The Kidney Exchange Problem (KEP) is a combinatorial optimization problem and has attracted the attention from the community of integer programming/combinatorial optimisation in the past few years. Defined on a directed graph, the KEP has two variations: one concerns cycles only, and the other, cycles as well as chains on the same graph. We call the former a Cardinality Constrained Multi-cycle Problem (CCMcP) and the latter a Cardinality Constrained Cycles and Chains Problem (CCCCP). The cardinality for cycles is restricted in both CCMcP and CCCCP. As for chains, some studies in the literature considered cardinality restrictions, whereas others did not. The CCMcP can be viewed as an Asymmetric Travelling Salesman Problem that does allow subtours, however these subtours are constrained by cardinality, and that it is not necessary to visit all vertices. In existing literature of the KEP, the cardinality constraint for cycles is usually considered to be small (to the best of our knowledge, no more than six). In a CCCCP, each vertex on the directed graph can be included in at most one cycle or chain, but not both. The CCMcP and the CCCCP are interesting and challenging combinatorial optimization problems in their own rights, particularly due to their similarities to some travelling salesman- and vehicle routing-family of problems. In this paper, our main focus is to review the existing mathematical programming models and solution methods in the literature, analyse the performance of these models, and identify future research directions. Further, we propose a polynomial-sized and an exponential-sized mixed-integer linear programming model, discuss a number of stronger constraints for cardinality-infeasible-cycle elimination for the latter, and present some preliminary numerical results. 相似文献
694.
Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (Discret Appl Math 118:239–248, 2002) proved that it is in polynomial time for quadrilateral-free graphs and proposed an \(O(n^{11})\) algorithm for the same, here n is the number of vertices in the graph, (along with a note that by a straightforward but lengthy argument it can be proved to be solvable in \(O(n^5)\) running time). In this paper we propose an \(O(n^2)\) time algorithm for finding a maximum cardinality neighbourly set in a quadrilateral-free graph. 相似文献
695.
Peter Brown Yuedong Yang Yaoqi Zhou Wayne Pullan 《Journal of Combinatorial Optimization》2017,33(2):551-566
The linear sum assignment problem is a fundamental combinatorial optimisation problem and can be broadly defined as: given an \(n \times m, m \ge n\) benefit matrix \(B = (b_{ij})\), matching each row to a different column so that the sum of entries at the row-column intersections is maximised. This paper describes the application of a new fast heuristic algorithm, Asymmetric Greedy Search, to the asymmetric version (\(n \ne m\)) of the linear sum assignment problem. Extensive computational experiments, using a range of model graphs demonstrate the effectiveness of the algorithm. The heuristic was also incorporated within an algorithm for the non-sequential protein structure matching problem where non-sequential alignment between two proteins, normally of different numbers of amino acids, needs to be maximised. 相似文献
696.
Cong Chen Yinfeng Xu Yuqing Zhu Chengyu Sun 《Journal of Combinatorial Optimization》2017,33(2):590-608
MapReduce system is a popular big data processing framework, and the performance of it is closely related to the efficiency of the centralized scheduler. In practice, the centralized scheduler often has little information in advance, which means each job may be known only after being released. In this paper, hence, we consider the online MapReduce scheduling problem of minimizing the makespan, where jobs are released over time. Both preemptive and non-preemptive version of the problem are considered. In addition, we assume that reduce tasks cannot be parallelized because they are often complex and hard to be decomposed. For the non-preemptive version, we prove the lower bound is \(\frac{m+m(\Psi (m)-\Psi (k))}{k+m(\Psi (m)-\Psi (k))}\), higher than the basic online machine scheduling problem, where k is the root of the equation \(k=\big \lfloor {\frac{m-k}{1+\Psi (m)-\Psi (k)}+1 }\big \rfloor \) and m is the quantity of machines. Then we devise an \((2-\frac{1}{m})\)-competitive online algorithm called MF-LPT (Map First-Longest Processing Time) based on the LPT. For the preemptive version, we present a 1-competitive algorithm for two machines. 相似文献
697.
Reuven Cohen Mira Gonen Asaf Levin Shmuel Onn 《Journal of Combinatorial Optimization》2017,33(2):645-659
In this paper we define the exact k-coverage problem, and study it for the special cases of intervals and circular-arcs. Given a set system consisting of a ground set of n points with integer demands \(\{d_0,\dots ,d_{n-1}\}\) and integer rewards, subsets of points, and an integer k, select up to k subsets such that the sum of rewards of the covered points is maximized, where point i is covered if exactly \(d_i\) subsets containing it are selected. Here we study this problem and some related optimization problems. We prove that the exact k-coverage problem with unbounded demands is NP-hard even for intervals on the real line and unit rewards. Our NP-hardness proof uses instances where some of the natural parameters of the problem are unbounded (each of these parameters is linear in the number of points). We show that this property is essential, as if we restrict (at least) one of these parameters to be a constant, then the problem is polynomial time solvable. Our polynomial time algorithms are given for various generalizations of the problem (in the setting where one of the parameters is a constant). 相似文献
698.
For an integer \(k \ge 1\), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V(G) is at distance at most k from some vertex of S. The distance k-domination number \(\gamma _k(G)\) of G is the minimum cardinality of a distance k-dominating set of G. In this paper, we establish an upper bound on the distance k-domination number of a graph in terms of its order, minimum degree and maximum degree. We prove that for \(k \ge 2\), if G is a connected graph with minimum degree \(\delta \ge 2\) and maximum degree \(\Delta \) and of order \(n \ge \Delta + k - 1\), then \(\gamma _k(G) \le \frac{n + \delta - \Delta }{\delta + k - 1}\). This result improves existing known results. 相似文献
699.
Muhammad Kamran Siddiqui Deeba Afzal Muhammad Ramzan Faisal 《Journal of Combinatorial Optimization》2017,34(2):534-544
An edge irregular total k-labeling \(\varphi : V\cup E \rightarrow \{ 1,2, \dots , k \}\) of a graph \(G=(V,E)\) is a labeling of vertices and edges of G in such a way that for any different edges xy and \(x'y'\) their weights \(\varphi (x)+ \varphi (xy) + \varphi (y)\) and \(\varphi (x')+ \varphi (x'y') + \varphi (y')\) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. We have determined the exact value of the total edge irregularity strength of accordion graphs. 相似文献
700.
Let \(G=G(V,E)\) be a graph. A proper coloring of G is a function \(f:V\rightarrow N\) such that \(f(x)\ne f(y)\) for every edge \(xy\in E\). A proper coloring of a graph G such that for every \(k\ge 1\), the union of any k color classes induces a \((k-1)\)-degenerate subgraph is called a degenerate coloring; a proper coloring of a graph with no two-colored \(P_{4}\) is called a star coloring. If a coloring is both degenerate and star, then we call it a degenerate star coloring of graph. The corresponding chromatic number is denoted as \(\chi _{sd}(G)\). In this paper, we employ entropy compression method to obtain a new upper bound \(\chi _{sd}(G)\le \lceil \frac{19}{6}\Delta ^{\frac{3}{2}}+5\Delta \rceil \) for general graph G. 相似文献